./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/eca-rers2012/Problem14_label53_true-unreach-call_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/eca-rers2012/Problem14_label53_true-unreach-call_false-termination.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 197209881b4fe70c7fe468e7084aa1de2f7c6240 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2018-12-30 23:19:04,848 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-30 23:19:04,850 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-30 23:19:04,864 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-30 23:19:04,865 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-30 23:19:04,866 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-30 23:19:04,868 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-30 23:19:04,870 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-30 23:19:04,872 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-30 23:19:04,873 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-30 23:19:04,874 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-30 23:19:04,874 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-30 23:19:04,875 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-30 23:19:04,878 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-30 23:19:04,882 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-30 23:19:04,883 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-30 23:19:04,887 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-30 23:19:04,889 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-30 23:19:04,893 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-30 23:19:04,894 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-30 23:19:04,899 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-30 23:19:04,900 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-30 23:19:04,904 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-30 23:19:04,904 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-30 23:19:04,905 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-30 23:19:04,905 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-30 23:19:04,907 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-30 23:19:04,911 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-30 23:19:04,912 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-30 23:19:04,914 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-30 23:19:04,915 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-30 23:19:04,915 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-30 23:19:04,916 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-30 23:19:04,916 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-30 23:19:04,917 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-30 23:19:04,917 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-30 23:19:04,919 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-30 23:19:04,940 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-30 23:19:04,941 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-30 23:19:04,942 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-30 23:19:04,942 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-30 23:19:04,942 INFO L133 SettingsManager]: * Use SBE=true [2018-12-30 23:19:04,942 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-30 23:19:04,943 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-30 23:19:04,947 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-30 23:19:04,947 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-30 23:19:04,947 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-30 23:19:04,947 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-30 23:19:04,947 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-30 23:19:04,948 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-30 23:19:04,948 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-30 23:19:04,948 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-30 23:19:04,949 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-30 23:19:04,949 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-30 23:19:04,949 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-30 23:19:04,949 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-30 23:19:04,949 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-30 23:19:04,949 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-30 23:19:04,950 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-30 23:19:04,950 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-30 23:19:04,950 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-30 23:19:04,950 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-30 23:19:04,950 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-30 23:19:04,950 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-30 23:19:04,954 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-30 23:19:04,954 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 197209881b4fe70c7fe468e7084aa1de2f7c6240 [2018-12-30 23:19:05,007 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-30 23:19:05,026 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-30 23:19:05,031 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-30 23:19:05,033 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-30 23:19:05,033 INFO L276 PluginConnector]: CDTParser initialized [2018-12-30 23:19:05,034 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/eca-rers2012/Problem14_label53_true-unreach-call_false-termination.c [2018-12-30 23:19:05,098 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a39b63c6/88bf0ef6860c4f8ab41fe15807f837e8/FLAGcabdbadab [2018-12-30 23:19:05,702 INFO L307 CDTParser]: Found 1 translation units. [2018-12-30 23:19:05,702 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/eca-rers2012/Problem14_label53_true-unreach-call_false-termination.c [2018-12-30 23:19:05,734 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a39b63c6/88bf0ef6860c4f8ab41fe15807f837e8/FLAGcabdbadab [2018-12-30 23:19:05,898 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a39b63c6/88bf0ef6860c4f8ab41fe15807f837e8 [2018-12-30 23:19:05,904 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-30 23:19:05,906 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-30 23:19:05,907 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-30 23:19:05,907 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-30 23:19:05,914 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-30 23:19:05,915 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.12 11:19:05" (1/1) ... [2018-12-30 23:19:05,919 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54ab2667 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 11:19:05, skipping insertion in model container [2018-12-30 23:19:05,919 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.12 11:19:05" (1/1) ... [2018-12-30 23:19:05,929 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-30 23:19:06,005 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-30 23:19:06,563 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-30 23:19:06,569 INFO L191 MainTranslator]: Completed pre-run [2018-12-30 23:19:06,727 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-30 23:19:06,906 INFO L195 MainTranslator]: Completed translation [2018-12-30 23:19:06,907 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 11:19:06 WrapperNode [2018-12-30 23:19:06,907 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-30 23:19:06,908 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-30 23:19:06,908 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-30 23:19:06,908 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-30 23:19:06,921 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 11:19:06" (1/1) ... [2018-12-30 23:19:06,958 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 11:19:06" (1/1) ... [2018-12-30 23:19:07,061 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-30 23:19:07,062 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-30 23:19:07,062 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-30 23:19:07,062 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-30 23:19:07,075 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 11:19:06" (1/1) ... [2018-12-30 23:19:07,075 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 11:19:06" (1/1) ... [2018-12-30 23:19:07,089 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 11:19:06" (1/1) ... [2018-12-30 23:19:07,090 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 11:19:06" (1/1) ... [2018-12-30 23:19:07,140 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 11:19:06" (1/1) ... [2018-12-30 23:19:07,163 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 11:19:06" (1/1) ... [2018-12-30 23:19:07,185 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 11:19:06" (1/1) ... [2018-12-30 23:19:07,199 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-30 23:19:07,200 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-30 23:19:07,200 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-30 23:19:07,200 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-30 23:19:07,202 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 11:19:06" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-30 23:19:07,286 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-30 23:19:07,286 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-30 23:19:11,177 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-30 23:19:11,177 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2018-12-30 23:19:11,178 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.12 11:19:11 BoogieIcfgContainer [2018-12-30 23:19:11,178 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-30 23:19:11,179 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-30 23:19:11,179 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-30 23:19:11,184 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-30 23:19:11,185 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.12 11:19:05" (1/3) ... [2018-12-30 23:19:11,186 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1508026f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.12 11:19:11, skipping insertion in model container [2018-12-30 23:19:11,187 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 11:19:06" (2/3) ... [2018-12-30 23:19:11,188 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1508026f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.12 11:19:11, skipping insertion in model container [2018-12-30 23:19:11,189 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.12 11:19:11" (3/3) ... [2018-12-30 23:19:11,191 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem14_label53_true-unreach-call_false-termination.c [2018-12-30 23:19:11,204 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-30 23:19:11,217 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-30 23:19:11,240 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-30 23:19:11,285 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-30 23:19:11,286 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-30 23:19:11,286 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-30 23:19:11,286 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-30 23:19:11,288 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-30 23:19:11,288 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-30 23:19:11,288 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-30 23:19:11,288 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-30 23:19:11,288 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-30 23:19:11,317 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states. [2018-12-30 23:19:11,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-30 23:19:11,328 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:19:11,329 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 23:19:11,332 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:19:11,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:19:11,339 INFO L82 PathProgramCache]: Analyzing trace with hash 301649817, now seen corresponding path program 1 times [2018-12-30 23:19:11,342 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:19:11,342 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:19:11,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:19:11,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:19:11,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:19:11,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:19:11,800 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-12-30 23:19:12,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 23:19:12,004 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 23:19:12,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-30 23:19:12,010 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-30 23:19:12,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-30 23:19:12,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-12-30 23:19:12,029 INFO L87 Difference]: Start difference. First operand 245 states. Second operand 6 states. [2018-12-30 23:19:15,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:19:15,463 INFO L93 Difference]: Finished difference Result 852 states and 1560 transitions. [2018-12-30 23:19:15,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-30 23:19:15,466 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 49 [2018-12-30 23:19:15,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:19:15,487 INFO L225 Difference]: With dead ends: 852 [2018-12-30 23:19:15,487 INFO L226 Difference]: Without dead ends: 538 [2018-12-30 23:19:15,494 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-30 23:19:15,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2018-12-30 23:19:15,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 538. [2018-12-30 23:19:15,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 538 states. [2018-12-30 23:19:15,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 778 transitions. [2018-12-30 23:19:15,597 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 778 transitions. Word has length 49 [2018-12-30 23:19:15,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:19:15,598 INFO L480 AbstractCegarLoop]: Abstraction has 538 states and 778 transitions. [2018-12-30 23:19:15,598 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-30 23:19:15,598 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 778 transitions. [2018-12-30 23:19:15,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-12-30 23:19:15,608 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:19:15,608 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 23:19:15,608 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:19:15,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:19:15,609 INFO L82 PathProgramCache]: Analyzing trace with hash -265131167, now seen corresponding path program 1 times [2018-12-30 23:19:15,609 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:19:15,609 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:19:15,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:19:15,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:19:15,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:19:15,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:19:15,844 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-12-30 23:19:15,844 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 23:19:15,845 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 23:19:15,847 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-30 23:19:15,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-30 23:19:15,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 23:19:15,848 INFO L87 Difference]: Start difference. First operand 538 states and 778 transitions. Second operand 4 states. [2018-12-30 23:19:18,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:19:18,288 INFO L93 Difference]: Finished difference Result 1252 states and 1948 transitions. [2018-12-30 23:19:18,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-30 23:19:18,289 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 197 [2018-12-30 23:19:18,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:19:18,299 INFO L225 Difference]: With dead ends: 1252 [2018-12-30 23:19:18,299 INFO L226 Difference]: Without dead ends: 894 [2018-12-30 23:19:18,302 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 23:19:18,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 894 states. [2018-12-30 23:19:18,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 894 to 894. [2018-12-30 23:19:18,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 894 states. [2018-12-30 23:19:18,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 894 states to 894 states and 1206 transitions. [2018-12-30 23:19:18,336 INFO L78 Accepts]: Start accepts. Automaton has 894 states and 1206 transitions. Word has length 197 [2018-12-30 23:19:18,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:19:18,336 INFO L480 AbstractCegarLoop]: Abstraction has 894 states and 1206 transitions. [2018-12-30 23:19:18,336 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-30 23:19:18,336 INFO L276 IsEmpty]: Start isEmpty. Operand 894 states and 1206 transitions. [2018-12-30 23:19:18,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-12-30 23:19:18,341 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:19:18,341 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 23:19:18,341 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:19:18,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:19:18,342 INFO L82 PathProgramCache]: Analyzing trace with hash -1568066862, now seen corresponding path program 1 times [2018-12-30 23:19:18,342 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:19:18,342 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:19:18,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:19:18,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:19:18,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:19:18,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:19:18,755 WARN L181 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 9 [2018-12-30 23:19:18,971 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 150 proven. 4 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-30 23:19:18,972 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 23:19:18,972 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-30 23:19:18,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:19:19,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:19:19,067 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 23:19:19,247 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-30 23:19:19,273 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-30 23:19:19,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2018-12-30 23:19:19,274 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-30 23:19:19,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-30 23:19:19,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-12-30 23:19:19,275 INFO L87 Difference]: Start difference. First operand 894 states and 1206 transitions. Second operand 6 states. [2018-12-30 23:19:23,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:19:23,322 INFO L93 Difference]: Finished difference Result 2912 states and 4029 transitions. [2018-12-30 23:19:23,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-30 23:19:23,325 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 220 [2018-12-30 23:19:23,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:19:23,343 INFO L225 Difference]: With dead ends: 2912 [2018-12-30 23:19:23,371 INFO L226 Difference]: Without dead ends: 2140 [2018-12-30 23:19:23,372 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 219 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-30 23:19:23,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2140 states. [2018-12-30 23:19:23,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2140 to 1250. [2018-12-30 23:19:23,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1250 states. [2018-12-30 23:19:23,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1250 states to 1250 states and 1382 transitions. [2018-12-30 23:19:23,415 INFO L78 Accepts]: Start accepts. Automaton has 1250 states and 1382 transitions. Word has length 220 [2018-12-30 23:19:23,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:19:23,416 INFO L480 AbstractCegarLoop]: Abstraction has 1250 states and 1382 transitions. [2018-12-30 23:19:23,416 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-30 23:19:23,416 INFO L276 IsEmpty]: Start isEmpty. Operand 1250 states and 1382 transitions. [2018-12-30 23:19:23,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 421 [2018-12-30 23:19:23,425 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:19:23,426 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 23:19:23,426 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:19:23,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:19:23,426 INFO L82 PathProgramCache]: Analyzing trace with hash 1781618027, now seen corresponding path program 1 times [2018-12-30 23:19:23,426 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:19:23,427 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:19:23,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:19:23,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:19:23,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:19:23,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:19:24,110 INFO L134 CoverageAnalysis]: Checked inductivity of 678 backedges. 187 proven. 0 refuted. 0 times theorem prover too weak. 491 trivial. 0 not checked. [2018-12-30 23:19:24,111 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 23:19:24,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-30 23:19:24,112 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-30 23:19:24,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-30 23:19:24,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 23:19:24,112 INFO L87 Difference]: Start difference. First operand 1250 states and 1382 transitions. Second operand 4 states. [2018-12-30 23:19:27,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:19:27,076 INFO L93 Difference]: Finished difference Result 4100 states and 4617 transitions. [2018-12-30 23:19:27,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-30 23:19:27,077 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 420 [2018-12-30 23:19:27,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:19:27,092 INFO L225 Difference]: With dead ends: 4100 [2018-12-30 23:19:27,092 INFO L226 Difference]: Without dead ends: 3030 [2018-12-30 23:19:27,095 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 23:19:27,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3030 states. [2018-12-30 23:19:27,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3030 to 1962. [2018-12-30 23:19:27,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1962 states. [2018-12-30 23:19:27,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1962 states to 1962 states and 2141 transitions. [2018-12-30 23:19:27,145 INFO L78 Accepts]: Start accepts. Automaton has 1962 states and 2141 transitions. Word has length 420 [2018-12-30 23:19:27,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:19:27,146 INFO L480 AbstractCegarLoop]: Abstraction has 1962 states and 2141 transitions. [2018-12-30 23:19:27,146 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-30 23:19:27,147 INFO L276 IsEmpty]: Start isEmpty. Operand 1962 states and 2141 transitions. [2018-12-30 23:19:27,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 518 [2018-12-30 23:19:27,159 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:19:27,159 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 23:19:27,160 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:19:27,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:19:27,160 INFO L82 PathProgramCache]: Analyzing trace with hash 2096484788, now seen corresponding path program 1 times [2018-12-30 23:19:27,160 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:19:27,160 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:19:27,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:19:27,162 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:19:27,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:19:27,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:19:28,293 INFO L134 CoverageAnalysis]: Checked inductivity of 746 backedges. 595 proven. 0 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2018-12-30 23:19:28,294 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 23:19:28,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-30 23:19:28,295 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-30 23:19:28,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-30 23:19:28,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-12-30 23:19:28,296 INFO L87 Difference]: Start difference. First operand 1962 states and 2141 transitions. Second operand 8 states. [2018-12-30 23:19:31,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:19:31,671 INFO L93 Difference]: Finished difference Result 4112 states and 4490 transitions. [2018-12-30 23:19:31,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-30 23:19:31,673 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 517 [2018-12-30 23:19:31,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:19:31,684 INFO L225 Difference]: With dead ends: 4112 [2018-12-30 23:19:31,684 INFO L226 Difference]: Without dead ends: 2330 [2018-12-30 23:19:31,687 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=32, Invalid=40, Unknown=0, NotChecked=0, Total=72 [2018-12-30 23:19:31,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2330 states. [2018-12-30 23:19:31,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2330 to 2140. [2018-12-30 23:19:31,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2140 states. [2018-12-30 23:19:31,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2140 states to 2140 states and 2323 transitions. [2018-12-30 23:19:31,735 INFO L78 Accepts]: Start accepts. Automaton has 2140 states and 2323 transitions. Word has length 517 [2018-12-30 23:19:31,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:19:31,736 INFO L480 AbstractCegarLoop]: Abstraction has 2140 states and 2323 transitions. [2018-12-30 23:19:31,736 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-30 23:19:31,736 INFO L276 IsEmpty]: Start isEmpty. Operand 2140 states and 2323 transitions. [2018-12-30 23:19:31,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 542 [2018-12-30 23:19:31,742 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:19:31,743 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 23:19:31,743 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:19:31,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:19:31,743 INFO L82 PathProgramCache]: Analyzing trace with hash -111934088, now seen corresponding path program 1 times [2018-12-30 23:19:31,744 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:19:31,744 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:19:31,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:19:31,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:19:31,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:19:31,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:19:32,390 WARN L181 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 12 [2018-12-30 23:19:32,605 WARN L181 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 15 [2018-12-30 23:19:33,082 INFO L134 CoverageAnalysis]: Checked inductivity of 771 backedges. 591 proven. 4 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2018-12-30 23:19:33,082 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 23:19:33,082 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-30 23:19:33,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:19:33,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:19:33,211 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 23:19:33,792 INFO L134 CoverageAnalysis]: Checked inductivity of 771 backedges. 572 proven. 23 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2018-12-30 23:19:33,811 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-30 23:19:33,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 7 [2018-12-30 23:19:33,813 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-30 23:19:33,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-30 23:19:33,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-12-30 23:19:33,813 INFO L87 Difference]: Start difference. First operand 2140 states and 2323 transitions. Second operand 8 states. [2018-12-30 23:19:34,316 WARN L181 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 15 [2018-12-30 23:19:36,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:19:36,019 INFO L93 Difference]: Finished difference Result 4492 states and 4863 transitions. [2018-12-30 23:19:36,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-30 23:19:36,020 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 541 [2018-12-30 23:19:36,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:19:36,030 INFO L225 Difference]: With dead ends: 4492 [2018-12-30 23:19:36,030 INFO L226 Difference]: Without dead ends: 2532 [2018-12-30 23:19:36,034 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 549 GetRequests, 539 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2018-12-30 23:19:36,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2532 states. [2018-12-30 23:19:36,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2532 to 2318. [2018-12-30 23:19:36,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2318 states. [2018-12-30 23:19:36,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2318 states to 2318 states and 2502 transitions. [2018-12-30 23:19:36,084 INFO L78 Accepts]: Start accepts. Automaton has 2318 states and 2502 transitions. Word has length 541 [2018-12-30 23:19:36,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:19:36,084 INFO L480 AbstractCegarLoop]: Abstraction has 2318 states and 2502 transitions. [2018-12-30 23:19:36,085 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-30 23:19:36,085 INFO L276 IsEmpty]: Start isEmpty. Operand 2318 states and 2502 transitions. [2018-12-30 23:19:36,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 631 [2018-12-30 23:19:36,093 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:19:36,094 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 23:19:36,094 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:19:36,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:19:36,096 INFO L82 PathProgramCache]: Analyzing trace with hash 186723207, now seen corresponding path program 1 times [2018-12-30 23:19:36,096 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:19:36,096 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:19:36,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:19:36,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:19:36,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:19:36,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:19:36,775 INFO L134 CoverageAnalysis]: Checked inductivity of 1198 backedges. 837 proven. 0 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2018-12-30 23:19:36,775 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 23:19:36,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 23:19:36,776 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 23:19:36,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 23:19:36,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 23:19:36,777 INFO L87 Difference]: Start difference. First operand 2318 states and 2502 transitions. Second operand 3 states. [2018-12-30 23:19:37,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:19:37,452 INFO L93 Difference]: Finished difference Result 5168 states and 5647 transitions. [2018-12-30 23:19:37,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 23:19:37,453 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 630 [2018-12-30 23:19:37,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:19:37,467 INFO L225 Difference]: With dead ends: 5168 [2018-12-30 23:19:37,467 INFO L226 Difference]: Without dead ends: 3030 [2018-12-30 23:19:37,471 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 23:19:37,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3030 states. [2018-12-30 23:19:37,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3030 to 2852. [2018-12-30 23:19:37,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2852 states. [2018-12-30 23:19:37,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2852 states to 2852 states and 3108 transitions. [2018-12-30 23:19:37,524 INFO L78 Accepts]: Start accepts. Automaton has 2852 states and 3108 transitions. Word has length 630 [2018-12-30 23:19:37,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:19:37,525 INFO L480 AbstractCegarLoop]: Abstraction has 2852 states and 3108 transitions. [2018-12-30 23:19:37,525 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 23:19:37,525 INFO L276 IsEmpty]: Start isEmpty. Operand 2852 states and 3108 transitions. [2018-12-30 23:19:37,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 633 [2018-12-30 23:19:37,532 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:19:37,533 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 23:19:37,533 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:19:37,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:19:37,534 INFO L82 PathProgramCache]: Analyzing trace with hash -915113961, now seen corresponding path program 1 times [2018-12-30 23:19:37,535 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:19:37,535 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:19:37,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:19:37,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:19:37,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:19:37,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:19:38,016 INFO L134 CoverageAnalysis]: Checked inductivity of 1584 backedges. 1094 proven. 0 refuted. 0 times theorem prover too weak. 490 trivial. 0 not checked. [2018-12-30 23:19:38,016 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 23:19:38,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 23:19:38,017 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 23:19:38,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 23:19:38,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 23:19:38,017 INFO L87 Difference]: Start difference. First operand 2852 states and 3108 transitions. Second operand 3 states. [2018-12-30 23:19:38,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:19:38,697 INFO L93 Difference]: Finished difference Result 5880 states and 6423 transitions. [2018-12-30 23:19:38,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 23:19:38,698 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 632 [2018-12-30 23:19:38,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:19:38,709 INFO L225 Difference]: With dead ends: 5880 [2018-12-30 23:19:38,710 INFO L226 Difference]: Without dead ends: 3208 [2018-12-30 23:19:38,714 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 23:19:38,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3208 states. [2018-12-30 23:19:38,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3208 to 3030. [2018-12-30 23:19:38,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3030 states. [2018-12-30 23:19:38,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3030 states to 3030 states and 3269 transitions. [2018-12-30 23:19:38,764 INFO L78 Accepts]: Start accepts. Automaton has 3030 states and 3269 transitions. Word has length 632 [2018-12-30 23:19:38,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:19:38,764 INFO L480 AbstractCegarLoop]: Abstraction has 3030 states and 3269 transitions. [2018-12-30 23:19:38,765 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 23:19:38,765 INFO L276 IsEmpty]: Start isEmpty. Operand 3030 states and 3269 transitions. [2018-12-30 23:19:38,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 676 [2018-12-30 23:19:38,773 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:19:38,773 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 23:19:38,774 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:19:38,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:19:38,774 INFO L82 PathProgramCache]: Analyzing trace with hash 740978942, now seen corresponding path program 1 times [2018-12-30 23:19:38,774 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:19:38,774 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:19:38,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:19:38,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:19:38,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:19:38,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:19:39,904 INFO L134 CoverageAnalysis]: Checked inductivity of 1243 backedges. 708 proven. 174 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2018-12-30 23:19:39,904 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 23:19:39,904 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-30 23:19:39,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:19:40,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:19:40,058 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 23:19:40,941 INFO L134 CoverageAnalysis]: Checked inductivity of 1243 backedges. 853 proven. 29 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2018-12-30 23:19:40,959 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-30 23:19:40,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 7 [2018-12-30 23:19:40,960 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-30 23:19:40,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-30 23:19:40,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-30 23:19:40,961 INFO L87 Difference]: Start difference. First operand 3030 states and 3269 transitions. Second operand 8 states. [2018-12-30 23:19:43,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:19:43,094 INFO L93 Difference]: Finished difference Result 6476 states and 6985 transitions. [2018-12-30 23:19:43,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-30 23:19:43,097 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 675 [2018-12-30 23:19:43,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:19:43,112 INFO L225 Difference]: With dead ends: 6476 [2018-12-30 23:19:43,112 INFO L226 Difference]: Without dead ends: 3626 [2018-12-30 23:19:43,116 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 683 GetRequests, 674 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2018-12-30 23:19:43,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3626 states. [2018-12-30 23:19:43,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3626 to 3386. [2018-12-30 23:19:43,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3386 states. [2018-12-30 23:19:43,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3386 states to 3386 states and 3634 transitions. [2018-12-30 23:19:43,180 INFO L78 Accepts]: Start accepts. Automaton has 3386 states and 3634 transitions. Word has length 675 [2018-12-30 23:19:43,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:19:43,181 INFO L480 AbstractCegarLoop]: Abstraction has 3386 states and 3634 transitions. [2018-12-30 23:19:43,181 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-30 23:19:43,181 INFO L276 IsEmpty]: Start isEmpty. Operand 3386 states and 3634 transitions. [2018-12-30 23:19:43,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 678 [2018-12-30 23:19:43,191 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:19:43,192 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 23:19:43,193 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:19:43,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:19:43,193 INFO L82 PathProgramCache]: Analyzing trace with hash -851297330, now seen corresponding path program 1 times [2018-12-30 23:19:43,193 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:19:43,193 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:19:43,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:19:43,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:19:43,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:19:43,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:19:43,959 WARN L181 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 13 [2018-12-30 23:19:44,424 WARN L181 SmtUtils]: Spent 360.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 17 [2018-12-30 23:19:44,658 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-12-30 23:19:44,996 INFO L134 CoverageAnalysis]: Checked inductivity of 1584 backedges. 985 proven. 0 refuted. 0 times theorem prover too weak. 599 trivial. 0 not checked. [2018-12-30 23:19:44,996 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 23:19:44,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-30 23:19:44,997 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-30 23:19:44,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-30 23:19:44,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-12-30 23:19:44,998 INFO L87 Difference]: Start difference. First operand 3386 states and 3634 transitions. Second operand 7 states. [2018-12-30 23:19:46,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:19:46,133 INFO L93 Difference]: Finished difference Result 6820 states and 7328 transitions. [2018-12-30 23:19:46,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-30 23:19:46,135 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 677 [2018-12-30 23:19:46,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:19:46,151 INFO L225 Difference]: With dead ends: 6820 [2018-12-30 23:19:46,151 INFO L226 Difference]: Without dead ends: 3564 [2018-12-30 23:19:46,156 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-12-30 23:19:46,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3564 states. [2018-12-30 23:19:46,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3564 to 3386. [2018-12-30 23:19:46,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3386 states. [2018-12-30 23:19:46,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3386 states to 3386 states and 3589 transitions. [2018-12-30 23:19:46,217 INFO L78 Accepts]: Start accepts. Automaton has 3386 states and 3589 transitions. Word has length 677 [2018-12-30 23:19:46,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:19:46,218 INFO L480 AbstractCegarLoop]: Abstraction has 3386 states and 3589 transitions. [2018-12-30 23:19:46,218 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-30 23:19:46,218 INFO L276 IsEmpty]: Start isEmpty. Operand 3386 states and 3589 transitions. [2018-12-30 23:19:46,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 703 [2018-12-30 23:19:46,228 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:19:46,228 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 23:19:46,228 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:19:46,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:19:46,229 INFO L82 PathProgramCache]: Analyzing trace with hash 286131592, now seen corresponding path program 1 times [2018-12-30 23:19:46,229 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:19:46,229 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:19:46,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:19:46,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:19:46,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:19:46,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:19:46,820 INFO L134 CoverageAnalysis]: Checked inductivity of 1604 backedges. 1114 proven. 0 refuted. 0 times theorem prover too weak. 490 trivial. 0 not checked. [2018-12-30 23:19:46,820 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 23:19:46,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 23:19:46,821 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 23:19:46,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 23:19:46,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 23:19:46,821 INFO L87 Difference]: Start difference. First operand 3386 states and 3589 transitions. Second operand 3 states. [2018-12-30 23:19:47,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:19:47,760 INFO L93 Difference]: Finished difference Result 7304 states and 7755 transitions. [2018-12-30 23:19:47,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 23:19:47,761 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 702 [2018-12-30 23:19:47,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:19:47,775 INFO L225 Difference]: With dead ends: 7304 [2018-12-30 23:19:47,776 INFO L226 Difference]: Without dead ends: 4098 [2018-12-30 23:19:47,780 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 23:19:47,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4098 states. [2018-12-30 23:19:47,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4098 to 4098. [2018-12-30 23:19:47,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4098 states. [2018-12-30 23:19:47,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4098 states to 4098 states and 4324 transitions. [2018-12-30 23:19:47,844 INFO L78 Accepts]: Start accepts. Automaton has 4098 states and 4324 transitions. Word has length 702 [2018-12-30 23:19:47,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:19:47,844 INFO L480 AbstractCegarLoop]: Abstraction has 4098 states and 4324 transitions. [2018-12-30 23:19:47,844 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 23:19:47,844 INFO L276 IsEmpty]: Start isEmpty. Operand 4098 states and 4324 transitions. [2018-12-30 23:19:47,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 858 [2018-12-30 23:19:47,855 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:19:47,856 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 23:19:47,856 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:19:47,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:19:47,856 INFO L82 PathProgramCache]: Analyzing trace with hash -570726484, now seen corresponding path program 1 times [2018-12-30 23:19:47,857 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:19:47,857 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:19:47,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:19:47,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:19:47,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:19:47,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:19:48,473 INFO L134 CoverageAnalysis]: Checked inductivity of 2283 backedges. 1470 proven. 0 refuted. 0 times theorem prover too weak. 813 trivial. 0 not checked. [2018-12-30 23:19:48,473 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 23:19:48,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-30 23:19:48,474 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-30 23:19:48,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-30 23:19:48,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 23:19:48,475 INFO L87 Difference]: Start difference. First operand 4098 states and 4324 transitions. Second operand 4 states. [2018-12-30 23:19:49,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:19:49,526 INFO L93 Difference]: Finished difference Result 9262 states and 9858 transitions. [2018-12-30 23:19:49,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-30 23:19:49,527 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 857 [2018-12-30 23:19:49,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:19:49,542 INFO L225 Difference]: With dead ends: 9262 [2018-12-30 23:19:49,543 INFO L226 Difference]: Without dead ends: 5344 [2018-12-30 23:19:49,548 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 23:19:49,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5344 states. [2018-12-30 23:19:49,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5344 to 4988. [2018-12-30 23:19:49,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4988 states. [2018-12-30 23:19:49,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4988 states to 4988 states and 5249 transitions. [2018-12-30 23:19:49,624 INFO L78 Accepts]: Start accepts. Automaton has 4988 states and 5249 transitions. Word has length 857 [2018-12-30 23:19:49,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:19:49,625 INFO L480 AbstractCegarLoop]: Abstraction has 4988 states and 5249 transitions. [2018-12-30 23:19:49,625 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-30 23:19:49,625 INFO L276 IsEmpty]: Start isEmpty. Operand 4988 states and 5249 transitions. [2018-12-30 23:19:49,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 876 [2018-12-30 23:19:49,635 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:19:49,636 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 23:19:49,637 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:19:49,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:19:49,637 INFO L82 PathProgramCache]: Analyzing trace with hash -948706177, now seen corresponding path program 1 times [2018-12-30 23:19:49,637 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:19:49,637 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:19:49,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:19:49,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:19:49,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:19:49,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:19:51,259 INFO L134 CoverageAnalysis]: Checked inductivity of 2301 backedges. 1620 proven. 199 refuted. 0 times theorem prover too weak. 482 trivial. 0 not checked. [2018-12-30 23:19:51,259 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 23:19:51,259 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-30 23:19:51,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:19:51,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:19:51,458 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 23:19:53,031 INFO L134 CoverageAnalysis]: Checked inductivity of 2301 backedges. 1527 proven. 93 refuted. 0 times theorem prover too weak. 681 trivial. 0 not checked. [2018-12-30 23:19:53,051 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-30 23:19:53,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 7 [2018-12-30 23:19:53,054 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-30 23:19:53,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-30 23:19:53,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-12-30 23:19:53,054 INFO L87 Difference]: Start difference. First operand 4988 states and 5249 transitions. Second operand 8 states. [2018-12-30 23:19:55,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:19:55,147 INFO L93 Difference]: Finished difference Result 11301 states and 11890 transitions. [2018-12-30 23:19:55,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-30 23:19:55,148 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 875 [2018-12-30 23:19:55,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:19:55,159 INFO L225 Difference]: With dead ends: 11301 [2018-12-30 23:19:55,159 INFO L226 Difference]: Without dead ends: 6493 [2018-12-30 23:19:55,164 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 882 GetRequests, 874 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2018-12-30 23:19:55,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6493 states. [2018-12-30 23:19:55,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6493 to 5344. [2018-12-30 23:19:55,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5344 states. [2018-12-30 23:19:55,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5344 states to 5344 states and 5605 transitions. [2018-12-30 23:19:55,255 INFO L78 Accepts]: Start accepts. Automaton has 5344 states and 5605 transitions. Word has length 875 [2018-12-30 23:19:55,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:19:55,255 INFO L480 AbstractCegarLoop]: Abstraction has 5344 states and 5605 transitions. [2018-12-30 23:19:55,256 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-30 23:19:55,256 INFO L276 IsEmpty]: Start isEmpty. Operand 5344 states and 5605 transitions. [2018-12-30 23:19:55,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 953 [2018-12-30 23:19:55,269 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:19:55,270 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 23:19:55,270 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:19:55,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:19:55,272 INFO L82 PathProgramCache]: Analyzing trace with hash 1227190264, now seen corresponding path program 1 times [2018-12-30 23:19:55,272 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:19:55,273 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:19:55,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:19:55,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:19:55,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:19:55,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:19:56,152 INFO L134 CoverageAnalysis]: Checked inductivity of 2881 backedges. 1578 proven. 0 refuted. 0 times theorem prover too weak. 1303 trivial. 0 not checked. [2018-12-30 23:19:56,152 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 23:19:56,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-30 23:19:56,153 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-30 23:19:56,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-30 23:19:56,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-30 23:19:56,154 INFO L87 Difference]: Start difference. First operand 5344 states and 5605 transitions. Second operand 5 states. [2018-12-30 23:19:57,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:19:57,438 INFO L93 Difference]: Finished difference Result 11576 states and 12149 transitions. [2018-12-30 23:19:57,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-30 23:19:57,440 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 952 [2018-12-30 23:19:57,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:19:57,453 INFO L225 Difference]: With dead ends: 11576 [2018-12-30 23:19:57,453 INFO L226 Difference]: Without dead ends: 6412 [2018-12-30 23:19:57,459 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-30 23:19:57,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6412 states. [2018-12-30 23:19:57,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6412 to 5878. [2018-12-30 23:19:57,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5878 states. [2018-12-30 23:19:57,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5878 states to 5878 states and 6159 transitions. [2018-12-30 23:19:57,564 INFO L78 Accepts]: Start accepts. Automaton has 5878 states and 6159 transitions. Word has length 952 [2018-12-30 23:19:57,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:19:57,566 INFO L480 AbstractCegarLoop]: Abstraction has 5878 states and 6159 transitions. [2018-12-30 23:19:57,566 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-30 23:19:57,566 INFO L276 IsEmpty]: Start isEmpty. Operand 5878 states and 6159 transitions. [2018-12-30 23:19:57,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1596 [2018-12-30 23:19:57,594 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:19:57,596 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 8, 7, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 23:19:57,597 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:19:57,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:19:57,598 INFO L82 PathProgramCache]: Analyzing trace with hash -890235928, now seen corresponding path program 1 times [2018-12-30 23:19:57,598 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:19:57,598 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:19:57,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:19:57,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:19:57,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:19:57,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:19:59,098 INFO L134 CoverageAnalysis]: Checked inductivity of 8269 backedges. 1578 proven. 0 refuted. 0 times theorem prover too weak. 6691 trivial. 0 not checked. [2018-12-30 23:19:59,098 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 23:19:59,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-30 23:19:59,100 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-30 23:19:59,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-30 23:19:59,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 23:19:59,100 INFO L87 Difference]: Start difference. First operand 5878 states and 6159 transitions. Second operand 4 states. [2018-12-30 23:20:00,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:20:00,209 INFO L93 Difference]: Finished difference Result 11932 states and 12529 transitions. [2018-12-30 23:20:00,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-30 23:20:00,210 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1595 [2018-12-30 23:20:00,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:20:00,223 INFO L225 Difference]: With dead ends: 11932 [2018-12-30 23:20:00,224 INFO L226 Difference]: Without dead ends: 6234 [2018-12-30 23:20:00,230 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 23:20:00,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6234 states. [2018-12-30 23:20:00,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6234 to 5700. [2018-12-30 23:20:00,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5700 states. [2018-12-30 23:20:00,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5700 states to 5700 states and 5952 transitions. [2018-12-30 23:20:00,300 INFO L78 Accepts]: Start accepts. Automaton has 5700 states and 5952 transitions. Word has length 1595 [2018-12-30 23:20:00,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:20:00,301 INFO L480 AbstractCegarLoop]: Abstraction has 5700 states and 5952 transitions. [2018-12-30 23:20:00,301 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-30 23:20:00,301 INFO L276 IsEmpty]: Start isEmpty. Operand 5700 states and 5952 transitions. [2018-12-30 23:20:00,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1663 [2018-12-30 23:20:00,326 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:20:00,327 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 8, 7, 7, 7, 7, 7, 7, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 23:20:00,327 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:20:00,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:20:00,327 INFO L82 PathProgramCache]: Analyzing trace with hash 698233105, now seen corresponding path program 1 times [2018-12-30 23:20:00,328 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:20:00,328 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:20:00,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:20:00,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:20:00,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:20:00,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:20:01,965 INFO L134 CoverageAnalysis]: Checked inductivity of 8507 backedges. 2883 proven. 0 refuted. 0 times theorem prover too weak. 5624 trivial. 0 not checked. [2018-12-30 23:20:01,966 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 23:20:01,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-30 23:20:01,967 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-30 23:20:01,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-30 23:20:01,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 23:20:01,968 INFO L87 Difference]: Start difference. First operand 5700 states and 5952 transitions. Second operand 4 states. [2018-12-30 23:20:03,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:20:03,131 INFO L93 Difference]: Finished difference Result 12466 states and 12979 transitions. [2018-12-30 23:20:03,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-30 23:20:03,132 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1662 [2018-12-30 23:20:03,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:20:03,139 INFO L225 Difference]: With dead ends: 12466 [2018-12-30 23:20:03,139 INFO L226 Difference]: Without dead ends: 4276 [2018-12-30 23:20:03,147 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 23:20:03,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4276 states. [2018-12-30 23:20:03,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4276 to 3742. [2018-12-30 23:20:03,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3742 states. [2018-12-30 23:20:03,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3742 states to 3742 states and 3806 transitions. [2018-12-30 23:20:03,206 INFO L78 Accepts]: Start accepts. Automaton has 3742 states and 3806 transitions. Word has length 1662 [2018-12-30 23:20:03,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:20:03,208 INFO L480 AbstractCegarLoop]: Abstraction has 3742 states and 3806 transitions. [2018-12-30 23:20:03,208 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-30 23:20:03,208 INFO L276 IsEmpty]: Start isEmpty. Operand 3742 states and 3806 transitions. [2018-12-30 23:20:03,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1681 [2018-12-30 23:20:03,236 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:20:03,237 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 8, 8, 8, 8, 8, 8, 8, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 23:20:03,238 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:20:03,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:20:03,238 INFO L82 PathProgramCache]: Analyzing trace with hash -1087144341, now seen corresponding path program 1 times [2018-12-30 23:20:03,238 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:20:03,240 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:20:03,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:20:03,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:20:03,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:20:03,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:20:04,326 WARN L181 SmtUtils]: Spent 323.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 15 [2018-12-30 23:20:06,171 INFO L134 CoverageAnalysis]: Checked inductivity of 8613 backedges. 2725 proven. 0 refuted. 0 times theorem prover too weak. 5888 trivial. 0 not checked. [2018-12-30 23:20:06,171 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 23:20:06,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-30 23:20:06,173 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-30 23:20:06,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-30 23:20:06,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-12-30 23:20:06,174 INFO L87 Difference]: Start difference. First operand 3742 states and 3806 transitions. Second operand 7 states. [2018-12-30 23:20:07,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:20:07,236 INFO L93 Difference]: Finished difference Result 7364 states and 7494 transitions. [2018-12-30 23:20:07,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-30 23:20:07,237 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 1680 [2018-12-30 23:20:07,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:20:07,240 INFO L225 Difference]: With dead ends: 7364 [2018-12-30 23:20:07,240 INFO L226 Difference]: Without dead ends: 3920 [2018-12-30 23:20:07,243 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-12-30 23:20:07,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3920 states. [2018-12-30 23:20:07,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3920 to 3742. [2018-12-30 23:20:07,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3742 states. [2018-12-30 23:20:07,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3742 states to 3742 states and 3805 transitions. [2018-12-30 23:20:07,287 INFO L78 Accepts]: Start accepts. Automaton has 3742 states and 3805 transitions. Word has length 1680 [2018-12-30 23:20:07,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:20:07,288 INFO L480 AbstractCegarLoop]: Abstraction has 3742 states and 3805 transitions. [2018-12-30 23:20:07,288 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-30 23:20:07,288 INFO L276 IsEmpty]: Start isEmpty. Operand 3742 states and 3805 transitions. [2018-12-30 23:20:07,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1734 [2018-12-30 23:20:07,309 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:20:07,310 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 9, 9, 9, 8, 8, 8, 8, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 23:20:07,310 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:20:07,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:20:07,311 INFO L82 PathProgramCache]: Analyzing trace with hash -2019243921, now seen corresponding path program 1 times [2018-12-30 23:20:07,311 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:20:07,311 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:20:07,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:20:07,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:20:07,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:20:07,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:20:09,654 INFO L134 CoverageAnalysis]: Checked inductivity of 9783 backedges. 4820 proven. 387 refuted. 0 times theorem prover too weak. 4576 trivial. 0 not checked. [2018-12-30 23:20:09,655 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 23:20:09,655 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-30 23:20:09,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:20:10,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:20:10,054 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 23:20:12,245 INFO L134 CoverageAnalysis]: Checked inductivity of 9783 backedges. 2831 proven. 176 refuted. 0 times theorem prover too weak. 6776 trivial. 0 not checked. [2018-12-30 23:20:12,264 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-30 23:20:12,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 10 [2018-12-30 23:20:12,266 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-30 23:20:12,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-30 23:20:12,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-12-30 23:20:12,267 INFO L87 Difference]: Start difference. First operand 3742 states and 3805 transitions. Second operand 10 states. [2018-12-30 23:20:18,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:20:18,119 INFO L93 Difference]: Finished difference Result 10688 states and 10908 transitions. [2018-12-30 23:20:18,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-30 23:20:18,122 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 1733 [2018-12-30 23:20:18,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:20:18,132 INFO L225 Difference]: With dead ends: 10688 [2018-12-30 23:20:18,132 INFO L226 Difference]: Without dead ends: 5880 [2018-12-30 23:20:18,138 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1755 GetRequests, 1737 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2018-12-30 23:20:18,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5880 states. [2018-12-30 23:20:18,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5880 to 4810. [2018-12-30 23:20:18,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4810 states. [2018-12-30 23:20:18,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4810 states to 4810 states and 4893 transitions. [2018-12-30 23:20:18,223 INFO L78 Accepts]: Start accepts. Automaton has 4810 states and 4893 transitions. Word has length 1733 [2018-12-30 23:20:18,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:20:18,226 INFO L480 AbstractCegarLoop]: Abstraction has 4810 states and 4893 transitions. [2018-12-30 23:20:18,226 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-30 23:20:18,226 INFO L276 IsEmpty]: Start isEmpty. Operand 4810 states and 4893 transitions. [2018-12-30 23:20:18,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1860 [2018-12-30 23:20:18,255 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:20:18,257 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 10, 10, 10, 9, 9, 9, 9, 8, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 23:20:18,257 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:20:18,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:20:18,259 INFO L82 PathProgramCache]: Analyzing trace with hash -99452203, now seen corresponding path program 1 times [2018-12-30 23:20:18,259 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:20:18,260 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:20:18,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:20:18,262 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:20:18,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:20:18,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:20:19,102 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 4 [2018-12-30 23:20:21,308 INFO L134 CoverageAnalysis]: Checked inductivity of 11355 backedges. 7573 proven. 76 refuted. 0 times theorem prover too weak. 3706 trivial. 0 not checked. [2018-12-30 23:20:21,308 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 23:20:21,308 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-30 23:20:21,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:20:21,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:20:21,746 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 23:20:25,637 INFO L134 CoverageAnalysis]: Checked inductivity of 11355 backedges. 7614 proven. 0 refuted. 0 times theorem prover too weak. 3741 trivial. 0 not checked. [2018-12-30 23:20:25,669 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-30 23:20:25,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 11 [2018-12-30 23:20:25,673 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-30 23:20:25,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-30 23:20:25,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2018-12-30 23:20:25,673 INFO L87 Difference]: Start difference. First operand 4810 states and 4893 transitions. Second operand 11 states. [2018-12-30 23:20:29,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:20:29,125 INFO L93 Difference]: Finished difference Result 9093 states and 9256 transitions. [2018-12-30 23:20:29,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-30 23:20:29,126 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 1859 [2018-12-30 23:20:29,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:20:29,132 INFO L225 Difference]: With dead ends: 9093 [2018-12-30 23:20:29,132 INFO L226 Difference]: Without dead ends: 4819 [2018-12-30 23:20:29,136 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1887 GetRequests, 1864 SyntacticMatches, 7 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=96, Invalid=210, Unknown=0, NotChecked=0, Total=306 [2018-12-30 23:20:29,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4819 states. [2018-12-30 23:20:29,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4819 to 3920. [2018-12-30 23:20:29,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3920 states. [2018-12-30 23:20:29,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3920 states to 3920 states and 3965 transitions. [2018-12-30 23:20:29,183 INFO L78 Accepts]: Start accepts. Automaton has 3920 states and 3965 transitions. Word has length 1859 [2018-12-30 23:20:29,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:20:29,184 INFO L480 AbstractCegarLoop]: Abstraction has 3920 states and 3965 transitions. [2018-12-30 23:20:29,184 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-30 23:20:29,184 INFO L276 IsEmpty]: Start isEmpty. Operand 3920 states and 3965 transitions. [2018-12-30 23:20:29,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1904 [2018-12-30 23:20:29,211 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:20:29,212 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 10, 10, 10, 9, 9, 9, 9, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 23:20:29,212 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:20:29,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:20:29,213 INFO L82 PathProgramCache]: Analyzing trace with hash 1979324035, now seen corresponding path program 1 times [2018-12-30 23:20:29,213 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:20:29,213 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:20:29,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:20:29,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:20:29,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:20:29,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:20:32,084 INFO L134 CoverageAnalysis]: Checked inductivity of 11509 backedges. 3204 proven. 0 refuted. 0 times theorem prover too weak. 8305 trivial. 0 not checked. [2018-12-30 23:20:32,085 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 23:20:32,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-30 23:20:32,086 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-30 23:20:32,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-30 23:20:32,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-12-30 23:20:32,087 INFO L87 Difference]: Start difference. First operand 3920 states and 3965 transitions. Second operand 7 states. [2018-12-30 23:20:32,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:20:32,869 INFO L93 Difference]: Finished difference Result 7175 states and 7261 transitions. [2018-12-30 23:20:32,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-30 23:20:32,870 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 1903 [2018-12-30 23:20:32,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:20:32,873 INFO L225 Difference]: With dead ends: 7175 [2018-12-30 23:20:32,874 INFO L226 Difference]: Without dead ends: 3920 [2018-12-30 23:20:32,876 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-12-30 23:20:32,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3920 states. [2018-12-30 23:20:32,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3920 to 3920. [2018-12-30 23:20:32,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3920 states. [2018-12-30 23:20:32,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3920 states to 3920 states and 3961 transitions. [2018-12-30 23:20:32,913 INFO L78 Accepts]: Start accepts. Automaton has 3920 states and 3961 transitions. Word has length 1903 [2018-12-30 23:20:32,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:20:32,914 INFO L480 AbstractCegarLoop]: Abstraction has 3920 states and 3961 transitions. [2018-12-30 23:20:32,914 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-30 23:20:32,915 INFO L276 IsEmpty]: Start isEmpty. Operand 3920 states and 3961 transitions. [2018-12-30 23:20:32,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2036 [2018-12-30 23:20:32,935 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:20:32,937 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 11, 11, 11, 10, 10, 10, 10, 9, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 23:20:32,937 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:20:32,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:20:32,937 INFO L82 PathProgramCache]: Analyzing trace with hash -1253846088, now seen corresponding path program 1 times [2018-12-30 23:20:32,938 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:20:32,938 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:20:32,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:20:32,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:20:32,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:20:33,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:20:35,461 INFO L134 CoverageAnalysis]: Checked inductivity of 13209 backedges. 3405 proven. 129 refuted. 0 times theorem prover too weak. 9675 trivial. 0 not checked. [2018-12-30 23:20:35,461 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 23:20:35,461 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-30 23:20:35,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:20:35,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:20:35,909 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 23:20:38,199 INFO L134 CoverageAnalysis]: Checked inductivity of 13209 backedges. 3440 proven. 94 refuted. 0 times theorem prover too weak. 9675 trivial. 0 not checked. [2018-12-30 23:20:38,218 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-30 23:20:38,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2018-12-30 23:20:38,220 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-30 23:20:38,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-30 23:20:38,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-12-30 23:20:38,221 INFO L87 Difference]: Start difference. First operand 3920 states and 3961 transitions. Second operand 7 states. [2018-12-30 23:20:40,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:20:40,269 INFO L93 Difference]: Finished difference Result 7480 states and 7563 transitions. [2018-12-30 23:20:40,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-30 23:20:40,270 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 2035 [2018-12-30 23:20:40,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:20:40,272 INFO L225 Difference]: With dead ends: 7480 [2018-12-30 23:20:40,272 INFO L226 Difference]: Without dead ends: 0 [2018-12-30 23:20:40,275 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2043 GetRequests, 2035 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-12-30 23:20:40,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-30 23:20:40,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-30 23:20:40,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-30 23:20:40,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-30 23:20:40,276 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 2035 [2018-12-30 23:20:40,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:20:40,277 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-30 23:20:40,277 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-30 23:20:40,277 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-30 23:20:40,277 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-30 23:20:40,285 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-30 23:20:40,389 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:20:40,395 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:20:40,507 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:20:40,572 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:20:40,738 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:20:40,739 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:20:40,839 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:20:40,854 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:20:40,878 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:20:40,925 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:20:40,976 WARN L181 SmtUtils]: Spent 687.00 ms on a formula simplification. DAG size of input: 414 DAG size of output: 321 [2018-12-30 23:20:41,008 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:20:41,013 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:20:41,076 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:20:41,119 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:20:41,243 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:20:41,245 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:20:41,337 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:20:41,351 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:20:41,374 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:20:41,414 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:20:41,458 WARN L181 SmtUtils]: Spent 477.00 ms on a formula simplification. DAG size of input: 414 DAG size of output: 321 [2018-12-30 23:22:11,810 WARN L181 SmtUtils]: Spent 1.51 m on a formula simplification. DAG size of input: 300 DAG size of output: 137 [2018-12-30 23:23:58,722 WARN L181 SmtUtils]: Spent 1.78 m on a formula simplification. DAG size of input: 300 DAG size of output: 137 [2018-12-30 23:23:58,726 INFO L448 ceAbstractionStarter]: For program point L432(lines 432 870) no Hoare annotation was computed. [2018-12-30 23:23:58,726 INFO L448 ceAbstractionStarter]: For program point L366(lines 366 870) no Hoare annotation was computed. [2018-12-30 23:23:58,726 INFO L448 ceAbstractionStarter]: For program point L168-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:23:58,726 INFO L448 ceAbstractionStarter]: For program point L102-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:23:58,726 INFO L448 ceAbstractionStarter]: For program point L36-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:23:58,727 INFO L448 ceAbstractionStarter]: For program point L235(lines 235 870) no Hoare annotation was computed. [2018-12-30 23:23:58,727 INFO L448 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2018-12-30 23:23:58,727 INFO L448 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2018-12-30 23:23:58,727 INFO L448 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2018-12-30 23:23:58,727 INFO L448 ceAbstractionStarter]: For program point L764(lines 764 870) no Hoare annotation was computed. [2018-12-30 23:23:58,727 INFO L448 ceAbstractionStarter]: For program point L632(lines 632 870) no Hoare annotation was computed. [2018-12-30 23:23:58,727 INFO L448 ceAbstractionStarter]: For program point L500(lines 500 870) no Hoare annotation was computed. [2018-12-30 23:23:58,727 INFO L448 ceAbstractionStarter]: For program point L831(lines 831 870) no Hoare annotation was computed. [2018-12-30 23:23:58,727 INFO L448 ceAbstractionStarter]: For program point L171-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:23:58,727 INFO L448 ceAbstractionStarter]: For program point L105-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:23:58,727 INFO L448 ceAbstractionStarter]: For program point L39-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:23:58,727 INFO L448 ceAbstractionStarter]: For program point L700(lines 700 870) no Hoare annotation was computed. [2018-12-30 23:23:58,728 INFO L448 ceAbstractionStarter]: For program point L568(lines 568 870) no Hoare annotation was computed. [2018-12-30 23:23:58,728 INFO L448 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2018-12-30 23:23:58,728 INFO L448 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2018-12-30 23:23:58,728 INFO L448 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2018-12-30 23:23:58,728 INFO L448 ceAbstractionStarter]: For program point L305(lines 305 870) no Hoare annotation was computed. [2018-12-30 23:23:58,728 INFO L448 ceAbstractionStarter]: For program point L438(lines 438 870) no Hoare annotation was computed. [2018-12-30 23:23:58,728 INFO L448 ceAbstractionStarter]: For program point L372(lines 372 870) no Hoare annotation was computed. [2018-12-30 23:23:58,728 INFO L448 ceAbstractionStarter]: For program point L174-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:23:58,728 INFO L448 ceAbstractionStarter]: For program point L108-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:23:58,728 INFO L448 ceAbstractionStarter]: For program point L42-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:23:58,728 INFO L448 ceAbstractionStarter]: For program point L241(lines 241 870) no Hoare annotation was computed. [2018-12-30 23:23:58,729 INFO L448 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2018-12-30 23:23:58,729 INFO L448 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2018-12-30 23:23:58,729 INFO L448 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2018-12-30 23:23:58,729 INFO L448 ceAbstractionStarter]: For program point L638(lines 638 870) no Hoare annotation was computed. [2018-12-30 23:23:58,729 INFO L448 ceAbstractionStarter]: For program point L506(lines 506 870) no Hoare annotation was computed. [2018-12-30 23:23:58,729 INFO L448 ceAbstractionStarter]: For program point L837(lines 837 870) no Hoare annotation was computed. [2018-12-30 23:23:58,729 INFO L448 ceAbstractionStarter]: For program point L771(lines 771 870) no Hoare annotation was computed. [2018-12-30 23:23:58,729 INFO L448 ceAbstractionStarter]: For program point L573(lines 573 870) no Hoare annotation was computed. [2018-12-30 23:23:58,729 INFO L448 ceAbstractionStarter]: For program point L177-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:23:58,729 INFO L448 ceAbstractionStarter]: For program point L111-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:23:58,729 INFO L448 ceAbstractionStarter]: For program point L45-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:23:58,729 INFO L448 ceAbstractionStarter]: For program point L706(lines 706 870) no Hoare annotation was computed. [2018-12-30 23:23:58,730 INFO L448 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2018-12-30 23:23:58,730 INFO L448 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2018-12-30 23:23:58,730 INFO L448 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2018-12-30 23:23:58,730 INFO L448 ceAbstractionStarter]: For program point L311(lines 311 870) no Hoare annotation was computed. [2018-12-30 23:23:58,730 INFO L448 ceAbstractionStarter]: For program point L444(lines 444 870) no Hoare annotation was computed. [2018-12-30 23:23:58,730 INFO L448 ceAbstractionStarter]: For program point L378(lines 378 870) no Hoare annotation was computed. [2018-12-30 23:23:58,730 INFO L448 ceAbstractionStarter]: For program point L180-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:23:58,730 INFO L448 ceAbstractionStarter]: For program point L114-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:23:58,730 INFO L448 ceAbstractionStarter]: For program point L48-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:23:58,730 INFO L448 ceAbstractionStarter]: For program point L247(lines 247 870) no Hoare annotation was computed. [2018-12-30 23:23:58,730 INFO L448 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2018-12-30 23:23:58,731 INFO L448 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2018-12-30 23:23:58,731 INFO L448 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2018-12-30 23:23:58,731 INFO L448 ceAbstractionStarter]: For program point L842(lines 842 870) no Hoare annotation was computed. [2018-12-30 23:23:58,731 INFO L448 ceAbstractionStarter]: For program point L644(lines 644 870) no Hoare annotation was computed. [2018-12-30 23:23:58,731 INFO L448 ceAbstractionStarter]: For program point L512(lines 512 870) no Hoare annotation was computed. [2018-12-30 23:23:58,731 INFO L448 ceAbstractionStarter]: For program point L777(lines 777 870) no Hoare annotation was computed. [2018-12-30 23:23:58,731 INFO L448 ceAbstractionStarter]: For program point L579(lines 579 870) no Hoare annotation was computed. [2018-12-30 23:23:58,731 INFO L448 ceAbstractionStarter]: For program point L183-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:23:58,731 INFO L448 ceAbstractionStarter]: For program point L117-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:23:58,731 INFO L448 ceAbstractionStarter]: For program point L51-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:23:58,731 INFO L448 ceAbstractionStarter]: For program point L712(lines 712 870) no Hoare annotation was computed. [2018-12-30 23:23:58,731 INFO L448 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2018-12-30 23:23:58,732 INFO L448 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2018-12-30 23:23:58,732 INFO L448 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2018-12-30 23:23:58,732 INFO L448 ceAbstractionStarter]: For program point L449(lines 449 870) no Hoare annotation was computed. [2018-12-30 23:23:58,732 INFO L448 ceAbstractionStarter]: For program point L317(lines 317 870) no Hoare annotation was computed. [2018-12-30 23:23:58,732 INFO L448 ceAbstractionStarter]: For program point L384(lines 384 870) no Hoare annotation was computed. [2018-12-30 23:23:58,732 INFO L448 ceAbstractionStarter]: For program point L252(lines 252 870) no Hoare annotation was computed. [2018-12-30 23:23:58,732 INFO L448 ceAbstractionStarter]: For program point L186-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:23:58,732 INFO L448 ceAbstractionStarter]: For program point L120-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:23:58,732 INFO L448 ceAbstractionStarter]: For program point L54-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:23:58,732 INFO L448 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2018-12-30 23:23:58,732 INFO L448 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2018-12-30 23:23:58,732 INFO L448 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2018-12-30 23:23:58,733 INFO L448 ceAbstractionStarter]: For program point L848(lines 848 870) no Hoare annotation was computed. [2018-12-30 23:23:58,733 INFO L448 ceAbstractionStarter]: For program point L650(lines 650 870) no Hoare annotation was computed. [2018-12-30 23:23:58,733 INFO L448 ceAbstractionStarter]: For program point L518(lines 518 870) no Hoare annotation was computed. [2018-12-30 23:23:58,733 INFO L448 ceAbstractionStarter]: For program point L783(lines 783 870) no Hoare annotation was computed. [2018-12-30 23:23:58,733 INFO L448 ceAbstractionStarter]: For program point L585(lines 585 870) no Hoare annotation was computed. [2018-12-30 23:23:58,733 INFO L448 ceAbstractionStarter]: For program point L189-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:23:58,733 INFO L448 ceAbstractionStarter]: For program point L123-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:23:58,733 INFO L448 ceAbstractionStarter]: For program point L57-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:23:58,733 INFO L448 ceAbstractionStarter]: For program point L718(lines 718 870) no Hoare annotation was computed. [2018-12-30 23:23:58,733 INFO L448 ceAbstractionStarter]: For program point L454(lines 454 870) no Hoare annotation was computed. [2018-12-30 23:23:58,733 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-30 23:23:58,733 INFO L448 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2018-12-30 23:23:58,734 INFO L448 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2018-12-30 23:23:58,734 INFO L448 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2018-12-30 23:23:58,734 INFO L448 ceAbstractionStarter]: For program point L323(lines 323 870) no Hoare annotation was computed. [2018-12-30 23:23:58,734 INFO L448 ceAbstractionStarter]: For program point L390(lines 390 870) no Hoare annotation was computed. [2018-12-30 23:23:58,734 INFO L448 ceAbstractionStarter]: For program point L258(lines 258 870) no Hoare annotation was computed. [2018-12-30 23:23:58,734 INFO L448 ceAbstractionStarter]: For program point L192-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:23:58,734 INFO L448 ceAbstractionStarter]: For program point L126-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:23:58,734 INFO L448 ceAbstractionStarter]: For program point L60-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:23:58,734 INFO L448 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2018-12-30 23:23:58,734 INFO L448 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2018-12-30 23:23:58,734 INFO L448 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2018-12-30 23:23:58,734 INFO L448 ceAbstractionStarter]: For program point L854(lines 854 870) no Hoare annotation was computed. [2018-12-30 23:23:58,734 INFO L448 ceAbstractionStarter]: For program point L656(lines 656 870) no Hoare annotation was computed. [2018-12-30 23:23:58,735 INFO L448 ceAbstractionStarter]: For program point L524(lines 524 870) no Hoare annotation was computed. [2018-12-30 23:23:58,735 INFO L448 ceAbstractionStarter]: For program point L789(lines 789 870) no Hoare annotation was computed. [2018-12-30 23:23:58,735 INFO L448 ceAbstractionStarter]: For program point L591(lines 591 870) no Hoare annotation was computed. [2018-12-30 23:23:58,735 INFO L448 ceAbstractionStarter]: For program point L195-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:23:58,735 INFO L448 ceAbstractionStarter]: For program point L129-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:23:58,735 INFO L448 ceAbstractionStarter]: For program point L63-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:23:58,735 INFO L448 ceAbstractionStarter]: For program point L724(lines 724 870) no Hoare annotation was computed. [2018-12-30 23:23:58,735 INFO L448 ceAbstractionStarter]: For program point L460(lines 460 870) no Hoare annotation was computed. [2018-12-30 23:23:58,735 INFO L448 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2018-12-30 23:23:58,735 INFO L448 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2018-12-30 23:23:58,735 INFO L448 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2018-12-30 23:23:58,735 INFO L448 ceAbstractionStarter]: For program point L329(lines 329 870) no Hoare annotation was computed. [2018-12-30 23:23:58,736 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2018-12-30 23:23:58,736 INFO L448 ceAbstractionStarter]: For program point L396(lines 396 870) no Hoare annotation was computed. [2018-12-30 23:23:58,736 INFO L448 ceAbstractionStarter]: For program point L264(lines 264 870) no Hoare annotation was computed. [2018-12-30 23:23:58,736 INFO L448 ceAbstractionStarter]: For program point L198-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:23:58,736 INFO L448 ceAbstractionStarter]: For program point L132-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:23:58,736 INFO L448 ceAbstractionStarter]: For program point L66-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:23:58,736 INFO L448 ceAbstractionStarter]: For program point L859(lines 859 870) no Hoare annotation was computed. [2018-12-30 23:23:58,736 INFO L448 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2018-12-30 23:23:58,736 INFO L448 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2018-12-30 23:23:58,736 INFO L448 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2018-12-30 23:23:58,736 INFO L448 ceAbstractionStarter]: For program point L662(lines 662 870) no Hoare annotation was computed. [2018-12-30 23:23:58,736 INFO L448 ceAbstractionStarter]: For program point L530(lines 530 870) no Hoare annotation was computed. [2018-12-30 23:23:58,737 INFO L448 ceAbstractionStarter]: For program point L795(lines 795 870) no Hoare annotation was computed. [2018-12-30 23:23:58,737 INFO L448 ceAbstractionStarter]: For program point L597(lines 597 870) no Hoare annotation was computed. [2018-12-30 23:23:58,737 INFO L448 ceAbstractionStarter]: For program point L201-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:23:58,737 INFO L448 ceAbstractionStarter]: For program point L135-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:23:58,737 INFO L448 ceAbstractionStarter]: For program point L69-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:23:58,737 INFO L448 ceAbstractionStarter]: For program point L730(lines 730 870) no Hoare annotation was computed. [2018-12-30 23:23:58,737 INFO L448 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2018-12-30 23:23:58,737 INFO L448 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2018-12-30 23:23:58,737 INFO L448 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2018-12-30 23:23:58,737 INFO L448 ceAbstractionStarter]: For program point L467(lines 467 870) no Hoare annotation was computed. [2018-12-30 23:23:58,737 INFO L448 ceAbstractionStarter]: For program point L335(lines 335 870) no Hoare annotation was computed. [2018-12-30 23:23:58,737 INFO L448 ceAbstractionStarter]: For program point L269(lines 269 870) no Hoare annotation was computed. [2018-12-30 23:23:58,737 INFO L448 ceAbstractionStarter]: For program point L402(lines 402 870) no Hoare annotation was computed. [2018-12-30 23:23:58,738 INFO L448 ceAbstractionStarter]: For program point L138-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:23:58,738 INFO L448 ceAbstractionStarter]: For program point L72-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:23:58,738 INFO L448 ceAbstractionStarter]: For program point L865(lines 865 870) no Hoare annotation was computed. [2018-12-30 23:23:58,738 INFO L448 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2018-12-30 23:23:58,738 INFO L448 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2018-12-30 23:23:58,738 INFO L448 ceAbstractionStarter]: For program point L668(lines 668 870) no Hoare annotation was computed. [2018-12-30 23:23:58,738 INFO L448 ceAbstractionStarter]: For program point L536(lines 536 870) no Hoare annotation was computed. [2018-12-30 23:23:58,738 INFO L448 ceAbstractionStarter]: For program point L801(lines 801 870) no Hoare annotation was computed. [2018-12-30 23:23:58,738 INFO L448 ceAbstractionStarter]: For program point L735(lines 735 870) no Hoare annotation was computed. [2018-12-30 23:23:58,738 INFO L448 ceAbstractionStarter]: For program point L603(lines 603 870) no Hoare annotation was computed. [2018-12-30 23:23:58,738 INFO L448 ceAbstractionStarter]: For program point L141-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:23:58,738 INFO L448 ceAbstractionStarter]: For program point L75-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:23:58,739 INFO L448 ceAbstractionStarter]: For program point L472(lines 472 870) no Hoare annotation was computed. [2018-12-30 23:23:58,739 INFO L448 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2018-12-30 23:23:58,739 INFO L448 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2018-12-30 23:23:58,739 INFO L448 ceAbstractionStarter]: For program point L341(lines 341 870) no Hoare annotation was computed. [2018-12-30 23:23:58,739 INFO L448 ceAbstractionStarter]: For program point L275(lines 275 870) no Hoare annotation was computed. [2018-12-30 23:23:58,739 INFO L448 ceAbstractionStarter]: For program point L408(lines 408 870) no Hoare annotation was computed. [2018-12-30 23:23:58,739 INFO L448 ceAbstractionStarter]: For program point L144-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:23:58,739 INFO L448 ceAbstractionStarter]: For program point L78-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:23:58,740 INFO L444 ceAbstractionStarter]: At program point L871(lines 20 872) the Hoare annotation is: (let ((.cse17 (= ~a15~0 7))) (let ((.cse29 (not .cse17)) (.cse30 (<= ~a15~0 8))) (let ((.cse2 (= ~a21~0 7)) (.cse0 (= ~a15~0 8)) (.cse11 (= ~a21~0 9)) (.cse1 (= ~a24~0 1)) (.cse12 (= ~a21~0 8)) (.cse20 (or (and .cse29 .cse30) (and (not (= 10 ~a21~0)) .cse30))) (.cse26 (< 0 (+ ~a12~0 43)))) (let ((.cse15 (and (<= ~a12~0 80) .cse20 .cse26)) (.cse25 (= ~a21~0 6)) (.cse18 (<= ~a12~0 73282)) (.cse21 (not .cse12)) (.cse31 (and .cse20 (not .cse11) .cse1)) (.cse14 (not .cse0)) (.cse23 (not .cse2)) (.cse4 (= ~a21~0 10)) (.cse8 (<= 19 ~a12~0)) (.cse24 (<= ~a12~0 11)) (.cse10 (< 80 ~a12~0))) (let ((.cse6 (or .cse24 .cse10)) (.cse16 (or (< 11 ~a12~0) .cse0)) (.cse13 (or (and (and .cse0 .cse1 .cse4) .cse8) (and .cse0 .cse24))) (.cse19 (= ~a15~0 5)) (.cse27 (exists ((v_prenex_55 Int)) (and (= ~a12~0 (+ (mod v_prenex_55 299959) 300041)) (< 80 v_prenex_55) (<= 0 v_prenex_55)))) (.cse9 (<= ~a12~0 586307)) (.cse5 (= ~a15~0 9)) (.cse7 (or (and (and .cse25 .cse29 .cse30) .cse14) (and .cse18 .cse21 .cse31 .cse14 .cse23))) (.cse28 (<= ~a21~0 6)) (.cse22 (and .cse15 .cse1)) (.cse3 (<= (+ ~a12~0 49) 0))) (or (and .cse0 .cse1 .cse2 .cse3) (and (<= ~a12~0 599999) (or (and .cse4 .cse5 .cse1 .cse6) (and .cse7 .cse4 .cse8))) (and .cse1 .cse9 .cse5 .cse10 .cse11) (and .cse1 .cse12 (<= (+ ~a12~0 526767) 0) .cse5) (and (and .cse9 .cse2 .cse5) .cse1 .cse10) (and .cse13 .cse10) (and .cse14 (and .cse15 .cse16 .cse1)) (and .cse17 .cse1 .cse4 .cse6) (and .cse18 (not .cse19) (and .cse20 .cse1 .cse12) .cse8) (and (and .cse20 .cse16 .cse1) .cse14 .cse11) (and .cse21 .cse14 .cse22 .cse23) (and .cse13 .cse1 .cse4 .cse24) (and .cse1 .cse9 .cse12 .cse5 .cse8) (and .cse25 .cse1 (= ~a15~0 6)) (and (and .cse15 .cse1 .cse24) .cse11) (and (and .cse25 .cse1) .cse19) (and .cse1 .cse5 .cse12 .cse24 .cse26) (and (and .cse1 .cse0) .cse2 .cse24 .cse26) (and .cse27 .cse1 .cse5 .cse11) (and .cse27 (or (and .cse5 .cse12) (and .cse2 .cse5)) .cse1) (and (<= 95381 ~a12~0) .cse1 .cse9 .cse5 .cse28) (and .cse7 .cse24 .cse28) (and .cse25 .cse0 (exists ((v_prenex_2 Int)) (and (< 80 v_prenex_2) (= (+ (mod v_prenex_2 299959) 286349) ~a12~0) (<= 0 v_prenex_2))) .cse1) (and .cse22 .cse11 .cse8) (and (and (or (and .cse29 .cse1 .cse30) (and .cse1 .cse30 .cse3)) .cse11) .cse14) (and .cse17 .cse31))))))) [2018-12-30 23:23:58,740 INFO L448 ceAbstractionStarter]: For program point L541(lines 541 870) no Hoare annotation was computed. [2018-12-30 23:23:58,740 INFO L448 ceAbstractionStarter]: For program point L211(lines 211 870) no Hoare annotation was computed. [2018-12-30 23:23:58,740 INFO L448 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2018-12-30 23:23:58,740 INFO L448 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2018-12-30 23:23:58,740 INFO L448 ceAbstractionStarter]: For program point L674(lines 674 870) no Hoare annotation was computed. [2018-12-30 23:23:58,740 INFO L448 ceAbstractionStarter]: For program point L807(lines 807 870) no Hoare annotation was computed. [2018-12-30 23:23:58,740 INFO L448 ceAbstractionStarter]: For program point L741(lines 741 870) no Hoare annotation was computed. [2018-12-30 23:23:58,740 INFO L448 ceAbstractionStarter]: For program point L609(lines 609 870) no Hoare annotation was computed. [2018-12-30 23:23:58,741 INFO L448 ceAbstractionStarter]: For program point L147-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:23:58,741 INFO L448 ceAbstractionStarter]: For program point L81-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:23:58,741 INFO L451 ceAbstractionStarter]: At program point L874(lines 874 890) the Hoare annotation is: true [2018-12-30 23:23:58,741 INFO L448 ceAbstractionStarter]: For program point L478(lines 478 870) no Hoare annotation was computed. [2018-12-30 23:23:58,741 INFO L448 ceAbstractionStarter]: For program point L280(lines 280 870) no Hoare annotation was computed. [2018-12-30 23:23:58,741 INFO L448 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2018-12-30 23:23:58,741 INFO L448 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2018-12-30 23:23:58,741 INFO L448 ceAbstractionStarter]: For program point L677(lines 677 870) no Hoare annotation was computed. [2018-12-30 23:23:58,741 INFO L448 ceAbstractionStarter]: For program point L347(lines 347 870) no Hoare annotation was computed. [2018-12-30 23:23:58,741 INFO L448 ceAbstractionStarter]: For program point L414(lines 414 870) no Hoare annotation was computed. [2018-12-30 23:23:58,741 INFO L448 ceAbstractionStarter]: For program point L150-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:23:58,742 INFO L448 ceAbstractionStarter]: For program point L84-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:23:58,742 INFO L448 ceAbstractionStarter]: For program point L547(lines 547 870) no Hoare annotation was computed. [2018-12-30 23:23:58,742 INFO L448 ceAbstractionStarter]: For program point L217(lines 217 870) no Hoare annotation was computed. [2018-12-30 23:23:58,742 INFO L448 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2018-12-30 23:23:58,742 INFO L448 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2018-12-30 23:23:58,742 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2018-12-30 23:23:58,742 INFO L448 ceAbstractionStarter]: For program point L747(lines 747 870) no Hoare annotation was computed. [2018-12-30 23:23:58,742 INFO L448 ceAbstractionStarter]: For program point L615(lines 615 870) no Hoare annotation was computed. [2018-12-30 23:23:58,742 INFO L448 ceAbstractionStarter]: For program point L153-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:23:58,742 INFO L448 ceAbstractionStarter]: For program point L87-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:23:58,742 INFO L448 ceAbstractionStarter]: For program point L21(lines 21 23) no Hoare annotation was computed. [2018-12-30 23:23:58,743 INFO L448 ceAbstractionStarter]: For program point L21-2(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:23:58,743 INFO L448 ceAbstractionStarter]: For program point L814(lines 814 870) no Hoare annotation was computed. [2018-12-30 23:23:58,743 INFO L444 ceAbstractionStarter]: At program point L880-2(lines 880 889) the Hoare annotation is: (let ((.cse17 (= ~a15~0 7))) (let ((.cse29 (not .cse17)) (.cse30 (<= ~a15~0 8))) (let ((.cse2 (= ~a21~0 7)) (.cse0 (= ~a15~0 8)) (.cse11 (= ~a21~0 9)) (.cse1 (= ~a24~0 1)) (.cse12 (= ~a21~0 8)) (.cse20 (or (and .cse29 .cse30) (and (not (= 10 ~a21~0)) .cse30))) (.cse26 (< 0 (+ ~a12~0 43)))) (let ((.cse15 (and (<= ~a12~0 80) .cse20 .cse26)) (.cse25 (= ~a21~0 6)) (.cse18 (<= ~a12~0 73282)) (.cse21 (not .cse12)) (.cse31 (and .cse20 (not .cse11) .cse1)) (.cse14 (not .cse0)) (.cse23 (not .cse2)) (.cse4 (= ~a21~0 10)) (.cse8 (<= 19 ~a12~0)) (.cse24 (<= ~a12~0 11)) (.cse10 (< 80 ~a12~0))) (let ((.cse6 (or .cse24 .cse10)) (.cse16 (or (< 11 ~a12~0) .cse0)) (.cse13 (or (and (and .cse0 .cse1 .cse4) .cse8) (and .cse0 .cse24))) (.cse19 (= ~a15~0 5)) (.cse27 (exists ((v_prenex_55 Int)) (and (= ~a12~0 (+ (mod v_prenex_55 299959) 300041)) (< 80 v_prenex_55) (<= 0 v_prenex_55)))) (.cse9 (<= ~a12~0 586307)) (.cse5 (= ~a15~0 9)) (.cse7 (or (and (and .cse25 .cse29 .cse30) .cse14) (and .cse18 .cse21 .cse31 .cse14 .cse23))) (.cse28 (<= ~a21~0 6)) (.cse22 (and .cse15 .cse1)) (.cse3 (<= (+ ~a12~0 49) 0))) (or (and .cse0 .cse1 .cse2 .cse3) (and (<= ~a12~0 599999) (or (and .cse4 .cse5 .cse1 .cse6) (and .cse7 .cse4 .cse8))) (and .cse1 .cse9 .cse5 .cse10 .cse11) (and .cse1 .cse12 (<= (+ ~a12~0 526767) 0) .cse5) (and (and .cse9 .cse2 .cse5) .cse1 .cse10) (and .cse13 .cse10) (and .cse14 (and .cse15 .cse16 .cse1)) (and .cse17 .cse1 .cse4 .cse6) (and .cse18 (not .cse19) (and .cse20 .cse1 .cse12) .cse8) (and (and .cse20 .cse16 .cse1) .cse14 .cse11) (and .cse21 .cse14 .cse22 .cse23) (and .cse13 .cse1 .cse4 .cse24) (and .cse1 .cse9 .cse12 .cse5 .cse8) (and .cse25 .cse1 (= ~a15~0 6)) (and (and .cse15 .cse1 .cse24) .cse11) (and (and .cse25 .cse1) .cse19) (and .cse1 .cse5 .cse12 .cse24 .cse26) (and (and .cse1 .cse0) .cse2 .cse24 .cse26) (and .cse27 .cse1 .cse5 .cse11) (and .cse27 (or (and .cse5 .cse12) (and .cse2 .cse5)) .cse1) (and (<= 95381 ~a12~0) .cse1 .cse9 .cse5 .cse28) (and .cse7 .cse24 .cse28) (and .cse25 .cse0 (exists ((v_prenex_2 Int)) (and (< 80 v_prenex_2) (= (+ (mod v_prenex_2 299959) 286349) ~a12~0) (<= 0 v_prenex_2))) .cse1) (and .cse22 .cse11 .cse8) (and (and (or (and .cse29 .cse1 .cse30) (and .cse1 .cse30 .cse3)) .cse11) .cse14) (and .cse17 .cse31))))))) [2018-12-30 23:23:58,743 INFO L448 ceAbstractionStarter]: For program point L484(lines 484 870) no Hoare annotation was computed. [2018-12-30 23:23:58,743 INFO L448 ceAbstractionStarter]: For program point L286(lines 286 870) no Hoare annotation was computed. [2018-12-30 23:23:58,744 INFO L448 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2018-12-30 23:23:58,744 INFO L448 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2018-12-30 23:23:58,744 INFO L448 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2018-12-30 23:23:58,744 INFO L448 ceAbstractionStarter]: For program point L683(lines 683 870) no Hoare annotation was computed. [2018-12-30 23:23:58,744 INFO L448 ceAbstractionStarter]: For program point L353(lines 353 870) no Hoare annotation was computed. [2018-12-30 23:23:58,744 INFO L448 ceAbstractionStarter]: For program point L552(lines 552 870) no Hoare annotation was computed. [2018-12-30 23:23:58,744 INFO L448 ceAbstractionStarter]: For program point L420(lines 420 870) no Hoare annotation was computed. [2018-12-30 23:23:58,744 INFO L448 ceAbstractionStarter]: For program point L156-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:23:58,744 INFO L448 ceAbstractionStarter]: For program point L90-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:23:58,744 INFO L448 ceAbstractionStarter]: For program point L24-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:23:58,744 INFO L448 ceAbstractionStarter]: For program point L223(lines 223 870) no Hoare annotation was computed. [2018-12-30 23:23:58,745 INFO L448 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2018-12-30 23:23:58,745 INFO L448 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2018-12-30 23:23:58,745 INFO L448 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2018-12-30 23:23:58,745 INFO L448 ceAbstractionStarter]: For program point L752(lines 752 870) no Hoare annotation was computed. [2018-12-30 23:23:58,745 INFO L448 ceAbstractionStarter]: For program point L885(line 885) no Hoare annotation was computed. [2018-12-30 23:23:58,745 INFO L448 ceAbstractionStarter]: For program point L819(lines 819 870) no Hoare annotation was computed. [2018-12-30 23:23:58,745 INFO L448 ceAbstractionStarter]: For program point L621(lines 621 870) no Hoare annotation was computed. [2018-12-30 23:23:58,745 INFO L448 ceAbstractionStarter]: For program point L555(lines 555 870) no Hoare annotation was computed. [2018-12-30 23:23:58,745 INFO L448 ceAbstractionStarter]: For program point L159-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:23:58,745 INFO L448 ceAbstractionStarter]: For program point L93-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:23:58,745 INFO L448 ceAbstractionStarter]: For program point L27-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:23:58,745 INFO L448 ceAbstractionStarter]: For program point L688(lines 688 870) no Hoare annotation was computed. [2018-12-30 23:23:58,746 INFO L448 ceAbstractionStarter]: For program point L490(lines 490 870) no Hoare annotation was computed. [2018-12-30 23:23:58,746 INFO L448 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2018-12-30 23:23:58,746 INFO L448 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2018-12-30 23:23:58,746 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-30 23:23:58,746 INFO L448 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2018-12-30 23:23:58,746 INFO L448 ceAbstractionStarter]: For program point L359(lines 359 870) no Hoare annotation was computed. [2018-12-30 23:23:58,746 INFO L448 ceAbstractionStarter]: For program point L293(lines 293 870) no Hoare annotation was computed. [2018-12-30 23:23:58,746 INFO L448 ceAbstractionStarter]: For program point L426(lines 426 870) no Hoare annotation was computed. [2018-12-30 23:23:58,746 INFO L448 ceAbstractionStarter]: For program point L162-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:23:58,746 INFO L448 ceAbstractionStarter]: For program point L96-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:23:58,746 INFO L448 ceAbstractionStarter]: For program point L30-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:23:58,747 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 151) no Hoare annotation was computed. [2018-12-30 23:23:58,747 INFO L448 ceAbstractionStarter]: For program point L229(lines 229 870) no Hoare annotation was computed. [2018-12-30 23:23:58,747 INFO L448 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2018-12-30 23:23:58,747 INFO L448 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2018-12-30 23:23:58,747 INFO L448 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2018-12-30 23:23:58,747 INFO L448 ceAbstractionStarter]: For program point L758(lines 758 870) no Hoare annotation was computed. [2018-12-30 23:23:58,747 INFO L448 ceAbstractionStarter]: For program point L626(lines 626 870) no Hoare annotation was computed. [2018-12-30 23:23:58,747 INFO L448 ceAbstractionStarter]: For program point L825(lines 825 870) no Hoare annotation was computed. [2018-12-30 23:23:58,747 INFO L448 ceAbstractionStarter]: For program point L561(lines 561 870) no Hoare annotation was computed. [2018-12-30 23:23:58,747 INFO L448 ceAbstractionStarter]: For program point L495(lines 495 870) no Hoare annotation was computed. [2018-12-30 23:23:58,747 INFO L448 ceAbstractionStarter]: For program point L165-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:23:58,747 INFO L448 ceAbstractionStarter]: For program point L99-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:23:58,748 INFO L448 ceAbstractionStarter]: For program point L33-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:23:58,748 INFO L448 ceAbstractionStarter]: For program point L694(lines 694 870) no Hoare annotation was computed. [2018-12-30 23:23:58,748 INFO L448 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2018-12-30 23:23:58,748 INFO L448 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2018-12-30 23:23:58,748 INFO L448 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2018-12-30 23:23:58,748 INFO L448 ceAbstractionStarter]: For program point L299(lines 299 870) no Hoare annotation was computed. [2018-12-30 23:23:58,759 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_55,QUANTIFIED] [2018-12-30 23:23:58,760 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_55,QUANTIFIED] [2018-12-30 23:23:58,760 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_55,QUANTIFIED] [2018-12-30 23:23:58,760 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_55,QUANTIFIED] [2018-12-30 23:23:58,761 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_55,QUANTIFIED] [2018-12-30 23:23:58,761 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_55,QUANTIFIED] [2018-12-30 23:23:58,761 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-12-30 23:23:58,762 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-12-30 23:23:58,762 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-12-30 23:23:58,804 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_55,QUANTIFIED] [2018-12-30 23:23:58,804 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_55,QUANTIFIED] [2018-12-30 23:23:58,804 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_55,QUANTIFIED] [2018-12-30 23:23:58,804 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_55,QUANTIFIED] [2018-12-30 23:23:58,804 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_55,QUANTIFIED] [2018-12-30 23:23:58,808 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_55,QUANTIFIED] [2018-12-30 23:23:58,808 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-12-30 23:23:58,808 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-12-30 23:23:58,809 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-12-30 23:23:58,826 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_55,QUANTIFIED] [2018-12-30 23:23:58,826 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_55,QUANTIFIED] [2018-12-30 23:23:58,826 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_55,QUANTIFIED] [2018-12-30 23:23:58,826 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_55,QUANTIFIED] [2018-12-30 23:23:58,827 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_55,QUANTIFIED] [2018-12-30 23:23:58,827 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_55,QUANTIFIED] [2018-12-30 23:23:58,827 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-12-30 23:23:58,828 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-12-30 23:23:58,828 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-12-30 23:23:58,840 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_55,QUANTIFIED] [2018-12-30 23:23:58,840 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_55,QUANTIFIED] [2018-12-30 23:23:58,841 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_55,QUANTIFIED] [2018-12-30 23:23:58,841 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_55,QUANTIFIED] [2018-12-30 23:23:58,841 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_55,QUANTIFIED] [2018-12-30 23:23:58,841 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_55,QUANTIFIED] [2018-12-30 23:23:58,842 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-12-30 23:23:58,842 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-12-30 23:23:58,842 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-12-30 23:23:58,847 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.12 11:23:58 BoogieIcfgContainer [2018-12-30 23:23:58,847 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-30 23:23:58,848 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-30 23:23:58,848 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-30 23:23:58,849 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-30 23:23:58,849 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.12 11:19:11" (3/4) ... [2018-12-30 23:23:58,858 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-30 23:23:58,882 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2018-12-30 23:23:58,884 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-12-30 23:23:58,917 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((a15 == 8 && a24 == 1) && a21 == 7) && a12 + 49 <= 0) || (a12 <= 599999 && ((((a21 == 10 && a15 == 9) && a24 == 1) && (a12 <= 11 || 80 < a12)) || ((((((a21 == 6 && !(a15 == 7)) && a15 <= 8) && !(a15 == 8)) || ((((a12 <= 73282 && !(a21 == 8)) && (((!(a15 == 7) && a15 <= 8) || (!(10 == a21) && a15 <= 8)) && !(a21 == 9)) && a24 == 1) && !(a15 == 8)) && !(a21 == 7))) && a21 == 10) && 19 <= a12)))) || ((((a24 == 1 && a12 <= 586307) && a15 == 9) && 80 < a12) && a21 == 9)) || (((a24 == 1 && a21 == 8) && a12 + 526767 <= 0) && a15 == 9)) || ((((a12 <= 586307 && a21 == 7) && a15 == 9) && a24 == 1) && 80 < a12)) || (((((a15 == 8 && a24 == 1) && a21 == 10) && 19 <= a12) || (a15 == 8 && a12 <= 11)) && 80 < a12)) || (!(a15 == 8) && (((a12 <= 80 && ((!(a15 == 7) && a15 <= 8) || (!(10 == a21) && a15 <= 8))) && 0 < a12 + 43) && (11 < a12 || a15 == 8)) && a24 == 1)) || (((a15 == 7 && a24 == 1) && a21 == 10) && (a12 <= 11 || 80 < a12))) || (((a12 <= 73282 && !(a15 == 5)) && (((!(a15 == 7) && a15 <= 8) || (!(10 == a21) && a15 <= 8)) && a24 == 1) && a21 == 8) && 19 <= a12)) || ((((((!(a15 == 7) && a15 <= 8) || (!(10 == a21) && a15 <= 8)) && (11 < a12 || a15 == 8)) && a24 == 1) && !(a15 == 8)) && a21 == 9)) || (((!(a21 == 8) && !(a15 == 8)) && ((a12 <= 80 && ((!(a15 == 7) && a15 <= 8) || (!(10 == a21) && a15 <= 8))) && 0 < a12 + 43) && a24 == 1) && !(a21 == 7))) || (((((((a15 == 8 && a24 == 1) && a21 == 10) && 19 <= a12) || (a15 == 8 && a12 <= 11)) && a24 == 1) && a21 == 10) && a12 <= 11)) || ((((a24 == 1 && a12 <= 586307) && a21 == 8) && a15 == 9) && 19 <= a12)) || ((a21 == 6 && a24 == 1) && a15 == 6)) || (((((a12 <= 80 && ((!(a15 == 7) && a15 <= 8) || (!(10 == a21) && a15 <= 8))) && 0 < a12 + 43) && a24 == 1) && a12 <= 11) && a21 == 9)) || ((a21 == 6 && a24 == 1) && a15 == 5)) || ((((a24 == 1 && a15 == 9) && a21 == 8) && a12 <= 11) && 0 < a12 + 43)) || ((((a24 == 1 && a15 == 8) && a21 == 7) && a12 <= 11) && 0 < a12 + 43)) || ((((\exists v_prenex_55 : int :: (a12 == v_prenex_55 % 299959 + 300041 && 80 < v_prenex_55) && 0 <= v_prenex_55) && a24 == 1) && a15 == 9) && a21 == 9)) || (((\exists v_prenex_55 : int :: (a12 == v_prenex_55 % 299959 + 300041 && 80 < v_prenex_55) && 0 <= v_prenex_55) && ((a15 == 9 && a21 == 8) || (a21 == 7 && a15 == 9))) && a24 == 1)) || ((((95381 <= a12 && a24 == 1) && a12 <= 586307) && a15 == 9) && a21 <= 6)) || ((((((a21 == 6 && !(a15 == 7)) && a15 <= 8) && !(a15 == 8)) || ((((a12 <= 73282 && !(a21 == 8)) && (((!(a15 == 7) && a15 <= 8) || (!(10 == a21) && a15 <= 8)) && !(a21 == 9)) && a24 == 1) && !(a15 == 8)) && !(a21 == 7))) && a12 <= 11) && a21 <= 6)) || (((a21 == 6 && a15 == 8) && (\exists v_prenex_2 : int :: (80 < v_prenex_2 && v_prenex_2 % 299959 + 286349 == a12) && 0 <= v_prenex_2)) && a24 == 1)) || (((((a12 <= 80 && ((!(a15 == 7) && a15 <= 8) || (!(10 == a21) && a15 <= 8))) && 0 < a12 + 43) && a24 == 1) && a21 == 9) && 19 <= a12)) || (((((!(a15 == 7) && a24 == 1) && a15 <= 8) || ((a24 == 1 && a15 <= 8) && a12 + 49 <= 0)) && a21 == 9) && !(a15 == 8))) || (a15 == 7 && (((!(a15 == 7) && a15 <= 8) || (!(10 == a21) && a15 <= 8)) && !(a21 == 9)) && a24 == 1) [2018-12-30 23:23:58,921 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((a15 == 8 && a24 == 1) && a21 == 7) && a12 + 49 <= 0) || (a12 <= 599999 && ((((a21 == 10 && a15 == 9) && a24 == 1) && (a12 <= 11 || 80 < a12)) || ((((((a21 == 6 && !(a15 == 7)) && a15 <= 8) && !(a15 == 8)) || ((((a12 <= 73282 && !(a21 == 8)) && (((!(a15 == 7) && a15 <= 8) || (!(10 == a21) && a15 <= 8)) && !(a21 == 9)) && a24 == 1) && !(a15 == 8)) && !(a21 == 7))) && a21 == 10) && 19 <= a12)))) || ((((a24 == 1 && a12 <= 586307) && a15 == 9) && 80 < a12) && a21 == 9)) || (((a24 == 1 && a21 == 8) && a12 + 526767 <= 0) && a15 == 9)) || ((((a12 <= 586307 && a21 == 7) && a15 == 9) && a24 == 1) && 80 < a12)) || (((((a15 == 8 && a24 == 1) && a21 == 10) && 19 <= a12) || (a15 == 8 && a12 <= 11)) && 80 < a12)) || (!(a15 == 8) && (((a12 <= 80 && ((!(a15 == 7) && a15 <= 8) || (!(10 == a21) && a15 <= 8))) && 0 < a12 + 43) && (11 < a12 || a15 == 8)) && a24 == 1)) || (((a15 == 7 && a24 == 1) && a21 == 10) && (a12 <= 11 || 80 < a12))) || (((a12 <= 73282 && !(a15 == 5)) && (((!(a15 == 7) && a15 <= 8) || (!(10 == a21) && a15 <= 8)) && a24 == 1) && a21 == 8) && 19 <= a12)) || ((((((!(a15 == 7) && a15 <= 8) || (!(10 == a21) && a15 <= 8)) && (11 < a12 || a15 == 8)) && a24 == 1) && !(a15 == 8)) && a21 == 9)) || (((!(a21 == 8) && !(a15 == 8)) && ((a12 <= 80 && ((!(a15 == 7) && a15 <= 8) || (!(10 == a21) && a15 <= 8))) && 0 < a12 + 43) && a24 == 1) && !(a21 == 7))) || (((((((a15 == 8 && a24 == 1) && a21 == 10) && 19 <= a12) || (a15 == 8 && a12 <= 11)) && a24 == 1) && a21 == 10) && a12 <= 11)) || ((((a24 == 1 && a12 <= 586307) && a21 == 8) && a15 == 9) && 19 <= a12)) || ((a21 == 6 && a24 == 1) && a15 == 6)) || (((((a12 <= 80 && ((!(a15 == 7) && a15 <= 8) || (!(10 == a21) && a15 <= 8))) && 0 < a12 + 43) && a24 == 1) && a12 <= 11) && a21 == 9)) || ((a21 == 6 && a24 == 1) && a15 == 5)) || ((((a24 == 1 && a15 == 9) && a21 == 8) && a12 <= 11) && 0 < a12 + 43)) || ((((a24 == 1 && a15 == 8) && a21 == 7) && a12 <= 11) && 0 < a12 + 43)) || ((((\exists v_prenex_55 : int :: (a12 == v_prenex_55 % 299959 + 300041 && 80 < v_prenex_55) && 0 <= v_prenex_55) && a24 == 1) && a15 == 9) && a21 == 9)) || (((\exists v_prenex_55 : int :: (a12 == v_prenex_55 % 299959 + 300041 && 80 < v_prenex_55) && 0 <= v_prenex_55) && ((a15 == 9 && a21 == 8) || (a21 == 7 && a15 == 9))) && a24 == 1)) || ((((95381 <= a12 && a24 == 1) && a12 <= 586307) && a15 == 9) && a21 <= 6)) || ((((((a21 == 6 && !(a15 == 7)) && a15 <= 8) && !(a15 == 8)) || ((((a12 <= 73282 && !(a21 == 8)) && (((!(a15 == 7) && a15 <= 8) || (!(10 == a21) && a15 <= 8)) && !(a21 == 9)) && a24 == 1) && !(a15 == 8)) && !(a21 == 7))) && a12 <= 11) && a21 <= 6)) || (((a21 == 6 && a15 == 8) && (\exists v_prenex_2 : int :: (80 < v_prenex_2 && v_prenex_2 % 299959 + 286349 == a12) && 0 <= v_prenex_2)) && a24 == 1)) || (((((a12 <= 80 && ((!(a15 == 7) && a15 <= 8) || (!(10 == a21) && a15 <= 8))) && 0 < a12 + 43) && a24 == 1) && a21 == 9) && 19 <= a12)) || (((((!(a15 == 7) && a24 == 1) && a15 <= 8) || ((a24 == 1 && a15 <= 8) && a12 + 49 <= 0)) && a21 == 9) && !(a15 == 8))) || (a15 == 7 && (((!(a15 == 7) && a15 <= 8) || (!(10 == a21) && a15 <= 8)) && !(a21 == 9)) && a24 == 1) [2018-12-30 23:23:59,088 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-30 23:23:59,089 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-30 23:23:59,090 INFO L168 Benchmark]: Toolchain (without parser) took 293184.83 ms. Allocated memory was 1.0 GB in the beginning and 4.8 GB in the end (delta: 3.8 GB). Free memory was 948.7 MB in the beginning and 2.0 GB in the end (delta: -1.1 GB). Peak memory consumption was 2.7 GB. Max. memory is 11.5 GB. [2018-12-30 23:23:59,090 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-30 23:23:59,091 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1000.60 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 172.5 MB). Free memory was 948.7 MB in the beginning and 1.2 GB in the end (delta: -214.1 MB). Peak memory consumption was 60.0 MB. Max. memory is 11.5 GB. [2018-12-30 23:23:59,092 INFO L168 Benchmark]: Boogie Procedure Inliner took 153.45 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 13.9 MB). Peak memory consumption was 13.9 MB. Max. memory is 11.5 GB. [2018-12-30 23:23:59,092 INFO L168 Benchmark]: Boogie Preprocessor took 137.60 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2018-12-30 23:23:59,094 INFO L168 Benchmark]: RCFGBuilder took 3978.33 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 123.6 MB). Peak memory consumption was 123.6 MB. Max. memory is 11.5 GB. [2018-12-30 23:23:59,094 INFO L168 Benchmark]: TraceAbstraction took 287668.29 ms. Allocated memory was 1.2 GB in the beginning and 4.8 GB in the end (delta: 3.6 GB). Free memory was 1.0 GB in the beginning and 2.0 GB in the end (delta: -1.0 GB). Peak memory consumption was 2.6 GB. Max. memory is 11.5 GB. [2018-12-30 23:23:59,095 INFO L168 Benchmark]: Witness Printer took 241.22 ms. Allocated memory is still 4.8 GB. Free memory is still 2.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-30 23:23:59,098 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1000.60 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 172.5 MB). Free memory was 948.7 MB in the beginning and 1.2 GB in the end (delta: -214.1 MB). Peak memory consumption was 60.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 153.45 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 13.9 MB). Peak memory consumption was 13.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 137.60 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 3978.33 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 123.6 MB). Peak memory consumption was 123.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 287668.29 ms. Allocated memory was 1.2 GB in the beginning and 4.8 GB in the end (delta: 3.6 GB). Free memory was 1.0 GB in the beginning and 2.0 GB in the end (delta: -1.0 GB). Peak memory consumption was 2.6 GB. Max. memory is 11.5 GB. * Witness Printer took 241.22 ms. Allocated memory is still 4.8 GB. Free memory is still 2.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_55,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_55,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_55,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_55,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_55,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_55,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_55,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_55,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_55,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_55,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_55,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_55,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_55,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_55,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_55,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_55,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_55,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_55,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_55,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_55,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_55,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_55,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_55,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_55,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 151]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 880]: Loop Invariant [2018-12-30 23:23:59,105 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_55,QUANTIFIED] [2018-12-30 23:23:59,105 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_55,QUANTIFIED] [2018-12-30 23:23:59,105 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_55,QUANTIFIED] [2018-12-30 23:23:59,113 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_55,QUANTIFIED] [2018-12-30 23:23:59,113 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_55,QUANTIFIED] [2018-12-30 23:23:59,113 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_55,QUANTIFIED] [2018-12-30 23:23:59,113 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-12-30 23:23:59,114 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-12-30 23:23:59,114 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-12-30 23:23:59,116 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_55,QUANTIFIED] [2018-12-30 23:23:59,116 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_55,QUANTIFIED] [2018-12-30 23:23:59,116 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_55,QUANTIFIED] [2018-12-30 23:23:59,116 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_55,QUANTIFIED] [2018-12-30 23:23:59,116 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_55,QUANTIFIED] [2018-12-30 23:23:59,117 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_55,QUANTIFIED] [2018-12-30 23:23:59,117 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-12-30 23:23:59,117 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-12-30 23:23:59,117 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] Derived loop invariant: (((((((((((((((((((((((((((a15 == 8 && a24 == 1) && a21 == 7) && a12 + 49 <= 0) || (a12 <= 599999 && ((((a21 == 10 && a15 == 9) && a24 == 1) && (a12 <= 11 || 80 < a12)) || ((((((a21 == 6 && !(a15 == 7)) && a15 <= 8) && !(a15 == 8)) || ((((a12 <= 73282 && !(a21 == 8)) && (((!(a15 == 7) && a15 <= 8) || (!(10 == a21) && a15 <= 8)) && !(a21 == 9)) && a24 == 1) && !(a15 == 8)) && !(a21 == 7))) && a21 == 10) && 19 <= a12)))) || ((((a24 == 1 && a12 <= 586307) && a15 == 9) && 80 < a12) && a21 == 9)) || (((a24 == 1 && a21 == 8) && a12 + 526767 <= 0) && a15 == 9)) || ((((a12 <= 586307 && a21 == 7) && a15 == 9) && a24 == 1) && 80 < a12)) || (((((a15 == 8 && a24 == 1) && a21 == 10) && 19 <= a12) || (a15 == 8 && a12 <= 11)) && 80 < a12)) || (!(a15 == 8) && (((a12 <= 80 && ((!(a15 == 7) && a15 <= 8) || (!(10 == a21) && a15 <= 8))) && 0 < a12 + 43) && (11 < a12 || a15 == 8)) && a24 == 1)) || (((a15 == 7 && a24 == 1) && a21 == 10) && (a12 <= 11 || 80 < a12))) || (((a12 <= 73282 && !(a15 == 5)) && (((!(a15 == 7) && a15 <= 8) || (!(10 == a21) && a15 <= 8)) && a24 == 1) && a21 == 8) && 19 <= a12)) || ((((((!(a15 == 7) && a15 <= 8) || (!(10 == a21) && a15 <= 8)) && (11 < a12 || a15 == 8)) && a24 == 1) && !(a15 == 8)) && a21 == 9)) || (((!(a21 == 8) && !(a15 == 8)) && ((a12 <= 80 && ((!(a15 == 7) && a15 <= 8) || (!(10 == a21) && a15 <= 8))) && 0 < a12 + 43) && a24 == 1) && !(a21 == 7))) || (((((((a15 == 8 && a24 == 1) && a21 == 10) && 19 <= a12) || (a15 == 8 && a12 <= 11)) && a24 == 1) && a21 == 10) && a12 <= 11)) || ((((a24 == 1 && a12 <= 586307) && a21 == 8) && a15 == 9) && 19 <= a12)) || ((a21 == 6 && a24 == 1) && a15 == 6)) || (((((a12 <= 80 && ((!(a15 == 7) && a15 <= 8) || (!(10 == a21) && a15 <= 8))) && 0 < a12 + 43) && a24 == 1) && a12 <= 11) && a21 == 9)) || ((a21 == 6 && a24 == 1) && a15 == 5)) || ((((a24 == 1 && a15 == 9) && a21 == 8) && a12 <= 11) && 0 < a12 + 43)) || ((((a24 == 1 && a15 == 8) && a21 == 7) && a12 <= 11) && 0 < a12 + 43)) || ((((\exists v_prenex_55 : int :: (a12 == v_prenex_55 % 299959 + 300041 && 80 < v_prenex_55) && 0 <= v_prenex_55) && a24 == 1) && a15 == 9) && a21 == 9)) || (((\exists v_prenex_55 : int :: (a12 == v_prenex_55 % 299959 + 300041 && 80 < v_prenex_55) && 0 <= v_prenex_55) && ((a15 == 9 && a21 == 8) || (a21 == 7 && a15 == 9))) && a24 == 1)) || ((((95381 <= a12 && a24 == 1) && a12 <= 586307) && a15 == 9) && a21 <= 6)) || ((((((a21 == 6 && !(a15 == 7)) && a15 <= 8) && !(a15 == 8)) || ((((a12 <= 73282 && !(a21 == 8)) && (((!(a15 == 7) && a15 <= 8) || (!(10 == a21) && a15 <= 8)) && !(a21 == 9)) && a24 == 1) && !(a15 == 8)) && !(a21 == 7))) && a12 <= 11) && a21 <= 6)) || (((a21 == 6 && a15 == 8) && (\exists v_prenex_2 : int :: (80 < v_prenex_2 && v_prenex_2 % 299959 + 286349 == a12) && 0 <= v_prenex_2)) && a24 == 1)) || (((((a12 <= 80 && ((!(a15 == 7) && a15 <= 8) || (!(10 == a21) && a15 <= 8))) && 0 < a12 + 43) && a24 == 1) && a21 == 9) && 19 <= a12)) || (((((!(a15 == 7) && a24 == 1) && a15 <= 8) || ((a24 == 1 && a15 <= 8) && a12 + 49 <= 0)) && a21 == 9) && !(a15 == 8))) || (a15 == 7 && (((!(a15 == 7) && a15 <= 8) || (!(10 == a21) && a15 <= 8)) && !(a21 == 9)) && a24 == 1) - InvariantResult [Line: 20]: Loop Invariant [2018-12-30 23:23:59,119 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_55,QUANTIFIED] [2018-12-30 23:23:59,119 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_55,QUANTIFIED] [2018-12-30 23:23:59,119 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_55,QUANTIFIED] [2018-12-30 23:23:59,120 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_55,QUANTIFIED] [2018-12-30 23:23:59,120 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_55,QUANTIFIED] [2018-12-30 23:23:59,120 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_55,QUANTIFIED] [2018-12-30 23:23:59,120 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-12-30 23:23:59,120 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-12-30 23:23:59,120 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-12-30 23:23:59,122 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_55,QUANTIFIED] [2018-12-30 23:23:59,122 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_55,QUANTIFIED] [2018-12-30 23:23:59,122 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_55,QUANTIFIED] [2018-12-30 23:23:59,123 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_55,QUANTIFIED] [2018-12-30 23:23:59,123 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_55,QUANTIFIED] [2018-12-30 23:23:59,123 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_55,QUANTIFIED] [2018-12-30 23:23:59,123 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-12-30 23:23:59,123 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-12-30 23:23:59,124 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] Derived loop invariant: (((((((((((((((((((((((((((a15 == 8 && a24 == 1) && a21 == 7) && a12 + 49 <= 0) || (a12 <= 599999 && ((((a21 == 10 && a15 == 9) && a24 == 1) && (a12 <= 11 || 80 < a12)) || ((((((a21 == 6 && !(a15 == 7)) && a15 <= 8) && !(a15 == 8)) || ((((a12 <= 73282 && !(a21 == 8)) && (((!(a15 == 7) && a15 <= 8) || (!(10 == a21) && a15 <= 8)) && !(a21 == 9)) && a24 == 1) && !(a15 == 8)) && !(a21 == 7))) && a21 == 10) && 19 <= a12)))) || ((((a24 == 1 && a12 <= 586307) && a15 == 9) && 80 < a12) && a21 == 9)) || (((a24 == 1 && a21 == 8) && a12 + 526767 <= 0) && a15 == 9)) || ((((a12 <= 586307 && a21 == 7) && a15 == 9) && a24 == 1) && 80 < a12)) || (((((a15 == 8 && a24 == 1) && a21 == 10) && 19 <= a12) || (a15 == 8 && a12 <= 11)) && 80 < a12)) || (!(a15 == 8) && (((a12 <= 80 && ((!(a15 == 7) && a15 <= 8) || (!(10 == a21) && a15 <= 8))) && 0 < a12 + 43) && (11 < a12 || a15 == 8)) && a24 == 1)) || (((a15 == 7 && a24 == 1) && a21 == 10) && (a12 <= 11 || 80 < a12))) || (((a12 <= 73282 && !(a15 == 5)) && (((!(a15 == 7) && a15 <= 8) || (!(10 == a21) && a15 <= 8)) && a24 == 1) && a21 == 8) && 19 <= a12)) || ((((((!(a15 == 7) && a15 <= 8) || (!(10 == a21) && a15 <= 8)) && (11 < a12 || a15 == 8)) && a24 == 1) && !(a15 == 8)) && a21 == 9)) || (((!(a21 == 8) && !(a15 == 8)) && ((a12 <= 80 && ((!(a15 == 7) && a15 <= 8) || (!(10 == a21) && a15 <= 8))) && 0 < a12 + 43) && a24 == 1) && !(a21 == 7))) || (((((((a15 == 8 && a24 == 1) && a21 == 10) && 19 <= a12) || (a15 == 8 && a12 <= 11)) && a24 == 1) && a21 == 10) && a12 <= 11)) || ((((a24 == 1 && a12 <= 586307) && a21 == 8) && a15 == 9) && 19 <= a12)) || ((a21 == 6 && a24 == 1) && a15 == 6)) || (((((a12 <= 80 && ((!(a15 == 7) && a15 <= 8) || (!(10 == a21) && a15 <= 8))) && 0 < a12 + 43) && a24 == 1) && a12 <= 11) && a21 == 9)) || ((a21 == 6 && a24 == 1) && a15 == 5)) || ((((a24 == 1 && a15 == 9) && a21 == 8) && a12 <= 11) && 0 < a12 + 43)) || ((((a24 == 1 && a15 == 8) && a21 == 7) && a12 <= 11) && 0 < a12 + 43)) || ((((\exists v_prenex_55 : int :: (a12 == v_prenex_55 % 299959 + 300041 && 80 < v_prenex_55) && 0 <= v_prenex_55) && a24 == 1) && a15 == 9) && a21 == 9)) || (((\exists v_prenex_55 : int :: (a12 == v_prenex_55 % 299959 + 300041 && 80 < v_prenex_55) && 0 <= v_prenex_55) && ((a15 == 9 && a21 == 8) || (a21 == 7 && a15 == 9))) && a24 == 1)) || ((((95381 <= a12 && a24 == 1) && a12 <= 586307) && a15 == 9) && a21 <= 6)) || ((((((a21 == 6 && !(a15 == 7)) && a15 <= 8) && !(a15 == 8)) || ((((a12 <= 73282 && !(a21 == 8)) && (((!(a15 == 7) && a15 <= 8) || (!(10 == a21) && a15 <= 8)) && !(a21 == 9)) && a24 == 1) && !(a15 == 8)) && !(a21 == 7))) && a12 <= 11) && a21 <= 6)) || (((a21 == 6 && a15 == 8) && (\exists v_prenex_2 : int :: (80 < v_prenex_2 && v_prenex_2 % 299959 + 286349 == a12) && 0 <= v_prenex_2)) && a24 == 1)) || (((((a12 <= 80 && ((!(a15 == 7) && a15 <= 8) || (!(10 == a21) && a15 <= 8))) && 0 < a12 + 43) && a24 == 1) && a21 == 9) && 19 <= a12)) || (((((!(a15 == 7) && a24 == 1) && a15 <= 8) || ((a24 == 1 && a15 <= 8) && a12 + 49 <= 0)) && a21 == 9) && !(a15 == 8))) || (a15 == 7 && (((!(a15 == 7) && a15 <= 8) || (!(10 == a21) && a15 <= 8)) && !(a21 == 9)) && a24 == 1) - InvariantResult [Line: 874]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 245 locations, 1 error locations. SAFE Result, 287.4s OverallTime, 21 OverallIterations, 17 TraceHistogramMax, 44.3s AutomataDifference, 0.0s DeadEndRemovalTime, 198.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 1180 SDtfs, 8284 SDslu, 425 SDs, 0 SdLazy, 28927 SolverSat, 2516 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 35.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 8099 GetRequests, 7966 SyntacticMatches, 21 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 8.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5878occurred in iteration=14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 21 MinimizatonAttempts, 8390 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 112 NumberOfFragments, 1515 HoareAnnotationTreeSize, 3 FomulaSimplifications, 232792 FormulaSimplificationTreeSizeReduction, 1.1s HoareSimplificationTime, 3 FomulaSimplificationsInter, 125742 FormulaSimplificationTreeSizeReductionInter, 197.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.7s SsaConstructionTime, 2.7s SatisfiabilityAnalysisTime, 23.4s InterpolantComputationTime, 28349 NumberOfCodeBlocks, 28349 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 28321 ConstructedInterpolants, 164 QuantifiedInterpolants, 105577974 SizeOfPredicates, 18 NumberOfNonLiveVariables, 9645 ConjunctsInSsa, 62 ConjunctsInUnsatCore, 28 InterpolantComputations, 16 PerfectInterpolantSequences, 125894/127282 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...