./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/eca-rers2012/Problem14_label51_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_label51_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 82f1252cdfefb15e293400630c3df24cee2c679c ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:01,419 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-30 23:19:01,421 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-30 23:19:01,433 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-30 23:19:01,434 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-30 23:19:01,435 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-30 23:19:01,436 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-30 23:19:01,438 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-30 23:19:01,440 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-30 23:19:01,441 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-30 23:19:01,442 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-30 23:19:01,442 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-30 23:19:01,443 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-30 23:19:01,444 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-30 23:19:01,445 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-30 23:19:01,446 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-30 23:19:01,447 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-30 23:19:01,449 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-30 23:19:01,451 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-30 23:19:01,453 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-30 23:19:01,454 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-30 23:19:01,455 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-30 23:19:01,458 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-30 23:19:01,458 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-30 23:19:01,458 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-30 23:19:01,459 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-30 23:19:01,461 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-30 23:19:01,461 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-30 23:19:01,462 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-30 23:19:01,464 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-30 23:19:01,464 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-30 23:19:01,465 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-30 23:19:01,465 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-30 23:19:01,465 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-30 23:19:01,466 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-30 23:19:01,469 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-30 23:19:01,470 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:01,497 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-30 23:19:01,497 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-30 23:19:01,498 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-30 23:19:01,498 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-30 23:19:01,499 INFO L133 SettingsManager]: * Use SBE=true [2018-12-30 23:19:01,499 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-30 23:19:01,499 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-30 23:19:01,499 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-30 23:19:01,499 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-30 23:19:01,500 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-30 23:19:01,500 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-30 23:19:01,500 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-30 23:19:01,500 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-30 23:19:01,500 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-30 23:19:01,501 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-30 23:19:01,501 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-30 23:19:01,501 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-30 23:19:01,501 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-30 23:19:01,501 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-30 23:19:01,501 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-30 23:19:01,502 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-30 23:19:01,502 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-30 23:19:01,502 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-30 23:19:01,502 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-30 23:19:01,502 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-30 23:19:01,502 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-30 23:19:01,503 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-30 23:19:01,503 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-30 23:19:01,503 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 -> 82f1252cdfefb15e293400630c3df24cee2c679c [2018-12-30 23:19:01,540 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-30 23:19:01,553 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-30 23:19:01,557 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-30 23:19:01,559 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-30 23:19:01,559 INFO L276 PluginConnector]: CDTParser initialized [2018-12-30 23:19:01,560 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/eca-rers2012/Problem14_label51_true-unreach-call_false-termination.c [2018-12-30 23:19:01,626 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/61d53262b/b18cbf4ee60846019aa6aceb40abad02/FLAG28eb95654 [2018-12-30 23:19:02,221 INFO L307 CDTParser]: Found 1 translation units. [2018-12-30 23:19:02,222 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/eca-rers2012/Problem14_label51_true-unreach-call_false-termination.c [2018-12-30 23:19:02,243 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/61d53262b/b18cbf4ee60846019aa6aceb40abad02/FLAG28eb95654 [2018-12-30 23:19:02,425 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/61d53262b/b18cbf4ee60846019aa6aceb40abad02 [2018-12-30 23:19:02,429 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-30 23:19:02,431 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-30 23:19:02,432 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-30 23:19:02,433 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-30 23:19:02,437 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-30 23:19:02,438 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.12 11:19:02" (1/1) ... [2018-12-30 23:19:02,441 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2cc38887 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 11:19:02, skipping insertion in model container [2018-12-30 23:19:02,442 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.12 11:19:02" (1/1) ... [2018-12-30 23:19:02,450 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-30 23:19:02,530 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-30 23:19:03,088 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-30 23:19:03,093 INFO L191 MainTranslator]: Completed pre-run [2018-12-30 23:19:03,237 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-30 23:19:03,255 INFO L195 MainTranslator]: Completed translation [2018-12-30 23:19:03,256 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 11:19:03 WrapperNode [2018-12-30 23:19:03,256 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-30 23:19:03,257 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-30 23:19:03,257 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-30 23:19:03,257 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-30 23:19:03,350 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:03" (1/1) ... [2018-12-30 23:19:03,374 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:03" (1/1) ... [2018-12-30 23:19:03,449 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-30 23:19:03,450 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-30 23:19:03,450 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-30 23:19:03,450 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-30 23:19:03,464 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:03" (1/1) ... [2018-12-30 23:19:03,464 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:03" (1/1) ... [2018-12-30 23:19:03,470 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:03" (1/1) ... [2018-12-30 23:19:03,470 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:03" (1/1) ... [2018-12-30 23:19:03,501 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:03" (1/1) ... [2018-12-30 23:19:03,520 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:03" (1/1) ... [2018-12-30 23:19:03,531 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:03" (1/1) ... [2018-12-30 23:19:03,554 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-30 23:19:03,555 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-30 23:19:03,555 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-30 23:19:03,555 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-30 23:19:03,558 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 11:19:03" (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:03,643 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-30 23:19:03,643 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-30 23:19:07,271 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-30 23:19:07,271 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2018-12-30 23:19:07,274 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.12 11:19:07 BoogieIcfgContainer [2018-12-30 23:19:07,274 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-30 23:19:07,275 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-30 23:19:07,275 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-30 23:19:07,279 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-30 23:19:07,282 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.12 11:19:02" (1/3) ... [2018-12-30 23:19:07,283 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7dc18757 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.12 11:19:07, skipping insertion in model container [2018-12-30 23:19:07,283 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 11:19:03" (2/3) ... [2018-12-30 23:19:07,283 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7dc18757 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.12 11:19:07, skipping insertion in model container [2018-12-30 23:19:07,284 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.12 11:19:07" (3/3) ... [2018-12-30 23:19:07,287 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem14_label51_true-unreach-call_false-termination.c [2018-12-30 23:19:07,300 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-30 23:19:07,311 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-30 23:19:07,330 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-30 23:19:07,367 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-30 23:19:07,368 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-30 23:19:07,368 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-30 23:19:07,368 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-30 23:19:07,368 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-30 23:19:07,368 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-30 23:19:07,369 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-30 23:19:07,369 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-30 23:19:07,370 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-30 23:19:07,395 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states. [2018-12-30 23:19:07,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-30 23:19:07,404 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:19:07,405 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] [2018-12-30 23:19:07,408 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:19:07,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:19:07,416 INFO L82 PathProgramCache]: Analyzing trace with hash -596708735, now seen corresponding path program 1 times [2018-12-30 23:19:07,419 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:19:07,420 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:19:07,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:19:07,481 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:19:07,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:19:07,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:19:07,834 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:07,836 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 23:19:07,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 23:19:07,840 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-30 23:19:07,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-30 23:19:07,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 23:19:07,855 INFO L87 Difference]: Start difference. First operand 245 states. Second operand 4 states. [2018-12-30 23:19:10,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:19:10,708 INFO L93 Difference]: Finished difference Result 866 states and 1574 transitions. [2018-12-30 23:19:10,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-30 23:19:10,710 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2018-12-30 23:19:10,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:19:10,731 INFO L225 Difference]: With dead ends: 866 [2018-12-30 23:19:10,731 INFO L226 Difference]: Without dead ends: 538 [2018-12-30 23:19:10,738 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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:19:10,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2018-12-30 23:19:10,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 538. [2018-12-30 23:19:10,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 538 states. [2018-12-30 23:19:10,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 754 transitions. [2018-12-30 23:19:10,833 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 754 transitions. Word has length 35 [2018-12-30 23:19:10,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:19:10,834 INFO L480 AbstractCegarLoop]: Abstraction has 538 states and 754 transitions. [2018-12-30 23:19:10,834 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-30 23:19:10,834 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 754 transitions. [2018-12-30 23:19:10,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-12-30 23:19:10,840 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:19:10,841 INFO L402 BasicCegarLoop]: trace histogram [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, 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:10,841 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:19:10,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:19:10,842 INFO L82 PathProgramCache]: Analyzing trace with hash -545911462, now seen corresponding path program 1 times [2018-12-30 23:19:10,842 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:19:10,842 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:19:10,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:19:10,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:19:10,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:19:10,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:19:11,325 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 13 [2018-12-30 23:19:11,447 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 23:19:11,448 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 23:19:11,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-30 23:19:11,450 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-30 23:19:11,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-30 23:19:11,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-30 23:19:11,451 INFO L87 Difference]: Start difference. First operand 538 states and 754 transitions. Second operand 6 states. [2018-12-30 23:19:14,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:19:14,401 INFO L93 Difference]: Finished difference Result 1964 states and 2764 transitions. [2018-12-30 23:19:14,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-30 23:19:14,402 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 143 [2018-12-30 23:19:14,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:19:14,411 INFO L225 Difference]: With dead ends: 1964 [2018-12-30 23:19:14,411 INFO L226 Difference]: Without dead ends: 1428 [2018-12-30 23:19:14,415 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-12-30 23:19:14,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1428 states. [2018-12-30 23:19:14,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1428 to 1428. [2018-12-30 23:19:14,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1428 states. [2018-12-30 23:19:14,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1428 states to 1428 states and 1849 transitions. [2018-12-30 23:19:14,464 INFO L78 Accepts]: Start accepts. Automaton has 1428 states and 1849 transitions. Word has length 143 [2018-12-30 23:19:14,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:19:14,465 INFO L480 AbstractCegarLoop]: Abstraction has 1428 states and 1849 transitions. [2018-12-30 23:19:14,465 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-30 23:19:14,465 INFO L276 IsEmpty]: Start isEmpty. Operand 1428 states and 1849 transitions. [2018-12-30 23:19:14,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2018-12-30 23:19:14,477 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:19:14,477 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 23:19:14,478 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:19:14,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:19:14,478 INFO L82 PathProgramCache]: Analyzing trace with hash 1795619338, now seen corresponding path program 1 times [2018-12-30 23:19:14,478 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:19:14,478 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:19:14,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:19:14,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:19:14,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:19:14,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:19:14,637 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-12-30 23:19:14,637 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 23:19:14,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 23:19:14,638 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-30 23:19:14,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-30 23:19:14,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 23:19:14,639 INFO L87 Difference]: Start difference. First operand 1428 states and 1849 transitions. Second operand 4 states. [2018-12-30 23:19:17,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:19:17,405 INFO L93 Difference]: Finished difference Result 3922 states and 5314 transitions. [2018-12-30 23:19:17,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-30 23:19:17,406 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 209 [2018-12-30 23:19:17,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:19:17,420 INFO L225 Difference]: With dead ends: 3922 [2018-12-30 23:19:17,420 INFO L226 Difference]: Without dead ends: 2674 [2018-12-30 23:19:17,423 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:17,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2674 states. [2018-12-30 23:19:17,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2674 to 2318. [2018-12-30 23:19:17,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2318 states. [2018-12-30 23:19:17,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2318 states to 2318 states and 2951 transitions. [2018-12-30 23:19:17,478 INFO L78 Accepts]: Start accepts. Automaton has 2318 states and 2951 transitions. Word has length 209 [2018-12-30 23:19:17,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:19:17,479 INFO L480 AbstractCegarLoop]: Abstraction has 2318 states and 2951 transitions. [2018-12-30 23:19:17,479 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-30 23:19:17,479 INFO L276 IsEmpty]: Start isEmpty. Operand 2318 states and 2951 transitions. [2018-12-30 23:19:17,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2018-12-30 23:19:17,486 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:19:17,486 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, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 23:19:17,486 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:19:17,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:19:17,487 INFO L82 PathProgramCache]: Analyzing trace with hash -853230355, now seen corresponding path program 1 times [2018-12-30 23:19:17,488 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:19:17,488 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:19:17,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:19:17,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:19:17,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:19:17,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:19:17,973 WARN L181 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 9 [2018-12-30 23:19:18,136 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 136 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-30 23:19:18,136 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 23:19:18,136 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,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:19:18,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:19:18,238 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 23:19:18,380 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2018-12-30 23:19:18,401 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-30 23:19:18,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2018-12-30 23:19:18,402 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-30 23:19:18,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-30 23:19:18,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-30 23:19:18,402 INFO L87 Difference]: Start difference. First operand 2318 states and 2951 transitions. Second operand 6 states. [2018-12-30 23:19:19,704 WARN L181 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 15 [2018-12-30 23:19:24,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:19:24,776 INFO L93 Difference]: Finished difference Result 5313 states and 6711 transitions. [2018-12-30 23:19:24,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-30 23:19:24,777 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 223 [2018-12-30 23:19:24,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:19:24,793 INFO L225 Difference]: With dead ends: 5313 [2018-12-30 23:19:24,794 INFO L226 Difference]: Without dead ends: 3030 [2018-12-30 23:19:24,798 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 224 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-12-30 23:19:24,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3030 states. [2018-12-30 23:19:24,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3030 to 2318. [2018-12-30 23:19:24,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2318 states. [2018-12-30 23:19:24,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2318 states to 2318 states and 2504 transitions. [2018-12-30 23:19:24,854 INFO L78 Accepts]: Start accepts. Automaton has 2318 states and 2504 transitions. Word has length 223 [2018-12-30 23:19:24,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:19:24,856 INFO L480 AbstractCegarLoop]: Abstraction has 2318 states and 2504 transitions. [2018-12-30 23:19:24,856 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-30 23:19:24,856 INFO L276 IsEmpty]: Start isEmpty. Operand 2318 states and 2504 transitions. [2018-12-30 23:19:24,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2018-12-30 23:19:24,863 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:19:24,863 INFO L402 BasicCegarLoop]: trace histogram [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, 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, 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] [2018-12-30 23:19:24,864 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:19:24,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:19:24,865 INFO L82 PathProgramCache]: Analyzing trace with hash 1484675231, now seen corresponding path program 1 times [2018-12-30 23:19:24,865 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:19:24,865 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:19:24,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:19:24,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:19:24,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:19:24,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:19:25,479 WARN L181 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 12 [2018-12-30 23:19:25,774 INFO L134 CoverageAnalysis]: Checked inductivity of 340 backedges. 303 proven. 4 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-12-30 23:19:25,774 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 23:19:25,775 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:25,787 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:19:25,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:19:25,883 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 23:19:25,987 INFO L134 CoverageAnalysis]: Checked inductivity of 340 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2018-12-30 23:19:26,008 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-30 23:19:26,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2018-12-30 23:19:26,009 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-30 23:19:26,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-30 23:19:26,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-30 23:19:26,010 INFO L87 Difference]: Start difference. First operand 2318 states and 2504 transitions. Second operand 7 states. [2018-12-30 23:19:31,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:19:31,043 INFO L93 Difference]: Finished difference Result 6242 states and 6731 transitions. [2018-12-30 23:19:31,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-30 23:19:31,045 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 339 [2018-12-30 23:19:31,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:19:31,064 INFO L225 Difference]: With dead ends: 6242 [2018-12-30 23:19:31,065 INFO L226 Difference]: Without dead ends: 3926 [2018-12-30 23:19:31,071 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 340 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-12-30 23:19:31,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3926 states. [2018-12-30 23:19:31,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3926 to 3386. [2018-12-30 23:19:31,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3386 states. [2018-12-30 23:19:31,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3386 states to 3386 states and 3618 transitions. [2018-12-30 23:19:31,141 INFO L78 Accepts]: Start accepts. Automaton has 3386 states and 3618 transitions. Word has length 339 [2018-12-30 23:19:31,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:19:31,141 INFO L480 AbstractCegarLoop]: Abstraction has 3386 states and 3618 transitions. [2018-12-30 23:19:31,142 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-30 23:19:31,142 INFO L276 IsEmpty]: Start isEmpty. Operand 3386 states and 3618 transitions. [2018-12-30 23:19:31,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 506 [2018-12-30 23:19:31,154 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:19:31,154 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, 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, 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] [2018-12-30 23:19:31,154 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:19:31,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:19:31,156 INFO L82 PathProgramCache]: Analyzing trace with hash 379242444, now seen corresponding path program 1 times [2018-12-30 23:19:31,156 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:19:31,156 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:19:31,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:19:31,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:19:31,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:19:31,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:19:31,650 INFO L134 CoverageAnalysis]: Checked inductivity of 998 backedges. 164 proven. 0 refuted. 0 times theorem prover too weak. 834 trivial. 0 not checked. [2018-12-30 23:19:31,650 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 23:19:31,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-30 23:19:31,651 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-30 23:19:31,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-30 23:19:31,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 23:19:31,651 INFO L87 Difference]: Start difference. First operand 3386 states and 3618 transitions. Second operand 4 states. [2018-12-30 23:19:33,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:19:33,086 INFO L93 Difference]: Finished difference Result 8372 states and 9031 transitions. [2018-12-30 23:19:33,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-30 23:19:33,087 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 505 [2018-12-30 23:19:33,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:19:33,109 INFO L225 Difference]: With dead ends: 8372 [2018-12-30 23:19:33,109 INFO L226 Difference]: Without dead ends: 4988 [2018-12-30 23:19:33,114 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:19:33,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4988 states. [2018-12-30 23:19:33,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4988 to 4632. [2018-12-30 23:19:33,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4632 states. [2018-12-30 23:19:33,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4632 states to 4632 states and 4976 transitions. [2018-12-30 23:19:33,194 INFO L78 Accepts]: Start accepts. Automaton has 4632 states and 4976 transitions. Word has length 505 [2018-12-30 23:19:33,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:19:33,195 INFO L480 AbstractCegarLoop]: Abstraction has 4632 states and 4976 transitions. [2018-12-30 23:19:33,195 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-30 23:19:33,195 INFO L276 IsEmpty]: Start isEmpty. Operand 4632 states and 4976 transitions. [2018-12-30 23:19:33,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 514 [2018-12-30 23:19:33,208 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:19:33,208 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, 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, 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] [2018-12-30 23:19:33,209 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:19:33,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:19:33,209 INFO L82 PathProgramCache]: Analyzing trace with hash 139622368, now seen corresponding path program 1 times [2018-12-30 23:19:33,209 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:19:33,209 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:19:33,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:19:33,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:19:33,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:19:33,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:19:33,818 INFO L134 CoverageAnalysis]: Checked inductivity of 1022 backedges. 502 proven. 0 refuted. 0 times theorem prover too weak. 520 trivial. 0 not checked. [2018-12-30 23:19:33,818 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 23:19:33,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-30 23:19:33,819 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-30 23:19:33,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-30 23:19:33,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-30 23:19:33,820 INFO L87 Difference]: Start difference. First operand 4632 states and 4976 transitions. Second operand 6 states. [2018-12-30 23:19:34,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:19:34,757 INFO L93 Difference]: Finished difference Result 9283 states and 9967 transitions. [2018-12-30 23:19:34,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-30 23:19:34,758 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 513 [2018-12-30 23:19:34,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:19:34,773 INFO L225 Difference]: With dead ends: 9283 [2018-12-30 23:19:34,773 INFO L226 Difference]: Without dead ends: 4632 [2018-12-30 23:19:34,779 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-30 23:19:34,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4632 states. [2018-12-30 23:19:34,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4632 to 4454. [2018-12-30 23:19:34,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4454 states. [2018-12-30 23:19:34,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4454 states to 4454 states and 4780 transitions. [2018-12-30 23:19:34,853 INFO L78 Accepts]: Start accepts. Automaton has 4454 states and 4780 transitions. Word has length 513 [2018-12-30 23:19:34,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:19:34,854 INFO L480 AbstractCegarLoop]: Abstraction has 4454 states and 4780 transitions. [2018-12-30 23:19:34,854 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-30 23:19:34,855 INFO L276 IsEmpty]: Start isEmpty. Operand 4454 states and 4780 transitions. [2018-12-30 23:19:34,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 519 [2018-12-30 23:19:34,861 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:19:34,861 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 23:19:34,862 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:19:34,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:19:34,862 INFO L82 PathProgramCache]: Analyzing trace with hash 127003364, now seen corresponding path program 1 times [2018-12-30 23:19:34,862 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:19:34,862 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:19:34,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:19:34,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:19:34,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:19:34,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:19:35,359 INFO L134 CoverageAnalysis]: Checked inductivity of 1037 backedges. 517 proven. 0 refuted. 0 times theorem prover too weak. 520 trivial. 0 not checked. [2018-12-30 23:19:35,360 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 23:19:35,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-30 23:19:35,361 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-30 23:19:35,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-30 23:19:35,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-30 23:19:35,361 INFO L87 Difference]: Start difference. First operand 4454 states and 4780 transitions. Second operand 6 states. [2018-12-30 23:19:37,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:19:37,342 INFO L93 Difference]: Finished difference Result 9182 states and 9872 transitions. [2018-12-30 23:19:37,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-30 23:19:37,343 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 518 [2018-12-30 23:19:37,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:19:37,357 INFO L225 Difference]: With dead ends: 9182 [2018-12-30 23:19:37,357 INFO L226 Difference]: Without dead ends: 4730 [2018-12-30 23:19:37,362 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-12-30 23:19:37,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4730 states. [2018-12-30 23:19:37,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4730 to 4632. [2018-12-30 23:19:37,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4632 states. [2018-12-30 23:19:37,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4632 states to 4632 states and 4977 transitions. [2018-12-30 23:19:37,435 INFO L78 Accepts]: Start accepts. Automaton has 4632 states and 4977 transitions. Word has length 518 [2018-12-30 23:19:37,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:19:37,436 INFO L480 AbstractCegarLoop]: Abstraction has 4632 states and 4977 transitions. [2018-12-30 23:19:37,436 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-30 23:19:37,436 INFO L276 IsEmpty]: Start isEmpty. Operand 4632 states and 4977 transitions. [2018-12-30 23:19:37,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 525 [2018-12-30 23:19:37,443 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:19:37,443 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, 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, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 23:19:37,443 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:19:37,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:19:37,444 INFO L82 PathProgramCache]: Analyzing trace with hash 1311309651, now seen corresponding path program 1 times [2018-12-30 23:19:37,444 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:19:37,444 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:19:37,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:19:37,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:19:37,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:19:37,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:19:38,143 WARN L181 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 13 [2018-12-30 23:19:38,526 INFO L134 CoverageAnalysis]: Checked inductivity of 1055 backedges. 758 proven. 130 refuted. 0 times theorem prover too weak. 167 trivial. 0 not checked. [2018-12-30 23:19:38,526 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 23:19:38,526 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:38,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:19:38,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:19:38,729 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 23:19:39,256 INFO L134 CoverageAnalysis]: Checked inductivity of 1055 backedges. 730 proven. 0 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2018-12-30 23:19:39,275 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-30 23:19:39,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 13 [2018-12-30 23:19:39,276 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-30 23:19:39,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-30 23:19:39,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2018-12-30 23:19:39,277 INFO L87 Difference]: Start difference. First operand 4632 states and 4977 transitions. Second operand 14 states. [2018-12-30 23:19:42,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:19:42,605 INFO L93 Difference]: Finished difference Result 9905 states and 10630 transitions. [2018-12-30 23:19:42,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-30 23:19:42,606 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 524 [2018-12-30 23:19:42,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:19:42,627 INFO L225 Difference]: With dead ends: 9905 [2018-12-30 23:19:42,628 INFO L226 Difference]: Without dead ends: 4994 [2018-12-30 23:19:42,632 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 539 GetRequests, 520 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=117, Invalid=263, Unknown=0, NotChecked=0, Total=380 [2018-12-30 23:19:42,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4994 states. [2018-12-30 23:19:42,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4994 to 4098. [2018-12-30 23:19:42,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4098 states. [2018-12-30 23:19:42,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4098 states to 4098 states and 4326 transitions. [2018-12-30 23:19:42,698 INFO L78 Accepts]: Start accepts. Automaton has 4098 states and 4326 transitions. Word has length 524 [2018-12-30 23:19:42,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:19:42,698 INFO L480 AbstractCegarLoop]: Abstraction has 4098 states and 4326 transitions. [2018-12-30 23:19:42,699 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-30 23:19:42,699 INFO L276 IsEmpty]: Start isEmpty. Operand 4098 states and 4326 transitions. [2018-12-30 23:19:42,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 857 [2018-12-30 23:19:42,708 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:19:42,709 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, 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, 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:42,709 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:19:42,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:19:42,709 INFO L82 PathProgramCache]: Analyzing trace with hash -1233217796, now seen corresponding path program 1 times [2018-12-30 23:19:42,709 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:19:42,710 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:19:42,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:19:42,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:19:42,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:19:42,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:19:43,764 INFO L134 CoverageAnalysis]: Checked inductivity of 2250 backedges. 1452 proven. 0 refuted. 0 times theorem prover too weak. 798 trivial. 0 not checked. [2018-12-30 23:19:43,764 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 23:19:43,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-30 23:19:43,766 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-30 23:19:43,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-30 23:19:43,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 23:19:43,766 INFO L87 Difference]: Start difference. First operand 4098 states and 4326 transitions. Second operand 4 states. [2018-12-30 23:19:45,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:19:45,037 INFO L93 Difference]: Finished difference Result 8550 states and 9025 transitions. [2018-12-30 23:19:45,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-30 23:19:45,038 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 856 [2018-12-30 23:19:45,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:19:45,055 INFO L225 Difference]: With dead ends: 8550 [2018-12-30 23:19:45,055 INFO L226 Difference]: Without dead ends: 4454 [2018-12-30 23:19:45,060 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 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:45,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4454 states. [2018-12-30 23:19:45,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4454 to 4454. [2018-12-30 23:19:45,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4454 states. [2018-12-30 23:19:45,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4454 states to 4454 states and 4632 transitions. [2018-12-30 23:19:45,122 INFO L78 Accepts]: Start accepts. Automaton has 4454 states and 4632 transitions. Word has length 856 [2018-12-30 23:19:45,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:19:45,123 INFO L480 AbstractCegarLoop]: Abstraction has 4454 states and 4632 transitions. [2018-12-30 23:19:45,123 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-30 23:19:45,123 INFO L276 IsEmpty]: Start isEmpty. Operand 4454 states and 4632 transitions. [2018-12-30 23:19:45,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 875 [2018-12-30 23:19:45,134 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:19:45,135 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, 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, 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:45,135 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:19:45,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:19:45,137 INFO L82 PathProgramCache]: Analyzing trace with hash -2049858615, now seen corresponding path program 1 times [2018-12-30 23:19:45,137 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:19:45,137 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:19:45,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:19:45,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:19:45,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:19:45,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:19:45,655 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-12-30 23:19:45,850 WARN L181 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-12-30 23:19:46,097 WARN L181 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-12-30 23:19:47,348 INFO L134 CoverageAnalysis]: Checked inductivity of 2268 backedges. 1616 proven. 199 refuted. 0 times theorem prover too weak. 453 trivial. 0 not checked. [2018-12-30 23:19:47,348 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 23:19:47,348 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:47,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:19:47,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:19:47,555 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 23:19:47,918 WARN L181 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-12-30 23:19:48,737 INFO L134 CoverageAnalysis]: Checked inductivity of 2268 backedges. 230 proven. 0 refuted. 0 times theorem prover too weak. 2038 trivial. 0 not checked. [2018-12-30 23:19:48,756 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-30 23:19:48,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2018-12-30 23:19:48,757 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-30 23:19:48,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-30 23:19:48,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-12-30 23:19:48,758 INFO L87 Difference]: Start difference. First operand 4454 states and 4632 transitions. Second operand 9 states. [2018-12-30 23:19:51,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:19:51,439 INFO L93 Difference]: Finished difference Result 10352 states and 10757 transitions. [2018-12-30 23:19:51,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-30 23:19:51,440 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 874 [2018-12-30 23:19:51,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:19:51,453 INFO L225 Difference]: With dead ends: 10352 [2018-12-30 23:19:51,453 INFO L226 Difference]: Without dead ends: 6059 [2018-12-30 23:19:51,458 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 880 GetRequests, 872 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2018-12-30 23:19:51,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6059 states. [2018-12-30 23:19:51,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6059 to 4810. [2018-12-30 23:19:51,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4810 states. [2018-12-30 23:19:51,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4810 states to 4810 states and 4973 transitions. [2018-12-30 23:19:51,539 INFO L78 Accepts]: Start accepts. Automaton has 4810 states and 4973 transitions. Word has length 874 [2018-12-30 23:19:51,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:19:51,540 INFO L480 AbstractCegarLoop]: Abstraction has 4810 states and 4973 transitions. [2018-12-30 23:19:51,540 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-30 23:19:51,541 INFO L276 IsEmpty]: Start isEmpty. Operand 4810 states and 4973 transitions. [2018-12-30 23:19:51,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1033 [2018-12-30 23:19:51,557 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:19:51,557 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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, 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, 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, 1] [2018-12-30 23:19:51,559 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:19:51,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:19:51,559 INFO L82 PathProgramCache]: Analyzing trace with hash 538441961, now seen corresponding path program 1 times [2018-12-30 23:19:51,559 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:19:51,560 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:19:51,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:19:51,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:19:51,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:19:51,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:19:52,560 INFO L134 CoverageAnalysis]: Checked inductivity of 3493 backedges. 2157 proven. 0 refuted. 0 times theorem prover too weak. 1336 trivial. 0 not checked. [2018-12-30 23:19:52,560 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 23:19:52,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-30 23:19:52,561 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-30 23:19:52,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-30 23:19:52,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-30 23:19:52,562 INFO L87 Difference]: Start difference. First operand 4810 states and 4973 transitions. Second operand 5 states. [2018-12-30 23:19:53,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:19:53,839 INFO L93 Difference]: Finished difference Result 10864 states and 11230 transitions. [2018-12-30 23:19:53,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-30 23:19:53,840 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 1032 [2018-12-30 23:19:53,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:19:53,853 INFO L225 Difference]: With dead ends: 10864 [2018-12-30 23:19:53,853 INFO L226 Difference]: Without dead ends: 6234 [2018-12-30 23:19:53,860 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-30 23:19:53,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6234 states. [2018-12-30 23:19:53,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6234 to 4988. [2018-12-30 23:19:53,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4988 states. [2018-12-30 23:19:53,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4988 states to 4988 states and 5152 transitions. [2018-12-30 23:19:53,944 INFO L78 Accepts]: Start accepts. Automaton has 4988 states and 5152 transitions. Word has length 1032 [2018-12-30 23:19:53,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:19:53,945 INFO L480 AbstractCegarLoop]: Abstraction has 4988 states and 5152 transitions. [2018-12-30 23:19:53,945 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-30 23:19:53,945 INFO L276 IsEmpty]: Start isEmpty. Operand 4988 states and 5152 transitions. [2018-12-30 23:19:53,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1647 [2018-12-30 23:19:53,978 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:19:53,979 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, 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, 13, 13, 13, 13, 13, 13, 13, 13, 13, 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, 11, 11, 11, 11, 11, 10, 9, 9, 9, 8, 8, 8, 8, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 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:53,979 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:19:53,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:19:53,980 INFO L82 PathProgramCache]: Analyzing trace with hash -172671030, now seen corresponding path program 1 times [2018-12-30 23:19:53,980 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:19:53,980 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:19:53,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:19:53,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:19:53,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:19:54,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:19:58,106 INFO L134 CoverageAnalysis]: Checked inductivity of 8542 backedges. 4706 proven. 728 refuted. 0 times theorem prover too weak. 3108 trivial. 0 not checked. [2018-12-30 23:19:58,106 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 23:19:58,106 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:19:58,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:19:58,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:19:58,482 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 23:19:59,030 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-12-30 23:20:03,114 INFO L134 CoverageAnalysis]: Checked inductivity of 8542 backedges. 5716 proven. 514 refuted. 0 times theorem prover too weak. 2312 trivial. 0 not checked. [2018-12-30 23:20:03,133 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-30 23:20:03,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 17 [2018-12-30 23:20:03,135 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-30 23:20:03,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-30 23:20:03,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2018-12-30 23:20:03,136 INFO L87 Difference]: Start difference. First operand 4988 states and 5152 transitions. Second operand 18 states. [2018-12-30 23:20:15,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:20:15,187 INFO L93 Difference]: Finished difference Result 11941 states and 12374 transitions. [2018-12-30 23:20:15,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-30 23:20:15,188 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 1646 [2018-12-30 23:20:15,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:20:15,201 INFO L225 Difference]: With dead ends: 11941 [2018-12-30 23:20:15,202 INFO L226 Difference]: Without dead ends: 6421 [2018-12-30 23:20:15,207 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1664 GetRequests, 1640 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=145, Invalid=455, Unknown=0, NotChecked=0, Total=600 [2018-12-30 23:20:15,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6421 states. [2018-12-30 23:20:15,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6421 to 4454. [2018-12-30 23:20:15,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4454 states. [2018-12-30 23:20:15,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4454 states to 4454 states and 4560 transitions. [2018-12-30 23:20:15,279 INFO L78 Accepts]: Start accepts. Automaton has 4454 states and 4560 transitions. Word has length 1646 [2018-12-30 23:20:15,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:20:15,281 INFO L480 AbstractCegarLoop]: Abstraction has 4454 states and 4560 transitions. [2018-12-30 23:20:15,281 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-30 23:20:15,281 INFO L276 IsEmpty]: Start isEmpty. Operand 4454 states and 4560 transitions. [2018-12-30 23:20:15,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1743 [2018-12-30 23:20:15,314 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:20:15,315 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, 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, 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, 11, 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, 1] [2018-12-30 23:20:15,317 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:20:15,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:20:15,318 INFO L82 PathProgramCache]: Analyzing trace with hash 1952577186, now seen corresponding path program 1 times [2018-12-30 23:20:15,318 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:20:15,318 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:20:15,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:20:15,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:20:15,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:20:15,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:20:17,533 INFO L134 CoverageAnalysis]: Checked inductivity of 9519 backedges. 3801 proven. 0 refuted. 0 times theorem prover too weak. 5718 trivial. 0 not checked. [2018-12-30 23:20:17,533 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 23:20:17,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-30 23:20:17,534 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-30 23:20:17,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-30 23:20:17,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 23:20:17,535 INFO L87 Difference]: Start difference. First operand 4454 states and 4560 transitions. Second operand 4 states. [2018-12-30 23:20:18,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:20:18,390 INFO L93 Difference]: Finished difference Result 9974 states and 10200 transitions. [2018-12-30 23:20:18,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-30 23:20:18,391 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1742 [2018-12-30 23:20:18,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:20:18,400 INFO L225 Difference]: With dead ends: 9974 [2018-12-30 23:20:18,401 INFO L226 Difference]: Without dead ends: 3564 [2018-12-30 23:20:18,406 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 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:20:18,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3564 states. [2018-12-30 23:20:18,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3564 to 3564. [2018-12-30 23:20:18,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3564 states. [2018-12-30 23:20:18,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3564 states to 3564 states and 3609 transitions. [2018-12-30 23:20:18,455 INFO L78 Accepts]: Start accepts. Automaton has 3564 states and 3609 transitions. Word has length 1742 [2018-12-30 23:20:18,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:20:18,457 INFO L480 AbstractCegarLoop]: Abstraction has 3564 states and 3609 transitions. [2018-12-30 23:20:18,457 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-30 23:20:18,458 INFO L276 IsEmpty]: Start isEmpty. Operand 3564 states and 3609 transitions. [2018-12-30 23:20:18,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1814 [2018-12-30 23:20:18,485 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:20:18,487 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, 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, 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, 12, 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, 1] [2018-12-30 23:20:18,487 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:20:18,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:20:18,488 INFO L82 PathProgramCache]: Analyzing trace with hash -354861792, now seen corresponding path program 1 times [2018-12-30 23:20:18,488 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:20:18,488 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:20:18,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:20:18,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:20:18,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:20:18,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:20:19,869 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 5 [2018-12-30 23:20:20,121 WARN L181 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 3 [2018-12-30 23:20:21,752 INFO L134 CoverageAnalysis]: Checked inductivity of 10875 backedges. 5597 proven. 627 refuted. 0 times theorem prover too weak. 4651 trivial. 0 not checked. [2018-12-30 23:20:21,753 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 23:20:21,753 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,763 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:20:22,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:20:22,167 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 23:20:23,535 WARN L181 SmtUtils]: Spent 939.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 32 [2018-12-30 23:20:25,202 INFO L134 CoverageAnalysis]: Checked inductivity of 10875 backedges. 3815 proven. 209 refuted. 0 times theorem prover too weak. 6851 trivial. 0 not checked. [2018-12-30 23:20:25,221 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-30 23:20:25,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 10 [2018-12-30 23:20:25,223 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-30 23:20:25,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-30 23:20:25,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-12-30 23:20:25,223 INFO L87 Difference]: Start difference. First operand 3564 states and 3609 transitions. Second operand 10 states. [2018-12-30 23:20:32,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:20:32,847 INFO L93 Difference]: Finished difference Result 8550 states and 8674 transitions. [2018-12-30 23:20:32,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-30 23:20:32,847 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 1813 [2018-12-30 23:20:32,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:20:32,857 INFO L225 Difference]: With dead ends: 8550 [2018-12-30 23:20:32,857 INFO L226 Difference]: Without dead ends: 4810 [2018-12-30 23:20:32,863 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1834 GetRequests, 1817 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2018-12-30 23:20:32,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4810 states. [2018-12-30 23:20:32,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4810 to 3920. [2018-12-30 23:20:32,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3920 states. [2018-12-30 23:20:32,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3920 states to 3920 states and 3967 transitions. [2018-12-30 23:20:32,938 INFO L78 Accepts]: Start accepts. Automaton has 3920 states and 3967 transitions. Word has length 1813 [2018-12-30 23:20:32,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:20:32,940 INFO L480 AbstractCegarLoop]: Abstraction has 3920 states and 3967 transitions. [2018-12-30 23:20:32,940 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-30 23:20:32,940 INFO L276 IsEmpty]: Start isEmpty. Operand 3920 states and 3967 transitions. [2018-12-30 23:20:32,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1940 [2018-12-30 23:20:32,976 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:20:32,977 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, 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, 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, 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, 1] [2018-12-30 23:20:32,978 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:20:32,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:20:32,978 INFO L82 PathProgramCache]: Analyzing trace with hash -412541850, now seen corresponding path program 1 times [2018-12-30 23:20:32,980 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:20:32,980 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:20:32,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:20:32,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:20:32,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:20:33,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:20:37,730 INFO L134 CoverageAnalysis]: Checked inductivity of 12527 backedges. 7300 proven. 1392 refuted. 0 times theorem prover too weak. 3835 trivial. 0 not checked. [2018-12-30 23:20:37,730 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 23:20:37,730 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:37,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:20:38,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:20:38,150 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 23:20:38,435 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 18 [2018-12-30 23:20:41,817 INFO L134 CoverageAnalysis]: Checked inductivity of 12527 backedges. 8692 proven. 0 refuted. 0 times theorem prover too weak. 3835 trivial. 0 not checked. [2018-12-30 23:20:41,846 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-30 23:20:41,847 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2018-12-30 23:20:41,850 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-30 23:20:41,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-30 23:20:41,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-12-30 23:20:41,851 INFO L87 Difference]: Start difference. First operand 3920 states and 3967 transitions. Second operand 8 states. [2018-12-30 23:20:44,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:20:44,798 INFO L93 Difference]: Finished difference Result 5551 states and 5630 transitions. [2018-12-30 23:20:44,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-30 23:20:44,799 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 1939 [2018-12-30 23:20:44,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:20:44,805 INFO L225 Difference]: With dead ends: 5551 [2018-12-30 23:20:44,805 INFO L226 Difference]: Without dead ends: 3947 [2018-12-30 23:20:44,808 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1947 GetRequests, 1938 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2018-12-30 23:20:44,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3947 states. [2018-12-30 23:20:44,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3947 to 3564. [2018-12-30 23:20:44,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3564 states. [2018-12-30 23:20:44,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3564 states to 3564 states and 3599 transitions. [2018-12-30 23:20:44,846 INFO L78 Accepts]: Start accepts. Automaton has 3564 states and 3599 transitions. Word has length 1939 [2018-12-30 23:20:44,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:20:44,848 INFO L480 AbstractCegarLoop]: Abstraction has 3564 states and 3599 transitions. [2018-12-30 23:20:44,848 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-30 23:20:44,848 INFO L276 IsEmpty]: Start isEmpty. Operand 3564 states and 3599 transitions. [2018-12-30 23:20:44,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2116 [2018-12-30 23:20:44,880 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:20:44,881 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 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, 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, 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, 1] [2018-12-30 23:20:44,881 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:20:44,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:20:44,882 INFO L82 PathProgramCache]: Analyzing trace with hash 58677289, now seen corresponding path program 1 times [2018-12-30 23:20:44,882 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:20:44,882 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:20:44,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:20:44,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:20:44,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:20:45,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:20:47,554 INFO L134 CoverageAnalysis]: Checked inductivity of 14461 backedges. 4502 proven. 209 refuted. 0 times theorem prover too weak. 9750 trivial. 0 not checked. [2018-12-30 23:20:47,554 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 23:20:47,555 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-30 23:20:47,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:20:47,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:20:48,021 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 23:20:50,371 INFO L134 CoverageAnalysis]: Checked inductivity of 14461 backedges. 4502 proven. 209 refuted. 0 times theorem prover too weak. 9750 trivial. 0 not checked. [2018-12-30 23:20:50,401 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-30 23:20:50,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-12-30 23:20:50,404 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-30 23:20:50,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-30 23:20:50,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-30 23:20:50,405 INFO L87 Difference]: Start difference. First operand 3564 states and 3599 transitions. Second operand 6 states. [2018-12-30 23:20:53,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:20:53,430 INFO L93 Difference]: Finished difference Result 3564 states and 3599 transitions. [2018-12-30 23:20:53,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-30 23:20:53,431 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 2115 [2018-12-30 23:20:53,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:20:53,433 INFO L225 Difference]: With dead ends: 3564 [2018-12-30 23:20:53,433 INFO L226 Difference]: Without dead ends: 0 [2018-12-30 23:20:53,435 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2122 GetRequests, 2116 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-12-30 23:20:53,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-30 23:20:53,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-30 23:20:53,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-30 23:20:53,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-30 23:20:53,436 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 2115 [2018-12-30 23:20:53,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:20:53,437 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-30 23:20:53,437 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-30 23:20:53,437 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-30 23:20:53,437 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-30 23:20:53,443 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-30 23:20:53,719 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:20:53,848 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:20:53,849 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:20:53,889 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:20:53,893 WARN L181 SmtUtils]: Spent 445.00 ms on a formula simplification. DAG size of input: 438 DAG size of output: 355 [2018-12-30 23:20:54,169 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:20:54,284 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:20:54,285 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:20:54,315 WARN L181 SmtUtils]: Spent 420.00 ms on a formula simplification. DAG size of input: 437 DAG size of output: 355 [2018-12-30 23:21:00,266 WARN L181 SmtUtils]: Spent 5.95 s on a formula simplification. DAG size of input: 327 DAG size of output: 165 [2018-12-30 23:21:03,905 WARN L181 SmtUtils]: Spent 3.63 s on a formula simplification. DAG size of input: 327 DAG size of output: 165 [2018-12-30 23:21:03,909 INFO L448 ceAbstractionStarter]: For program point L432(lines 432 870) no Hoare annotation was computed. [2018-12-30 23:21:03,909 INFO L448 ceAbstractionStarter]: For program point L366(lines 366 870) no Hoare annotation was computed. [2018-12-30 23:21:03,909 INFO L448 ceAbstractionStarter]: For program point L168-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:21:03,910 INFO L448 ceAbstractionStarter]: For program point L102-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:21:03,910 INFO L448 ceAbstractionStarter]: For program point L36-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:21:03,910 INFO L448 ceAbstractionStarter]: For program point L235(lines 235 870) no Hoare annotation was computed. [2018-12-30 23:21:03,910 INFO L448 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2018-12-30 23:21:03,910 INFO L448 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2018-12-30 23:21:03,910 INFO L448 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2018-12-30 23:21:03,910 INFO L448 ceAbstractionStarter]: For program point L764(lines 764 870) no Hoare annotation was computed. [2018-12-30 23:21:03,910 INFO L448 ceAbstractionStarter]: For program point L632(lines 632 870) no Hoare annotation was computed. [2018-12-30 23:21:03,910 INFO L448 ceAbstractionStarter]: For program point L500(lines 500 870) no Hoare annotation was computed. [2018-12-30 23:21:03,910 INFO L448 ceAbstractionStarter]: For program point L831(lines 831 870) no Hoare annotation was computed. [2018-12-30 23:21:03,910 INFO L448 ceAbstractionStarter]: For program point L171-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:21:03,910 INFO L448 ceAbstractionStarter]: For program point L105-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:21:03,911 INFO L448 ceAbstractionStarter]: For program point L39-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:21:03,911 INFO L448 ceAbstractionStarter]: For program point L700(lines 700 870) no Hoare annotation was computed. [2018-12-30 23:21:03,911 INFO L448 ceAbstractionStarter]: For program point L568(lines 568 870) no Hoare annotation was computed. [2018-12-30 23:21:03,911 INFO L448 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2018-12-30 23:21:03,911 INFO L448 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2018-12-30 23:21:03,911 INFO L448 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2018-12-30 23:21:03,911 INFO L448 ceAbstractionStarter]: For program point L305(lines 305 870) no Hoare annotation was computed. [2018-12-30 23:21:03,911 INFO L448 ceAbstractionStarter]: For program point L438(lines 438 870) no Hoare annotation was computed. [2018-12-30 23:21:03,911 INFO L448 ceAbstractionStarter]: For program point L372(lines 372 870) no Hoare annotation was computed. [2018-12-30 23:21:03,911 INFO L448 ceAbstractionStarter]: For program point L174-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:21:03,911 INFO L448 ceAbstractionStarter]: For program point L108-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:21:03,911 INFO L448 ceAbstractionStarter]: For program point L42-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:21:03,912 INFO L448 ceAbstractionStarter]: For program point L241(lines 241 870) no Hoare annotation was computed. [2018-12-30 23:21:03,912 INFO L448 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2018-12-30 23:21:03,912 INFO L448 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2018-12-30 23:21:03,912 INFO L448 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2018-12-30 23:21:03,912 INFO L448 ceAbstractionStarter]: For program point L638(lines 638 870) no Hoare annotation was computed. [2018-12-30 23:21:03,912 INFO L448 ceAbstractionStarter]: For program point L506(lines 506 870) no Hoare annotation was computed. [2018-12-30 23:21:03,912 INFO L448 ceAbstractionStarter]: For program point L837(lines 837 870) no Hoare annotation was computed. [2018-12-30 23:21:03,912 INFO L448 ceAbstractionStarter]: For program point L771(lines 771 870) no Hoare annotation was computed. [2018-12-30 23:21:03,912 INFO L448 ceAbstractionStarter]: For program point L573(lines 573 870) no Hoare annotation was computed. [2018-12-30 23:21:03,912 INFO L448 ceAbstractionStarter]: For program point L177-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:21:03,912 INFO L448 ceAbstractionStarter]: For program point L111-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:21:03,912 INFO L448 ceAbstractionStarter]: For program point L45-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:21:03,912 INFO L448 ceAbstractionStarter]: For program point L706(lines 706 870) no Hoare annotation was computed. [2018-12-30 23:21:03,913 INFO L448 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2018-12-30 23:21:03,913 INFO L448 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2018-12-30 23:21:03,913 INFO L448 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2018-12-30 23:21:03,913 INFO L448 ceAbstractionStarter]: For program point L311(lines 311 870) no Hoare annotation was computed. [2018-12-30 23:21:03,913 INFO L448 ceAbstractionStarter]: For program point L444(lines 444 870) no Hoare annotation was computed. [2018-12-30 23:21:03,913 INFO L448 ceAbstractionStarter]: For program point L378(lines 378 870) no Hoare annotation was computed. [2018-12-30 23:21:03,913 INFO L448 ceAbstractionStarter]: For program point L180-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:21:03,913 INFO L448 ceAbstractionStarter]: For program point L114-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:21:03,913 INFO L448 ceAbstractionStarter]: For program point L48-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:21:03,913 INFO L448 ceAbstractionStarter]: For program point L247(lines 247 870) no Hoare annotation was computed. [2018-12-30 23:21:03,913 INFO L448 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2018-12-30 23:21:03,913 INFO L448 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2018-12-30 23:21:03,914 INFO L448 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2018-12-30 23:21:03,914 INFO L448 ceAbstractionStarter]: For program point L842(lines 842 870) no Hoare annotation was computed. [2018-12-30 23:21:03,914 INFO L448 ceAbstractionStarter]: For program point L644(lines 644 870) no Hoare annotation was computed. [2018-12-30 23:21:03,914 INFO L448 ceAbstractionStarter]: For program point L512(lines 512 870) no Hoare annotation was computed. [2018-12-30 23:21:03,914 INFO L448 ceAbstractionStarter]: For program point L777(lines 777 870) no Hoare annotation was computed. [2018-12-30 23:21:03,914 INFO L448 ceAbstractionStarter]: For program point L579(lines 579 870) no Hoare annotation was computed. [2018-12-30 23:21:03,914 INFO L448 ceAbstractionStarter]: For program point L183-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:21:03,914 INFO L448 ceAbstractionStarter]: For program point L117-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:21:03,914 INFO L448 ceAbstractionStarter]: For program point L51-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:21:03,914 INFO L448 ceAbstractionStarter]: For program point L712(lines 712 870) no Hoare annotation was computed. [2018-12-30 23:21:03,914 INFO L448 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2018-12-30 23:21:03,914 INFO L448 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2018-12-30 23:21:03,915 INFO L448 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2018-12-30 23:21:03,915 INFO L448 ceAbstractionStarter]: For program point L449(lines 449 870) no Hoare annotation was computed. [2018-12-30 23:21:03,915 INFO L448 ceAbstractionStarter]: For program point L317(lines 317 870) no Hoare annotation was computed. [2018-12-30 23:21:03,915 INFO L448 ceAbstractionStarter]: For program point L384(lines 384 870) no Hoare annotation was computed. [2018-12-30 23:21:03,915 INFO L448 ceAbstractionStarter]: For program point L252(lines 252 870) no Hoare annotation was computed. [2018-12-30 23:21:03,915 INFO L448 ceAbstractionStarter]: For program point L186-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:21:03,915 INFO L448 ceAbstractionStarter]: For program point L120-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:21:03,915 INFO L448 ceAbstractionStarter]: For program point L54-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:21:03,915 INFO L448 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2018-12-30 23:21:03,915 INFO L448 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2018-12-30 23:21:03,915 INFO L448 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2018-12-30 23:21:03,915 INFO L448 ceAbstractionStarter]: For program point L848(lines 848 870) no Hoare annotation was computed. [2018-12-30 23:21:03,915 INFO L448 ceAbstractionStarter]: For program point L650(lines 650 870) no Hoare annotation was computed. [2018-12-30 23:21:03,916 INFO L448 ceAbstractionStarter]: For program point L518(lines 518 870) no Hoare annotation was computed. [2018-12-30 23:21:03,916 INFO L448 ceAbstractionStarter]: For program point L783(lines 783 870) no Hoare annotation was computed. [2018-12-30 23:21:03,916 INFO L448 ceAbstractionStarter]: For program point L585(lines 585 870) no Hoare annotation was computed. [2018-12-30 23:21:03,916 INFO L448 ceAbstractionStarter]: For program point L189-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:21:03,916 INFO L448 ceAbstractionStarter]: For program point L123-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:21:03,916 INFO L448 ceAbstractionStarter]: For program point L57-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:21:03,916 INFO L448 ceAbstractionStarter]: For program point L718(lines 718 870) no Hoare annotation was computed. [2018-12-30 23:21:03,916 INFO L448 ceAbstractionStarter]: For program point L454(lines 454 870) no Hoare annotation was computed. [2018-12-30 23:21:03,916 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-30 23:21:03,916 INFO L448 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2018-12-30 23:21:03,916 INFO L448 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2018-12-30 23:21:03,916 INFO L448 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2018-12-30 23:21:03,917 INFO L448 ceAbstractionStarter]: For program point L323(lines 323 870) no Hoare annotation was computed. [2018-12-30 23:21:03,917 INFO L448 ceAbstractionStarter]: For program point L390(lines 390 870) no Hoare annotation was computed. [2018-12-30 23:21:03,917 INFO L448 ceAbstractionStarter]: For program point L258(lines 258 870) no Hoare annotation was computed. [2018-12-30 23:21:03,917 INFO L448 ceAbstractionStarter]: For program point L192-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:21:03,917 INFO L448 ceAbstractionStarter]: For program point L126-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:21:03,917 INFO L448 ceAbstractionStarter]: For program point L60-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:21:03,917 INFO L448 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2018-12-30 23:21:03,917 INFO L448 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2018-12-30 23:21:03,917 INFO L448 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2018-12-30 23:21:03,917 INFO L448 ceAbstractionStarter]: For program point L854(lines 854 870) no Hoare annotation was computed. [2018-12-30 23:21:03,917 INFO L448 ceAbstractionStarter]: For program point L656(lines 656 870) no Hoare annotation was computed. [2018-12-30 23:21:03,917 INFO L448 ceAbstractionStarter]: For program point L524(lines 524 870) no Hoare annotation was computed. [2018-12-30 23:21:03,918 INFO L448 ceAbstractionStarter]: For program point L789(lines 789 870) no Hoare annotation was computed. [2018-12-30 23:21:03,923 INFO L448 ceAbstractionStarter]: For program point L591(lines 591 870) no Hoare annotation was computed. [2018-12-30 23:21:03,923 INFO L448 ceAbstractionStarter]: For program point L195-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:21:03,923 INFO L448 ceAbstractionStarter]: For program point L129-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:21:03,923 INFO L448 ceAbstractionStarter]: For program point L63-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:21:03,923 INFO L448 ceAbstractionStarter]: For program point L724(lines 724 870) no Hoare annotation was computed. [2018-12-30 23:21:03,923 INFO L448 ceAbstractionStarter]: For program point L460(lines 460 870) no Hoare annotation was computed. [2018-12-30 23:21:03,923 INFO L448 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2018-12-30 23:21:03,923 INFO L448 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2018-12-30 23:21:03,923 INFO L448 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2018-12-30 23:21:03,924 INFO L448 ceAbstractionStarter]: For program point L329(lines 329 870) no Hoare annotation was computed. [2018-12-30 23:21:03,924 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2018-12-30 23:21:03,924 INFO L448 ceAbstractionStarter]: For program point L396(lines 396 870) no Hoare annotation was computed. [2018-12-30 23:21:03,924 INFO L448 ceAbstractionStarter]: For program point L264(lines 264 870) no Hoare annotation was computed. [2018-12-30 23:21:03,924 INFO L448 ceAbstractionStarter]: For program point L198-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:21:03,924 INFO L448 ceAbstractionStarter]: For program point L132-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:21:03,924 INFO L448 ceAbstractionStarter]: For program point L66-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:21:03,924 INFO L448 ceAbstractionStarter]: For program point L859(lines 859 870) no Hoare annotation was computed. [2018-12-30 23:21:03,924 INFO L448 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2018-12-30 23:21:03,924 INFO L448 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2018-12-30 23:21:03,924 INFO L448 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2018-12-30 23:21:03,924 INFO L448 ceAbstractionStarter]: For program point L662(lines 662 870) no Hoare annotation was computed. [2018-12-30 23:21:03,924 INFO L448 ceAbstractionStarter]: For program point L530(lines 530 870) no Hoare annotation was computed. [2018-12-30 23:21:03,928 INFO L448 ceAbstractionStarter]: For program point L795(lines 795 870) no Hoare annotation was computed. [2018-12-30 23:21:03,928 INFO L448 ceAbstractionStarter]: For program point L597(lines 597 870) no Hoare annotation was computed. [2018-12-30 23:21:03,928 INFO L448 ceAbstractionStarter]: For program point L201-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:21:03,928 INFO L448 ceAbstractionStarter]: For program point L135-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:21:03,928 INFO L448 ceAbstractionStarter]: For program point L69-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:21:03,928 INFO L448 ceAbstractionStarter]: For program point L730(lines 730 870) no Hoare annotation was computed. [2018-12-30 23:21:03,928 INFO L448 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2018-12-30 23:21:03,928 INFO L448 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2018-12-30 23:21:03,928 INFO L448 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2018-12-30 23:21:03,928 INFO L448 ceAbstractionStarter]: For program point L467(lines 467 870) no Hoare annotation was computed. [2018-12-30 23:21:03,929 INFO L448 ceAbstractionStarter]: For program point L335(lines 335 870) no Hoare annotation was computed. [2018-12-30 23:21:03,929 INFO L448 ceAbstractionStarter]: For program point L269(lines 269 870) no Hoare annotation was computed. [2018-12-30 23:21:03,929 INFO L448 ceAbstractionStarter]: For program point L402(lines 402 870) no Hoare annotation was computed. [2018-12-30 23:21:03,929 INFO L448 ceAbstractionStarter]: For program point L138-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:21:03,929 INFO L448 ceAbstractionStarter]: For program point L72-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:21:03,929 INFO L448 ceAbstractionStarter]: For program point L865(lines 865 870) no Hoare annotation was computed. [2018-12-30 23:21:03,929 INFO L448 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2018-12-30 23:21:03,929 INFO L448 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2018-12-30 23:21:03,929 INFO L448 ceAbstractionStarter]: For program point L668(lines 668 870) no Hoare annotation was computed. [2018-12-30 23:21:03,929 INFO L448 ceAbstractionStarter]: For program point L536(lines 536 870) no Hoare annotation was computed. [2018-12-30 23:21:03,929 INFO L448 ceAbstractionStarter]: For program point L801(lines 801 870) no Hoare annotation was computed. [2018-12-30 23:21:03,929 INFO L448 ceAbstractionStarter]: For program point L735(lines 735 870) no Hoare annotation was computed. [2018-12-30 23:21:03,930 INFO L448 ceAbstractionStarter]: For program point L603(lines 603 870) no Hoare annotation was computed. [2018-12-30 23:21:03,932 INFO L448 ceAbstractionStarter]: For program point L141-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:21:03,932 INFO L448 ceAbstractionStarter]: For program point L75-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:21:03,932 INFO L448 ceAbstractionStarter]: For program point L472(lines 472 870) no Hoare annotation was computed. [2018-12-30 23:21:03,932 INFO L448 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2018-12-30 23:21:03,932 INFO L448 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2018-12-30 23:21:03,932 INFO L448 ceAbstractionStarter]: For program point L341(lines 341 870) no Hoare annotation was computed. [2018-12-30 23:21:03,932 INFO L448 ceAbstractionStarter]: For program point L275(lines 275 870) no Hoare annotation was computed. [2018-12-30 23:21:03,932 INFO L448 ceAbstractionStarter]: For program point L408(lines 408 870) no Hoare annotation was computed. [2018-12-30 23:21:03,932 INFO L448 ceAbstractionStarter]: For program point L144-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:21:03,932 INFO L448 ceAbstractionStarter]: For program point L78-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:21:03,933 INFO L444 ceAbstractionStarter]: At program point L871(lines 20 872) the Hoare annotation is: (let ((.cse13 (= ~a15~0 8)) (.cse3 (= ~a24~0 1)) (.cse31 (not (= 8 ~a21~0))) (.cse21 (= ~a21~0 10)) (.cse10 (= ~a15~0 5)) (.cse1 (<= ~a12~0 11)) (.cse23 (<= ~a15~0 8))) (let ((.cse15 (<= (+ ~a12~0 49) 0)) (.cse35 (+ ~a12~0 43)) (.cse34 (and (not .cse10) .cse1 .cse23)) (.cse11 (<= ~a12~0 80)) (.cse12 (< 11 ~a12~0)) (.cse22 (let ((.cse38 (not .cse21))) (or (and .cse13 .cse38) (and .cse3 .cse31 .cse23 .cse38)))) (.cse14 (= ~a21~0 7))) (let ((.cse6 (<= (+ ~a12~0 3) 0)) (.cse8 (<= 19 ~a12~0)) (.cse24 (<= 17760 ~a12~0)) (.cse30 (exists ((v_prenex_15 Int)) (let ((.cse36 (div (+ v_prenex_15 (- 600066)) 5))) (let ((.cse37 (+ (* 34 .cse36) 34))) (and (not (= (mod (+ v_prenex_15 4) 5) 0)) (<= v_prenex_15 599999) (not (= 0 (mod (+ (* 4 .cse36) 4) 10))) (< .cse37 0) (< v_prenex_15 600066) (<= ~a12~0 (+ (div .cse37 10) 1))))))) (.cse0 (and .cse3 .cse14 .cse23)) (.cse16 (and .cse3 .cse21 .cse23)) (.cse28 (and .cse11 (or .cse12 .cse13) .cse3 .cse22)) (.cse7 (<= ~a12~0 586307)) (.cse26 (or (and .cse23 .cse15) (and (<= .cse35 0) .cse34))) (.cse19 (<= ~a12~0 599999)) (.cse2 (< 0 .cse35)) (.cse18 (= ~a21~0 9)) (.cse29 (and .cse34 .cse3 .cse31)) (.cse27 (<= ~a21~0 6)) (.cse20 (exists ((v_~a12~0_438 Int)) (let ((.cse33 (div (+ v_~a12~0_438 (- 600066)) 5))) (let ((.cse32 (+ (* 34 .cse33) 34))) (and (<= v_~a12~0_438 586307) (< .cse32 0) (< v_~a12~0_438 600066) (<= ~a12~0 (+ (div .cse32 10) 1)) (not (= 0 (mod (+ (* 4 .cse33) 4) 10))) (not (= (mod (+ v_~a12~0_438 4) 5) 0))))))) (.cse25 (not .cse13)) (.cse4 (= ~a21~0 8)) (.cse5 (= ~a15~0 9)) (.cse9 (= ~a21~0 6)) (.cse17 (< 80 ~a12~0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse5 .cse6 .cse2) (and .cse3 .cse7 .cse4 .cse5 .cse8) (and .cse9 .cse3 .cse10) (and .cse11 .cse12 .cse3 .cse10) (and .cse13 .cse3 .cse14 .cse15) (and .cse16 .cse1 .cse2) (and .cse16 .cse17) (and (and .cse3 .cse18 .cse5) .cse19 .cse17) (and .cse20 .cse3 .cse5 .cse21) (and .cse3 .cse21 .cse5 .cse6 .cse2) (and (or (and .cse22 .cse17) (and .cse3 .cse23 .cse24)) .cse25) (and .cse11 .cse12 .cse3 (= ~a15~0 6)) (and .cse26 .cse3 .cse27) (and .cse28 .cse8) (and .cse25 .cse29) (and (or (and .cse3 .cse14 .cse5) (and .cse3 .cse4 .cse5)) .cse19 .cse17) (and .cse21 .cse13 .cse3 .cse30) (and (<= ~a12~0 73282) .cse3 .cse22 .cse4 .cse24) (and (= ~a15~0 7) .cse3 .cse30) (and .cse0 .cse25) (and .cse16 .cse25) (and .cse28 .cse25) (and .cse9 (<= 95381 ~a12~0) .cse3 .cse7 .cse5) (and (and .cse26 .cse3 .cse31) .cse25) (and (and .cse21 .cse3 .cse5) .cse19 .cse17) (and (not (= ULTIMATE.start_calculate_output_~input 5)) .cse2 .cse18 .cse29) (and (and .cse23 .cse27) .cse20 .cse25) (and .cse3 .cse4 (<= (+ ~a12~0 526767) 0) .cse5) (and .cse9 .cse3 .cse17 .cse13))))) [2018-12-30 23:21:03,933 INFO L448 ceAbstractionStarter]: For program point L541(lines 541 870) no Hoare annotation was computed. [2018-12-30 23:21:03,933 INFO L448 ceAbstractionStarter]: For program point L211(lines 211 870) no Hoare annotation was computed. [2018-12-30 23:21:03,934 INFO L448 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2018-12-30 23:21:03,934 INFO L448 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2018-12-30 23:21:03,934 INFO L448 ceAbstractionStarter]: For program point L674(lines 674 870) no Hoare annotation was computed. [2018-12-30 23:21:03,934 INFO L448 ceAbstractionStarter]: For program point L807(lines 807 870) no Hoare annotation was computed. [2018-12-30 23:21:03,934 INFO L448 ceAbstractionStarter]: For program point L741(lines 741 870) no Hoare annotation was computed. [2018-12-30 23:21:03,934 INFO L448 ceAbstractionStarter]: For program point L609(lines 609 870) no Hoare annotation was computed. [2018-12-30 23:21:03,934 INFO L448 ceAbstractionStarter]: For program point L147-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:21:03,934 INFO L448 ceAbstractionStarter]: For program point L81-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:21:03,934 INFO L451 ceAbstractionStarter]: At program point L874(lines 874 890) the Hoare annotation is: true [2018-12-30 23:21:03,934 INFO L448 ceAbstractionStarter]: For program point L478(lines 478 870) no Hoare annotation was computed. [2018-12-30 23:21:03,934 INFO L448 ceAbstractionStarter]: For program point L280(lines 280 870) no Hoare annotation was computed. [2018-12-30 23:21:03,934 INFO L448 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2018-12-30 23:21:03,935 INFO L448 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2018-12-30 23:21:03,937 INFO L448 ceAbstractionStarter]: For program point L677(lines 677 870) no Hoare annotation was computed. [2018-12-30 23:21:03,937 INFO L448 ceAbstractionStarter]: For program point L347(lines 347 870) no Hoare annotation was computed. [2018-12-30 23:21:03,938 INFO L448 ceAbstractionStarter]: For program point L414(lines 414 870) no Hoare annotation was computed. [2018-12-30 23:21:03,938 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 109) no Hoare annotation was computed. [2018-12-30 23:21:03,938 INFO L448 ceAbstractionStarter]: For program point L150-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:21:03,938 INFO L448 ceAbstractionStarter]: For program point L84-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:21:03,938 INFO L448 ceAbstractionStarter]: For program point L547(lines 547 870) no Hoare annotation was computed. [2018-12-30 23:21:03,938 INFO L448 ceAbstractionStarter]: For program point L217(lines 217 870) no Hoare annotation was computed. [2018-12-30 23:21:03,938 INFO L448 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2018-12-30 23:21:03,938 INFO L448 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2018-12-30 23:21:03,938 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2018-12-30 23:21:03,938 INFO L448 ceAbstractionStarter]: For program point L747(lines 747 870) no Hoare annotation was computed. [2018-12-30 23:21:03,938 INFO L448 ceAbstractionStarter]: For program point L615(lines 615 870) no Hoare annotation was computed. [2018-12-30 23:21:03,939 INFO L448 ceAbstractionStarter]: For program point L153-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:21:03,939 INFO L448 ceAbstractionStarter]: For program point L87-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:21:03,939 INFO L448 ceAbstractionStarter]: For program point L21(lines 21 23) no Hoare annotation was computed. [2018-12-30 23:21:03,939 INFO L448 ceAbstractionStarter]: For program point L21-2(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:21:03,939 INFO L448 ceAbstractionStarter]: For program point L814(lines 814 870) no Hoare annotation was computed. [2018-12-30 23:21:03,940 INFO L444 ceAbstractionStarter]: At program point L880-2(lines 880 889) the Hoare annotation is: (let ((.cse17 (= ~a15~0 8)) (.cse3 (= ~a24~0 1)) (.cse31 (not (= 8 ~a21~0))) (.cse21 (= ~a21~0 10)) (.cse10 (= ~a15~0 5)) (.cse1 (<= ~a12~0 11)) (.cse23 (<= ~a15~0 8))) (let ((.cse19 (<= (+ ~a12~0 49) 0)) (.cse35 (+ ~a12~0 43)) (.cse34 (and (not .cse10) .cse1 .cse23)) (.cse11 (<= ~a12~0 80)) (.cse12 (< 11 ~a12~0)) (.cse22 (let ((.cse38 (not .cse21))) (or (and .cse17 .cse38) (and .cse3 .cse31 .cse23 .cse38)))) (.cse18 (= ~a21~0 7))) (let ((.cse6 (<= (+ ~a12~0 3) 0)) (.cse8 (<= 19 ~a12~0)) (.cse24 (<= 17760 ~a12~0)) (.cse30 (exists ((v_prenex_15 Int)) (let ((.cse36 (div (+ v_prenex_15 (- 600066)) 5))) (let ((.cse37 (+ (* 34 .cse36) 34))) (and (not (= (mod (+ v_prenex_15 4) 5) 0)) (<= v_prenex_15 599999) (not (= 0 (mod (+ (* 4 .cse36) 4) 10))) (< .cse37 0) (< v_prenex_15 600066) (<= ~a12~0 (+ (div .cse37 10) 1))))))) (.cse0 (and .cse3 .cse18 .cse23)) (.cse13 (and .cse3 .cse21 .cse23)) (.cse28 (and .cse11 (or .cse12 .cse17) .cse3 .cse22)) (.cse7 (<= ~a12~0 586307)) (.cse26 (or (and .cse23 .cse19) (and (<= .cse35 0) .cse34))) (.cse16 (<= ~a12~0 599999)) (.cse2 (< 0 .cse35)) (.cse15 (= ~a21~0 9)) (.cse29 (and .cse34 .cse3 .cse31)) (.cse27 (<= ~a21~0 6)) (.cse20 (exists ((v_~a12~0_438 Int)) (let ((.cse33 (div (+ v_~a12~0_438 (- 600066)) 5))) (let ((.cse32 (+ (* 34 .cse33) 34))) (and (<= v_~a12~0_438 586307) (< .cse32 0) (< v_~a12~0_438 600066) (<= ~a12~0 (+ (div .cse32 10) 1)) (not (= 0 (mod (+ (* 4 .cse33) 4) 10))) (not (= (mod (+ v_~a12~0_438 4) 5) 0))))))) (.cse25 (not .cse17)) (.cse4 (= ~a21~0 8)) (.cse5 (= ~a15~0 9)) (.cse9 (= ~a21~0 6)) (.cse14 (< 80 ~a12~0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse5 .cse6 .cse2) (and .cse3 .cse7 .cse4 .cse5 .cse8) (and .cse9 .cse3 .cse10) (and .cse11 .cse12 .cse3 .cse10) (and .cse13 .cse1 .cse2) (and .cse13 .cse14) (and (and .cse3 .cse15 .cse5) .cse16 .cse14) (and .cse17 .cse3 .cse18 .cse19) (and .cse20 .cse3 .cse5 .cse21) (and .cse3 .cse21 .cse5 .cse6 .cse2) (and (or (and .cse22 .cse14) (and .cse3 .cse23 .cse24)) .cse25) (and .cse11 .cse12 .cse3 (= ~a15~0 6)) (and .cse26 .cse3 .cse27) (and .cse28 .cse8) (and .cse25 .cse29) (and (or (and .cse3 .cse18 .cse5) (and .cse3 .cse4 .cse5)) .cse16 .cse14) (and .cse21 .cse17 .cse3 .cse30) (and (<= ~a12~0 73282) .cse3 .cse22 .cse4 .cse24) (and (= ~a15~0 7) .cse3 .cse30) (and .cse0 .cse25) (and .cse13 .cse25) (and .cse28 .cse25) (and .cse9 (<= 95381 ~a12~0) .cse3 .cse7 .cse5) (and (and .cse26 .cse3 .cse31) .cse25) (and (and .cse21 .cse3 .cse5) .cse16 .cse14) (and (not (= ULTIMATE.start_calculate_output_~input 5)) .cse2 .cse15 .cse29) (and (and .cse23 .cse27) .cse20 .cse25) (and .cse3 .cse4 (<= (+ ~a12~0 526767) 0) .cse5) (and .cse9 .cse3 .cse14 .cse17))))) [2018-12-30 23:21:03,940 INFO L448 ceAbstractionStarter]: For program point L484(lines 484 870) no Hoare annotation was computed. [2018-12-30 23:21:03,940 INFO L448 ceAbstractionStarter]: For program point L286(lines 286 870) no Hoare annotation was computed. [2018-12-30 23:21:03,940 INFO L448 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2018-12-30 23:21:03,940 INFO L448 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2018-12-30 23:21:03,940 INFO L448 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2018-12-30 23:21:03,940 INFO L448 ceAbstractionStarter]: For program point L683(lines 683 870) no Hoare annotation was computed. [2018-12-30 23:21:03,940 INFO L448 ceAbstractionStarter]: For program point L353(lines 353 870) no Hoare annotation was computed. [2018-12-30 23:21:03,940 INFO L448 ceAbstractionStarter]: For program point L552(lines 552 870) no Hoare annotation was computed. [2018-12-30 23:21:03,940 INFO L448 ceAbstractionStarter]: For program point L420(lines 420 870) no Hoare annotation was computed. [2018-12-30 23:21:03,940 INFO L448 ceAbstractionStarter]: For program point L156-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:21:03,940 INFO L448 ceAbstractionStarter]: For program point L90-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:21:03,941 INFO L448 ceAbstractionStarter]: For program point L24-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:21:03,941 INFO L448 ceAbstractionStarter]: For program point L223(lines 223 870) no Hoare annotation was computed. [2018-12-30 23:21:03,941 INFO L448 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2018-12-30 23:21:03,941 INFO L448 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2018-12-30 23:21:03,941 INFO L448 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2018-12-30 23:21:03,941 INFO L448 ceAbstractionStarter]: For program point L752(lines 752 870) no Hoare annotation was computed. [2018-12-30 23:21:03,941 INFO L448 ceAbstractionStarter]: For program point L885(line 885) no Hoare annotation was computed. [2018-12-30 23:21:03,941 INFO L448 ceAbstractionStarter]: For program point L819(lines 819 870) no Hoare annotation was computed. [2018-12-30 23:21:03,941 INFO L448 ceAbstractionStarter]: For program point L621(lines 621 870) no Hoare annotation was computed. [2018-12-30 23:21:03,941 INFO L448 ceAbstractionStarter]: For program point L555(lines 555 870) no Hoare annotation was computed. [2018-12-30 23:21:03,941 INFO L448 ceAbstractionStarter]: For program point L159-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:21:03,941 INFO L448 ceAbstractionStarter]: For program point L93-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:21:03,942 INFO L448 ceAbstractionStarter]: For program point L27-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:21:03,942 INFO L448 ceAbstractionStarter]: For program point L688(lines 688 870) no Hoare annotation was computed. [2018-12-30 23:21:03,942 INFO L448 ceAbstractionStarter]: For program point L490(lines 490 870) no Hoare annotation was computed. [2018-12-30 23:21:03,942 INFO L448 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2018-12-30 23:21:03,942 INFO L448 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2018-12-30 23:21:03,942 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-30 23:21:03,943 INFO L448 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2018-12-30 23:21:03,943 INFO L448 ceAbstractionStarter]: For program point L359(lines 359 870) no Hoare annotation was computed. [2018-12-30 23:21:03,943 INFO L448 ceAbstractionStarter]: For program point L293(lines 293 870) no Hoare annotation was computed. [2018-12-30 23:21:03,943 INFO L448 ceAbstractionStarter]: For program point L426(lines 426 870) no Hoare annotation was computed. [2018-12-30 23:21:03,943 INFO L448 ceAbstractionStarter]: For program point L162-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:21:03,943 INFO L448 ceAbstractionStarter]: For program point L96-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:21:03,943 INFO L448 ceAbstractionStarter]: For program point L30-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:21:03,943 INFO L448 ceAbstractionStarter]: For program point L229(lines 229 870) no Hoare annotation was computed. [2018-12-30 23:21:03,943 INFO L448 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2018-12-30 23:21:03,943 INFO L448 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2018-12-30 23:21:03,943 INFO L448 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2018-12-30 23:21:03,943 INFO L448 ceAbstractionStarter]: For program point L758(lines 758 870) no Hoare annotation was computed. [2018-12-30 23:21:03,944 INFO L448 ceAbstractionStarter]: For program point L626(lines 626 870) no Hoare annotation was computed. [2018-12-30 23:21:03,944 INFO L448 ceAbstractionStarter]: For program point L825(lines 825 870) no Hoare annotation was computed. [2018-12-30 23:21:03,944 INFO L448 ceAbstractionStarter]: For program point L561(lines 561 870) no Hoare annotation was computed. [2018-12-30 23:21:03,944 INFO L448 ceAbstractionStarter]: For program point L495(lines 495 870) no Hoare annotation was computed. [2018-12-30 23:21:03,945 INFO L448 ceAbstractionStarter]: For program point L165-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:21:03,945 INFO L448 ceAbstractionStarter]: For program point L99-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:21:03,945 INFO L448 ceAbstractionStarter]: For program point L33-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:21:03,945 INFO L448 ceAbstractionStarter]: For program point L694(lines 694 870) no Hoare annotation was computed. [2018-12-30 23:21:03,945 INFO L448 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2018-12-30 23:21:03,945 INFO L448 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2018-12-30 23:21:03,945 INFO L448 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2018-12-30 23:21:03,945 INFO L448 ceAbstractionStarter]: For program point L299(lines 299 870) no Hoare annotation was computed. [2018-12-30 23:21:03,972 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2018-12-30 23:21:03,979 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2018-12-30 23:21:03,979 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2018-12-30 23:21:03,979 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2018-12-30 23:21:03,980 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2018-12-30 23:21:03,980 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2018-12-30 23:21:03,986 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2018-12-30 23:21:03,987 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2018-12-30 23:21:03,987 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2018-12-30 23:21:03,987 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2018-12-30 23:21:03,987 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2018-12-30 23:21:03,989 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2018-12-30 23:21:03,990 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2018-12-30 23:21:03,990 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2018-12-30 23:21:03,990 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2018-12-30 23:21:03,990 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2018-12-30 23:21:03,991 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2018-12-30 23:21:03,991 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2018-12-30 23:21:03,992 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2018-12-30 23:21:03,993 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2018-12-30 23:21:03,993 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2018-12-30 23:21:03,993 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2018-12-30 23:21:03,993 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2018-12-30 23:21:03,993 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2018-12-30 23:21:04,011 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2018-12-30 23:21:04,015 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2018-12-30 23:21:04,015 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2018-12-30 23:21:04,015 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2018-12-30 23:21:04,016 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2018-12-30 23:21:04,016 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2018-12-30 23:21:04,017 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2018-12-30 23:21:04,017 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2018-12-30 23:21:04,017 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2018-12-30 23:21:04,017 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2018-12-30 23:21:04,018 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2018-12-30 23:21:04,018 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2018-12-30 23:21:04,018 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2018-12-30 23:21:04,018 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2018-12-30 23:21:04,019 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2018-12-30 23:21:04,019 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2018-12-30 23:21:04,019 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2018-12-30 23:21:04,019 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2018-12-30 23:21:04,021 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2018-12-30 23:21:04,022 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2018-12-30 23:21:04,022 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2018-12-30 23:21:04,022 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2018-12-30 23:21:04,022 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2018-12-30 23:21:04,023 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2018-12-30 23:21:04,031 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2018-12-30 23:21:04,032 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2018-12-30 23:21:04,032 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2018-12-30 23:21:04,032 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2018-12-30 23:21:04,033 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2018-12-30 23:21:04,033 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2018-12-30 23:21:04,033 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2018-12-30 23:21:04,039 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2018-12-30 23:21:04,039 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2018-12-30 23:21:04,039 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2018-12-30 23:21:04,040 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2018-12-30 23:21:04,040 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2018-12-30 23:21:04,040 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2018-12-30 23:21:04,041 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2018-12-30 23:21:04,041 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2018-12-30 23:21:04,041 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2018-12-30 23:21:04,041 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2018-12-30 23:21:04,042 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2018-12-30 23:21:04,042 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2018-12-30 23:21:04,042 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2018-12-30 23:21:04,042 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2018-12-30 23:21:04,045 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2018-12-30 23:21:04,045 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2018-12-30 23:21:04,045 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2018-12-30 23:21:04,053 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2018-12-30 23:21:04,053 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2018-12-30 23:21:04,053 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2018-12-30 23:21:04,054 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2018-12-30 23:21:04,054 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2018-12-30 23:21:04,054 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2018-12-30 23:21:04,055 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2018-12-30 23:21:04,055 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2018-12-30 23:21:04,055 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2018-12-30 23:21:04,056 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2018-12-30 23:21:04,058 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2018-12-30 23:21:04,058 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2018-12-30 23:21:04,058 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2018-12-30 23:21:04,059 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2018-12-30 23:21:04,059 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2018-12-30 23:21:04,059 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2018-12-30 23:21:04,059 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2018-12-30 23:21:04,060 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2018-12-30 23:21:04,060 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2018-12-30 23:21:04,060 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2018-12-30 23:21:04,060 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2018-12-30 23:21:04,061 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2018-12-30 23:21:04,062 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2018-12-30 23:21:04,062 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2018-12-30 23:21:04,066 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.12 11:21:04 BoogieIcfgContainer [2018-12-30 23:21:04,067 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-30 23:21:04,067 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-30 23:21:04,067 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-30 23:21:04,067 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-30 23:21:04,068 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:07" (3/4) ... [2018-12-30 23:21:04,072 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-30 23:21:04,101 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2018-12-30 23:21:04,103 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-12-30 23:21:04,147 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((a24 == 1 && a21 == 7) && a15 <= 8) && a12 <= 11) && 0 < a12 + 43) || ((((a24 == 1 && a21 == 8) && a15 == 9) && a12 + 3 <= 0) && 0 < a12 + 43)) || ((((a24 == 1 && a12 <= 586307) && a21 == 8) && a15 == 9) && 19 <= a12)) || ((a21 == 6 && a24 == 1) && a15 == 5)) || (((a12 <= 80 && 11 < a12) && a24 == 1) && a15 == 5)) || ((((a24 == 1 && a21 == 10) && a15 <= 8) && a12 <= 11) && 0 < a12 + 43)) || (((a24 == 1 && a21 == 10) && a15 <= 8) && 80 < a12)) || ((((a24 == 1 && a21 == 9) && a15 == 9) && a12 <= 599999) && 80 < a12)) || (((a15 == 8 && a24 == 1) && a21 == 7) && a12 + 49 <= 0)) || ((((\exists v_~a12~0_438 : int :: ((((v_~a12~0_438 <= 586307 && 34 * ((v_~a12~0_438 + -600066) / 5) + 34 < 0) && v_~a12~0_438 < 600066) && a12 <= (34 * ((v_~a12~0_438 + -600066) / 5) + 34) / 10 + 1) && !(0 == (4 * ((v_~a12~0_438 + -600066) / 5) + 4) % 10)) && !((v_~a12~0_438 + 4) % 5 == 0)) && a24 == 1) && a15 == 9) && a21 == 10)) || ((((a24 == 1 && a21 == 10) && a15 == 9) && a12 + 3 <= 0) && 0 < a12 + 43)) || (((((a15 == 8 && !(a21 == 10)) || (((a24 == 1 && !(8 == a21)) && a15 <= 8) && !(a21 == 10))) && 80 < a12) || ((a24 == 1 && a15 <= 8) && 17760 <= a12)) && !(a15 == 8))) || (((a12 <= 80 && 11 < a12) && a24 == 1) && a15 == 6)) || ((((a15 <= 8 && a12 + 49 <= 0) || (a12 + 43 <= 0 && (!(a15 == 5) && a12 <= 11) && a15 <= 8)) && a24 == 1) && a21 <= 6)) || ((((a12 <= 80 && (11 < a12 || a15 == 8)) && a24 == 1) && ((a15 == 8 && !(a21 == 10)) || (((a24 == 1 && !(8 == a21)) && a15 <= 8) && !(a21 == 10)))) && 19 <= a12)) || (!(a15 == 8) && (((!(a15 == 5) && a12 <= 11) && a15 <= 8) && a24 == 1) && !(8 == a21))) || (((((a24 == 1 && a21 == 7) && a15 == 9) || ((a24 == 1 && a21 == 8) && a15 == 9)) && a12 <= 599999) && 80 < a12)) || (((a21 == 10 && a15 == 8) && a24 == 1) && (\exists v_prenex_15 : int :: ((((!((v_prenex_15 + 4) % 5 == 0) && v_prenex_15 <= 599999) && !(0 == (4 * ((v_prenex_15 + -600066) / 5) + 4) % 10)) && 34 * ((v_prenex_15 + -600066) / 5) + 34 < 0) && v_prenex_15 < 600066) && a12 <= (34 * ((v_prenex_15 + -600066) / 5) + 34) / 10 + 1))) || ((((a12 <= 73282 && a24 == 1) && ((a15 == 8 && !(a21 == 10)) || (((a24 == 1 && !(8 == a21)) && a15 <= 8) && !(a21 == 10)))) && a21 == 8) && 17760 <= a12)) || ((a15 == 7 && a24 == 1) && (\exists v_prenex_15 : int :: ((((!((v_prenex_15 + 4) % 5 == 0) && v_prenex_15 <= 599999) && !(0 == (4 * ((v_prenex_15 + -600066) / 5) + 4) % 10)) && 34 * ((v_prenex_15 + -600066) / 5) + 34 < 0) && v_prenex_15 < 600066) && a12 <= (34 * ((v_prenex_15 + -600066) / 5) + 34) / 10 + 1))) || (((a24 == 1 && a21 == 7) && a15 <= 8) && !(a15 == 8))) || (((a24 == 1 && a21 == 10) && a15 <= 8) && !(a15 == 8))) || ((((a12 <= 80 && (11 < a12 || a15 == 8)) && a24 == 1) && ((a15 == 8 && !(a21 == 10)) || (((a24 == 1 && !(8 == a21)) && a15 <= 8) && !(a21 == 10)))) && !(a15 == 8))) || ((((a21 == 6 && 95381 <= a12) && a24 == 1) && a12 <= 586307) && a15 == 9)) || (((((a15 <= 8 && a12 + 49 <= 0) || (a12 + 43 <= 0 && (!(a15 == 5) && a12 <= 11) && a15 <= 8)) && a24 == 1) && !(8 == a21)) && !(a15 == 8))) || ((((a21 == 10 && a24 == 1) && a15 == 9) && a12 <= 599999) && 80 < a12)) || (((!(input == 5) && 0 < a12 + 43) && a21 == 9) && (((!(a15 == 5) && a12 <= 11) && a15 <= 8) && a24 == 1) && !(8 == a21))) || (((a15 <= 8 && a21 <= 6) && (\exists v_~a12~0_438 : int :: ((((v_~a12~0_438 <= 586307 && 34 * ((v_~a12~0_438 + -600066) / 5) + 34 < 0) && v_~a12~0_438 < 600066) && a12 <= (34 * ((v_~a12~0_438 + -600066) / 5) + 34) / 10 + 1) && !(0 == (4 * ((v_~a12~0_438 + -600066) / 5) + 4) % 10)) && !((v_~a12~0_438 + 4) % 5 == 0))) && !(a15 == 8))) || (((a24 == 1 && a21 == 8) && a12 + 526767 <= 0) && a15 == 9)) || (((a21 == 6 && a24 == 1) && 80 < a12) && a15 == 8) [2018-12-30 23:21:04,154 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((a24 == 1 && a21 == 7) && a15 <= 8) && a12 <= 11) && 0 < a12 + 43) || ((((a24 == 1 && a21 == 8) && a15 == 9) && a12 + 3 <= 0) && 0 < a12 + 43)) || ((((a24 == 1 && a12 <= 586307) && a21 == 8) && a15 == 9) && 19 <= a12)) || ((a21 == 6 && a24 == 1) && a15 == 5)) || (((a12 <= 80 && 11 < a12) && a24 == 1) && a15 == 5)) || (((a15 == 8 && a24 == 1) && a21 == 7) && a12 + 49 <= 0)) || ((((a24 == 1 && a21 == 10) && a15 <= 8) && a12 <= 11) && 0 < a12 + 43)) || (((a24 == 1 && a21 == 10) && a15 <= 8) && 80 < a12)) || ((((a24 == 1 && a21 == 9) && a15 == 9) && a12 <= 599999) && 80 < a12)) || ((((\exists v_~a12~0_438 : int :: ((((v_~a12~0_438 <= 586307 && 34 * ((v_~a12~0_438 + -600066) / 5) + 34 < 0) && v_~a12~0_438 < 600066) && a12 <= (34 * ((v_~a12~0_438 + -600066) / 5) + 34) / 10 + 1) && !(0 == (4 * ((v_~a12~0_438 + -600066) / 5) + 4) % 10)) && !((v_~a12~0_438 + 4) % 5 == 0)) && a24 == 1) && a15 == 9) && a21 == 10)) || ((((a24 == 1 && a21 == 10) && a15 == 9) && a12 + 3 <= 0) && 0 < a12 + 43)) || (((((a15 == 8 && !(a21 == 10)) || (((a24 == 1 && !(8 == a21)) && a15 <= 8) && !(a21 == 10))) && 80 < a12) || ((a24 == 1 && a15 <= 8) && 17760 <= a12)) && !(a15 == 8))) || (((a12 <= 80 && 11 < a12) && a24 == 1) && a15 == 6)) || ((((a15 <= 8 && a12 + 49 <= 0) || (a12 + 43 <= 0 && (!(a15 == 5) && a12 <= 11) && a15 <= 8)) && a24 == 1) && a21 <= 6)) || ((((a12 <= 80 && (11 < a12 || a15 == 8)) && a24 == 1) && ((a15 == 8 && !(a21 == 10)) || (((a24 == 1 && !(8 == a21)) && a15 <= 8) && !(a21 == 10)))) && 19 <= a12)) || (!(a15 == 8) && (((!(a15 == 5) && a12 <= 11) && a15 <= 8) && a24 == 1) && !(8 == a21))) || (((((a24 == 1 && a21 == 7) && a15 == 9) || ((a24 == 1 && a21 == 8) && a15 == 9)) && a12 <= 599999) && 80 < a12)) || (((a21 == 10 && a15 == 8) && a24 == 1) && (\exists v_prenex_15 : int :: ((((!((v_prenex_15 + 4) % 5 == 0) && v_prenex_15 <= 599999) && !(0 == (4 * ((v_prenex_15 + -600066) / 5) + 4) % 10)) && 34 * ((v_prenex_15 + -600066) / 5) + 34 < 0) && v_prenex_15 < 600066) && a12 <= (34 * ((v_prenex_15 + -600066) / 5) + 34) / 10 + 1))) || ((((a12 <= 73282 && a24 == 1) && ((a15 == 8 && !(a21 == 10)) || (((a24 == 1 && !(8 == a21)) && a15 <= 8) && !(a21 == 10)))) && a21 == 8) && 17760 <= a12)) || ((a15 == 7 && a24 == 1) && (\exists v_prenex_15 : int :: ((((!((v_prenex_15 + 4) % 5 == 0) && v_prenex_15 <= 599999) && !(0 == (4 * ((v_prenex_15 + -600066) / 5) + 4) % 10)) && 34 * ((v_prenex_15 + -600066) / 5) + 34 < 0) && v_prenex_15 < 600066) && a12 <= (34 * ((v_prenex_15 + -600066) / 5) + 34) / 10 + 1))) || (((a24 == 1 && a21 == 7) && a15 <= 8) && !(a15 == 8))) || (((a24 == 1 && a21 == 10) && a15 <= 8) && !(a15 == 8))) || ((((a12 <= 80 && (11 < a12 || a15 == 8)) && a24 == 1) && ((a15 == 8 && !(a21 == 10)) || (((a24 == 1 && !(8 == a21)) && a15 <= 8) && !(a21 == 10)))) && !(a15 == 8))) || ((((a21 == 6 && 95381 <= a12) && a24 == 1) && a12 <= 586307) && a15 == 9)) || (((((a15 <= 8 && a12 + 49 <= 0) || (a12 + 43 <= 0 && (!(a15 == 5) && a12 <= 11) && a15 <= 8)) && a24 == 1) && !(8 == a21)) && !(a15 == 8))) || ((((a21 == 10 && a24 == 1) && a15 == 9) && a12 <= 599999) && 80 < a12)) || (((!(input == 5) && 0 < a12 + 43) && a21 == 9) && (((!(a15 == 5) && a12 <= 11) && a15 <= 8) && a24 == 1) && !(8 == a21))) || (((a15 <= 8 && a21 <= 6) && (\exists v_~a12~0_438 : int :: ((((v_~a12~0_438 <= 586307 && 34 * ((v_~a12~0_438 + -600066) / 5) + 34 < 0) && v_~a12~0_438 < 600066) && a12 <= (34 * ((v_~a12~0_438 + -600066) / 5) + 34) / 10 + 1) && !(0 == (4 * ((v_~a12~0_438 + -600066) / 5) + 4) % 10)) && !((v_~a12~0_438 + 4) % 5 == 0))) && !(a15 == 8))) || (((a24 == 1 && a21 == 8) && a12 + 526767 <= 0) && a15 == 9)) || (((a21 == 6 && a24 == 1) && 80 < a12) && a15 == 8) [2018-12-30 23:21:04,325 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-30 23:21:04,325 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-30 23:21:04,326 INFO L168 Benchmark]: Toolchain (without parser) took 121896.51 ms. Allocated memory was 1.0 GB in the beginning and 5.1 GB in the end (delta: 4.1 GB). Free memory was 943.3 MB in the beginning and 3.2 GB in the end (delta: -2.2 GB). Peak memory consumption was 1.9 GB. Max. memory is 11.5 GB. [2018-12-30 23:21:04,330 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-30 23:21:04,330 INFO L168 Benchmark]: CACSL2BoogieTranslator took 823.90 ms. Allocated memory is still 1.0 GB. Free memory was 943.3 MB in the beginning and 909.8 MB in the end (delta: 33.6 MB). Peak memory consumption was 33.6 MB. Max. memory is 11.5 GB. [2018-12-30 23:21:04,331 INFO L168 Benchmark]: Boogie Procedure Inliner took 192.60 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 909.8 MB in the beginning and 1.1 GB in the end (delta: -211.6 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. [2018-12-30 23:21:04,331 INFO L168 Benchmark]: Boogie Preprocessor took 104.70 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.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2018-12-30 23:21:04,331 INFO L168 Benchmark]: RCFGBuilder took 3719.57 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 990.1 MB in the end (delta: 124.6 MB). Peak memory consumption was 124.6 MB. Max. memory is 11.5 GB. [2018-12-30 23:21:04,332 INFO L168 Benchmark]: TraceAbstraction took 116791.33 ms. Allocated memory was 1.2 GB in the beginning and 5.1 GB in the end (delta: 3.9 GB). Free memory was 990.1 MB in the beginning and 3.2 GB in the end (delta: -2.2 GB). Peak memory consumption was 1.8 GB. Max. memory is 11.5 GB. [2018-12-30 23:21:04,332 INFO L168 Benchmark]: Witness Printer took 258.44 ms. Allocated memory is still 5.1 GB. Free memory is still 3.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-30 23:21:04,338 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.20 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 823.90 ms. Allocated memory is still 1.0 GB. Free memory was 943.3 MB in the beginning and 909.8 MB in the end (delta: 33.6 MB). Peak memory consumption was 33.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 192.60 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 909.8 MB in the beginning and 1.1 GB in the end (delta: -211.6 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 104.70 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.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 3719.57 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 990.1 MB in the end (delta: 124.6 MB). Peak memory consumption was 124.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 116791.33 ms. Allocated memory was 1.2 GB in the beginning and 5.1 GB in the end (delta: 3.9 GB). Free memory was 990.1 MB in the beginning and 3.2 GB in the end (delta: -2.2 GB). Peak memory consumption was 1.8 GB. Max. memory is 11.5 GB. * Witness Printer took 258.44 ms. Allocated memory is still 5.1 GB. Free memory is still 3.2 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_~a12~0_438,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 109]: 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:21:04,355 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2018-12-30 23:21:04,355 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2018-12-30 23:21:04,355 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2018-12-30 23:21:04,360 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2018-12-30 23:21:04,360 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2018-12-30 23:21:04,361 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2018-12-30 23:21:04,361 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2018-12-30 23:21:04,361 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2018-12-30 23:21:04,362 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2018-12-30 23:21:04,362 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2018-12-30 23:21:04,362 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2018-12-30 23:21:04,362 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2018-12-30 23:21:04,362 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2018-12-30 23:21:04,365 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2018-12-30 23:21:04,365 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2018-12-30 23:21:04,365 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2018-12-30 23:21:04,366 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2018-12-30 23:21:04,366 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2018-12-30 23:21:04,366 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2018-12-30 23:21:04,366 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2018-12-30 23:21:04,366 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2018-12-30 23:21:04,367 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2018-12-30 23:21:04,367 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2018-12-30 23:21:04,367 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2018-12-30 23:21:04,372 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2018-12-30 23:21:04,373 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2018-12-30 23:21:04,373 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2018-12-30 23:21:04,373 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2018-12-30 23:21:04,374 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2018-12-30 23:21:04,378 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2018-12-30 23:21:04,378 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2018-12-30 23:21:04,379 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2018-12-30 23:21:04,379 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2018-12-30 23:21:04,379 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2018-12-30 23:21:04,379 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2018-12-30 23:21:04,380 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2018-12-30 23:21:04,380 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2018-12-30 23:21:04,380 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2018-12-30 23:21:04,380 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2018-12-30 23:21:04,383 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2018-12-30 23:21:04,383 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2018-12-30 23:21:04,383 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2018-12-30 23:21:04,383 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2018-12-30 23:21:04,384 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2018-12-30 23:21:04,384 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2018-12-30 23:21:04,384 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2018-12-30 23:21:04,384 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2018-12-30 23:21:04,384 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((((((((((((((a24 == 1 && a21 == 7) && a15 <= 8) && a12 <= 11) && 0 < a12 + 43) || ((((a24 == 1 && a21 == 8) && a15 == 9) && a12 + 3 <= 0) && 0 < a12 + 43)) || ((((a24 == 1 && a12 <= 586307) && a21 == 8) && a15 == 9) && 19 <= a12)) || ((a21 == 6 && a24 == 1) && a15 == 5)) || (((a12 <= 80 && 11 < a12) && a24 == 1) && a15 == 5)) || ((((a24 == 1 && a21 == 10) && a15 <= 8) && a12 <= 11) && 0 < a12 + 43)) || (((a24 == 1 && a21 == 10) && a15 <= 8) && 80 < a12)) || ((((a24 == 1 && a21 == 9) && a15 == 9) && a12 <= 599999) && 80 < a12)) || (((a15 == 8 && a24 == 1) && a21 == 7) && a12 + 49 <= 0)) || ((((\exists v_~a12~0_438 : int :: ((((v_~a12~0_438 <= 586307 && 34 * ((v_~a12~0_438 + -600066) / 5) + 34 < 0) && v_~a12~0_438 < 600066) && a12 <= (34 * ((v_~a12~0_438 + -600066) / 5) + 34) / 10 + 1) && !(0 == (4 * ((v_~a12~0_438 + -600066) / 5) + 4) % 10)) && !((v_~a12~0_438 + 4) % 5 == 0)) && a24 == 1) && a15 == 9) && a21 == 10)) || ((((a24 == 1 && a21 == 10) && a15 == 9) && a12 + 3 <= 0) && 0 < a12 + 43)) || (((((a15 == 8 && !(a21 == 10)) || (((a24 == 1 && !(8 == a21)) && a15 <= 8) && !(a21 == 10))) && 80 < a12) || ((a24 == 1 && a15 <= 8) && 17760 <= a12)) && !(a15 == 8))) || (((a12 <= 80 && 11 < a12) && a24 == 1) && a15 == 6)) || ((((a15 <= 8 && a12 + 49 <= 0) || (a12 + 43 <= 0 && (!(a15 == 5) && a12 <= 11) && a15 <= 8)) && a24 == 1) && a21 <= 6)) || ((((a12 <= 80 && (11 < a12 || a15 == 8)) && a24 == 1) && ((a15 == 8 && !(a21 == 10)) || (((a24 == 1 && !(8 == a21)) && a15 <= 8) && !(a21 == 10)))) && 19 <= a12)) || (!(a15 == 8) && (((!(a15 == 5) && a12 <= 11) && a15 <= 8) && a24 == 1) && !(8 == a21))) || (((((a24 == 1 && a21 == 7) && a15 == 9) || ((a24 == 1 && a21 == 8) && a15 == 9)) && a12 <= 599999) && 80 < a12)) || (((a21 == 10 && a15 == 8) && a24 == 1) && (\exists v_prenex_15 : int :: ((((!((v_prenex_15 + 4) % 5 == 0) && v_prenex_15 <= 599999) && !(0 == (4 * ((v_prenex_15 + -600066) / 5) + 4) % 10)) && 34 * ((v_prenex_15 + -600066) / 5) + 34 < 0) && v_prenex_15 < 600066) && a12 <= (34 * ((v_prenex_15 + -600066) / 5) + 34) / 10 + 1))) || ((((a12 <= 73282 && a24 == 1) && ((a15 == 8 && !(a21 == 10)) || (((a24 == 1 && !(8 == a21)) && a15 <= 8) && !(a21 == 10)))) && a21 == 8) && 17760 <= a12)) || ((a15 == 7 && a24 == 1) && (\exists v_prenex_15 : int :: ((((!((v_prenex_15 + 4) % 5 == 0) && v_prenex_15 <= 599999) && !(0 == (4 * ((v_prenex_15 + -600066) / 5) + 4) % 10)) && 34 * ((v_prenex_15 + -600066) / 5) + 34 < 0) && v_prenex_15 < 600066) && a12 <= (34 * ((v_prenex_15 + -600066) / 5) + 34) / 10 + 1))) || (((a24 == 1 && a21 == 7) && a15 <= 8) && !(a15 == 8))) || (((a24 == 1 && a21 == 10) && a15 <= 8) && !(a15 == 8))) || ((((a12 <= 80 && (11 < a12 || a15 == 8)) && a24 == 1) && ((a15 == 8 && !(a21 == 10)) || (((a24 == 1 && !(8 == a21)) && a15 <= 8) && !(a21 == 10)))) && !(a15 == 8))) || ((((a21 == 6 && 95381 <= a12) && a24 == 1) && a12 <= 586307) && a15 == 9)) || (((((a15 <= 8 && a12 + 49 <= 0) || (a12 + 43 <= 0 && (!(a15 == 5) && a12 <= 11) && a15 <= 8)) && a24 == 1) && !(8 == a21)) && !(a15 == 8))) || ((((a21 == 10 && a24 == 1) && a15 == 9) && a12 <= 599999) && 80 < a12)) || (((!(input == 5) && 0 < a12 + 43) && a21 == 9) && (((!(a15 == 5) && a12 <= 11) && a15 <= 8) && a24 == 1) && !(8 == a21))) || (((a15 <= 8 && a21 <= 6) && (\exists v_~a12~0_438 : int :: ((((v_~a12~0_438 <= 586307 && 34 * ((v_~a12~0_438 + -600066) / 5) + 34 < 0) && v_~a12~0_438 < 600066) && a12 <= (34 * ((v_~a12~0_438 + -600066) / 5) + 34) / 10 + 1) && !(0 == (4 * ((v_~a12~0_438 + -600066) / 5) + 4) % 10)) && !((v_~a12~0_438 + 4) % 5 == 0))) && !(a15 == 8))) || (((a24 == 1 && a21 == 8) && a12 + 526767 <= 0) && a15 == 9)) || (((a21 == 6 && a24 == 1) && 80 < a12) && a15 == 8) - InvariantResult [Line: 20]: Loop Invariant [2018-12-30 23:21:04,394 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2018-12-30 23:21:04,394 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2018-12-30 23:21:04,394 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2018-12-30 23:21:04,395 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2018-12-30 23:21:04,395 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2018-12-30 23:21:04,395 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2018-12-30 23:21:04,396 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2018-12-30 23:21:04,396 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2018-12-30 23:21:04,396 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2018-12-30 23:21:04,396 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2018-12-30 23:21:04,397 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2018-12-30 23:21:04,397 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2018-12-30 23:21:04,397 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2018-12-30 23:21:04,397 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2018-12-30 23:21:04,398 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2018-12-30 23:21:04,398 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2018-12-30 23:21:04,398 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2018-12-30 23:21:04,398 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2018-12-30 23:21:04,398 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2018-12-30 23:21:04,404 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2018-12-30 23:21:04,404 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2018-12-30 23:21:04,404 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2018-12-30 23:21:04,404 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2018-12-30 23:21:04,405 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2018-12-30 23:21:04,406 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2018-12-30 23:21:04,410 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2018-12-30 23:21:04,410 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2018-12-30 23:21:04,410 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2018-12-30 23:21:04,411 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2018-12-30 23:21:04,411 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2018-12-30 23:21:04,412 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2018-12-30 23:21:04,412 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2018-12-30 23:21:04,412 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2018-12-30 23:21:04,412 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2018-12-30 23:21:04,412 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2018-12-30 23:21:04,413 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2018-12-30 23:21:04,413 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2018-12-30 23:21:04,413 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2018-12-30 23:21:04,413 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2018-12-30 23:21:04,414 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2018-12-30 23:21:04,414 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2018-12-30 23:21:04,414 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2018-12-30 23:21:04,417 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2018-12-30 23:21:04,417 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2018-12-30 23:21:04,417 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2018-12-30 23:21:04,417 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2018-12-30 23:21:04,418 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2018-12-30 23:21:04,418 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((((((((((((((a24 == 1 && a21 == 7) && a15 <= 8) && a12 <= 11) && 0 < a12 + 43) || ((((a24 == 1 && a21 == 8) && a15 == 9) && a12 + 3 <= 0) && 0 < a12 + 43)) || ((((a24 == 1 && a12 <= 586307) && a21 == 8) && a15 == 9) && 19 <= a12)) || ((a21 == 6 && a24 == 1) && a15 == 5)) || (((a12 <= 80 && 11 < a12) && a24 == 1) && a15 == 5)) || (((a15 == 8 && a24 == 1) && a21 == 7) && a12 + 49 <= 0)) || ((((a24 == 1 && a21 == 10) && a15 <= 8) && a12 <= 11) && 0 < a12 + 43)) || (((a24 == 1 && a21 == 10) && a15 <= 8) && 80 < a12)) || ((((a24 == 1 && a21 == 9) && a15 == 9) && a12 <= 599999) && 80 < a12)) || ((((\exists v_~a12~0_438 : int :: ((((v_~a12~0_438 <= 586307 && 34 * ((v_~a12~0_438 + -600066) / 5) + 34 < 0) && v_~a12~0_438 < 600066) && a12 <= (34 * ((v_~a12~0_438 + -600066) / 5) + 34) / 10 + 1) && !(0 == (4 * ((v_~a12~0_438 + -600066) / 5) + 4) % 10)) && !((v_~a12~0_438 + 4) % 5 == 0)) && a24 == 1) && a15 == 9) && a21 == 10)) || ((((a24 == 1 && a21 == 10) && a15 == 9) && a12 + 3 <= 0) && 0 < a12 + 43)) || (((((a15 == 8 && !(a21 == 10)) || (((a24 == 1 && !(8 == a21)) && a15 <= 8) && !(a21 == 10))) && 80 < a12) || ((a24 == 1 && a15 <= 8) && 17760 <= a12)) && !(a15 == 8))) || (((a12 <= 80 && 11 < a12) && a24 == 1) && a15 == 6)) || ((((a15 <= 8 && a12 + 49 <= 0) || (a12 + 43 <= 0 && (!(a15 == 5) && a12 <= 11) && a15 <= 8)) && a24 == 1) && a21 <= 6)) || ((((a12 <= 80 && (11 < a12 || a15 == 8)) && a24 == 1) && ((a15 == 8 && !(a21 == 10)) || (((a24 == 1 && !(8 == a21)) && a15 <= 8) && !(a21 == 10)))) && 19 <= a12)) || (!(a15 == 8) && (((!(a15 == 5) && a12 <= 11) && a15 <= 8) && a24 == 1) && !(8 == a21))) || (((((a24 == 1 && a21 == 7) && a15 == 9) || ((a24 == 1 && a21 == 8) && a15 == 9)) && a12 <= 599999) && 80 < a12)) || (((a21 == 10 && a15 == 8) && a24 == 1) && (\exists v_prenex_15 : int :: ((((!((v_prenex_15 + 4) % 5 == 0) && v_prenex_15 <= 599999) && !(0 == (4 * ((v_prenex_15 + -600066) / 5) + 4) % 10)) && 34 * ((v_prenex_15 + -600066) / 5) + 34 < 0) && v_prenex_15 < 600066) && a12 <= (34 * ((v_prenex_15 + -600066) / 5) + 34) / 10 + 1))) || ((((a12 <= 73282 && a24 == 1) && ((a15 == 8 && !(a21 == 10)) || (((a24 == 1 && !(8 == a21)) && a15 <= 8) && !(a21 == 10)))) && a21 == 8) && 17760 <= a12)) || ((a15 == 7 && a24 == 1) && (\exists v_prenex_15 : int :: ((((!((v_prenex_15 + 4) % 5 == 0) && v_prenex_15 <= 599999) && !(0 == (4 * ((v_prenex_15 + -600066) / 5) + 4) % 10)) && 34 * ((v_prenex_15 + -600066) / 5) + 34 < 0) && v_prenex_15 < 600066) && a12 <= (34 * ((v_prenex_15 + -600066) / 5) + 34) / 10 + 1))) || (((a24 == 1 && a21 == 7) && a15 <= 8) && !(a15 == 8))) || (((a24 == 1 && a21 == 10) && a15 <= 8) && !(a15 == 8))) || ((((a12 <= 80 && (11 < a12 || a15 == 8)) && a24 == 1) && ((a15 == 8 && !(a21 == 10)) || (((a24 == 1 && !(8 == a21)) && a15 <= 8) && !(a21 == 10)))) && !(a15 == 8))) || ((((a21 == 6 && 95381 <= a12) && a24 == 1) && a12 <= 586307) && a15 == 9)) || (((((a15 <= 8 && a12 + 49 <= 0) || (a12 + 43 <= 0 && (!(a15 == 5) && a12 <= 11) && a15 <= 8)) && a24 == 1) && !(8 == a21)) && !(a15 == 8))) || ((((a21 == 10 && a24 == 1) && a15 == 9) && a12 <= 599999) && 80 < a12)) || (((!(input == 5) && 0 < a12 + 43) && a21 == 9) && (((!(a15 == 5) && a12 <= 11) && a15 <= 8) && a24 == 1) && !(8 == a21))) || (((a15 <= 8 && a21 <= 6) && (\exists v_~a12~0_438 : int :: ((((v_~a12~0_438 <= 586307 && 34 * ((v_~a12~0_438 + -600066) / 5) + 34 < 0) && v_~a12~0_438 < 600066) && a12 <= (34 * ((v_~a12~0_438 + -600066) / 5) + 34) / 10 + 1) && !(0 == (4 * ((v_~a12~0_438 + -600066) / 5) + 4) % 10)) && !((v_~a12~0_438 + 4) % 5 == 0))) && !(a15 == 8))) || (((a24 == 1 && a21 == 8) && a12 + 526767 <= 0) && a15 == 9)) || (((a21 == 6 && a24 == 1) && 80 < a12) && a15 == 8) - 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, 116.5s OverallTime, 17 OverallIterations, 18 TraceHistogramMax, 59.7s AutomataDifference, 0.0s DeadEndRemovalTime, 10.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 996 SDtfs, 10705 SDslu, 582 SDs, 0 SdLazy, 40521 SolverSat, 2094 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 49.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 9614 GetRequests, 9484 SyntacticMatches, 10 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 334 ImplicationChecksByTransitivity, 9.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4988occurred in iteration=12, 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.0s AutomataMinimizationTime, 17 MinimizatonAttempts, 8871 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 102 NumberOfFragments, 1711 HoareAnnotationTreeSize, 3 FomulaSimplifications, 28820 FormulaSimplificationTreeSizeReduction, 0.8s HoareSimplificationTime, 3 FomulaSimplificationsInter, 26154 FormulaSimplificationTreeSizeReductionInter, 9.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.6s SsaConstructionTime, 2.9s SatisfiabilityAnalysisTime, 26.5s InterpolantComputationTime, 24499 NumberOfCodeBlocks, 24499 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 24474 ConstructedInterpolants, 99 QuantifiedInterpolants, 119977471 SizeOfPredicates, 17 NumberOfNonLiveVariables, 11551 ConjunctsInSsa, 57 ConjunctsInUnsatCore, 25 InterpolantComputations, 14 PerfectInterpolantSequences, 114680/118905 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...