java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem15_label17.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 01:25:06,493 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 01:25:06,495 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 01:25:06,507 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 01:25:06,507 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 01:25:06,508 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 01:25:06,509 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 01:25:06,511 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 01:25:06,513 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 01:25:06,514 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 01:25:06,514 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 01:25:06,516 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 01:25:06,516 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 01:25:06,517 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 01:25:06,518 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 01:25:06,519 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 01:25:06,520 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 01:25:06,521 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 01:25:06,523 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 01:25:06,525 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 01:25:06,527 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 01:25:06,528 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 01:25:06,529 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 01:25:06,530 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 01:25:06,532 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 01:25:06,533 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 01:25:06,533 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 01:25:06,534 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 01:25:06,535 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 01:25:06,536 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 01:25:06,536 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 01:25:06,537 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 01:25:06,538 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 01:25:06,539 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 01:25:06,540 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 01:25:06,540 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 01:25:06,541 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 01:25:06,541 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 01:25:06,541 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 01:25:06,542 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 01:25:06,543 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 01:25:06,544 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-02 01:25:06,561 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 01:25:06,562 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 01:25:06,563 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 01:25:06,563 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 01:25:06,563 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 01:25:06,563 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 01:25:06,564 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 01:25:06,564 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 01:25:06,565 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 01:25:06,565 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 01:25:06,565 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 01:25:06,565 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 01:25:06,566 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 01:25:06,566 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 01:25:06,566 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 01:25:06,566 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 01:25:06,566 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 01:25:06,567 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 01:25:06,567 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 01:25:06,567 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 01:25:06,568 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 01:25:06,569 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 01:25:06,569 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 01:25:06,569 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 01:25:06,569 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 01:25:06,570 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 01:25:06,570 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 01:25:06,570 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 01:25:06,570 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 01:25:06,615 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 01:25:06,631 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 01:25:06,635 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 01:25:06,636 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 01:25:06,637 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 01:25:06,637 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem15_label17.c [2019-10-02 01:25:06,698 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8bdb4aeb3/4b69ee9a488e4e6fa4bc34c80dde3572/FLAGbdb42c32a [2019-10-02 01:25:07,406 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 01:25:07,408 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem15_label17.c [2019-10-02 01:25:07,428 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8bdb4aeb3/4b69ee9a488e4e6fa4bc34c80dde3572/FLAGbdb42c32a [2019-10-02 01:25:07,520 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8bdb4aeb3/4b69ee9a488e4e6fa4bc34c80dde3572 [2019-10-02 01:25:07,532 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 01:25:07,533 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 01:25:07,536 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 01:25:07,536 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 01:25:07,538 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 01:25:07,539 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 01:25:07" (1/1) ... [2019-10-02 01:25:07,542 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60243c20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:25:07, skipping insertion in model container [2019-10-02 01:25:07,542 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 01:25:07" (1/1) ... [2019-10-02 01:25:07,549 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 01:25:07,629 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 01:25:08,634 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 01:25:08,643 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 01:25:08,995 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 01:25:09,014 INFO L192 MainTranslator]: Completed translation [2019-10-02 01:25:09,015 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:25:09 WrapperNode [2019-10-02 01:25:09,015 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 01:25:09,016 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 01:25:09,016 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 01:25:09,016 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 01:25:09,030 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:25:09" (1/1) ... [2019-10-02 01:25:09,030 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:25:09" (1/1) ... [2019-10-02 01:25:09,075 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:25:09" (1/1) ... [2019-10-02 01:25:09,076 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:25:09" (1/1) ... [2019-10-02 01:25:09,136 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:25:09" (1/1) ... [2019-10-02 01:25:09,168 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:25:09" (1/1) ... [2019-10-02 01:25:09,186 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:25:09" (1/1) ... [2019-10-02 01:25:09,209 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 01:25:09,209 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 01:25:09,209 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 01:25:09,210 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 01:25:09,211 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:25:09" (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 [2019-10-02 01:25:09,291 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 01:25:09,292 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 01:25:09,292 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-10-02 01:25:09,292 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2019-10-02 01:25:09,292 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 01:25:09,292 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-10-02 01:25:09,293 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2019-10-02 01:25:09,293 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 01:25:09,293 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 01:25:09,293 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-02 01:25:09,293 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 01:25:09,294 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 01:25:09,294 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 01:25:12,489 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 01:25:12,489 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-02 01:25:12,491 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 01:25:12 BoogieIcfgContainer [2019-10-02 01:25:12,492 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 01:25:12,493 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 01:25:12,494 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 01:25:12,497 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 01:25:12,497 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 01:25:07" (1/3) ... [2019-10-02 01:25:12,498 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b116498 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 01:25:12, skipping insertion in model container [2019-10-02 01:25:12,499 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:25:09" (2/3) ... [2019-10-02 01:25:12,499 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b116498 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 01:25:12, skipping insertion in model container [2019-10-02 01:25:12,499 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 01:25:12" (3/3) ... [2019-10-02 01:25:12,501 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem15_label17.c [2019-10-02 01:25:12,512 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 01:25:12,523 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 01:25:12,541 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 01:25:12,593 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 01:25:12,594 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 01:25:12,595 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 01:25:12,595 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 01:25:12,595 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 01:25:12,595 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 01:25:12,595 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 01:25:12,595 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 01:25:12,596 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 01:25:12,634 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states. [2019-10-02 01:25:12,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-10-02 01:25:12,648 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:25:12,649 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 01:25:12,652 INFO L418 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:25:12,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:25:12,659 INFO L82 PathProgramCache]: Analyzing trace with hash -1566506531, now seen corresponding path program 1 times [2019-10-02 01:25:12,661 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:25:12,662 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:25:12,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:25:12,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:25:12,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:25:12,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:25:13,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 01:25:13,089 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 01:25:13,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 01:25:13,094 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 01:25:13,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 01:25:13,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-02 01:25:13,112 INFO L87 Difference]: Start difference. First operand 437 states. Second operand 4 states. [2019-10-02 01:25:18,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:25:18,719 INFO L93 Difference]: Finished difference Result 1510 states and 2773 transitions. [2019-10-02 01:25:18,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 01:25:18,722 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 69 [2019-10-02 01:25:18,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:25:18,748 INFO L225 Difference]: With dead ends: 1510 [2019-10-02 01:25:18,749 INFO L226 Difference]: Without dead ends: 1006 [2019-10-02 01:25:18,762 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-02 01:25:18,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1006 states. [2019-10-02 01:25:18,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1006 to 1004. [2019-10-02 01:25:18,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1004 states. [2019-10-02 01:25:18,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1004 states to 1004 states and 1509 transitions. [2019-10-02 01:25:18,899 INFO L78 Accepts]: Start accepts. Automaton has 1004 states and 1509 transitions. Word has length 69 [2019-10-02 01:25:18,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:25:18,900 INFO L475 AbstractCegarLoop]: Abstraction has 1004 states and 1509 transitions. [2019-10-02 01:25:18,900 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 01:25:18,900 INFO L276 IsEmpty]: Start isEmpty. Operand 1004 states and 1509 transitions. [2019-10-02 01:25:18,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-10-02 01:25:18,908 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:25:18,909 INFO L411 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, 2, 2, 2, 2, 2, 2, 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] [2019-10-02 01:25:18,909 INFO L418 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:25:18,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:25:18,909 INFO L82 PathProgramCache]: Analyzing trace with hash -1392036326, now seen corresponding path program 1 times [2019-10-02 01:25:18,910 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:25:18,910 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:25:18,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:25:18,912 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:25:18,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:25:18,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:25:19,151 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 01:25:19,152 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 01:25:19,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 01:25:19,154 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 01:25:19,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 01:25:19,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-02 01:25:19,155 INFO L87 Difference]: Start difference. First operand 1004 states and 1509 transitions. Second operand 4 states. [2019-10-02 01:25:23,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:25:23,295 INFO L93 Difference]: Finished difference Result 3855 states and 5892 transitions. [2019-10-02 01:25:23,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 01:25:23,298 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 138 [2019-10-02 01:25:23,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:25:23,322 INFO L225 Difference]: With dead ends: 3855 [2019-10-02 01:25:23,322 INFO L226 Difference]: Without dead ends: 2857 [2019-10-02 01:25:23,326 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-02 01:25:23,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2857 states. [2019-10-02 01:25:23,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2857 to 2855. [2019-10-02 01:25:23,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2855 states. [2019-10-02 01:25:23,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2855 states to 2855 states and 3894 transitions. [2019-10-02 01:25:23,423 INFO L78 Accepts]: Start accepts. Automaton has 2855 states and 3894 transitions. Word has length 138 [2019-10-02 01:25:23,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:25:23,426 INFO L475 AbstractCegarLoop]: Abstraction has 2855 states and 3894 transitions. [2019-10-02 01:25:23,426 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 01:25:23,426 INFO L276 IsEmpty]: Start isEmpty. Operand 2855 states and 3894 transitions. [2019-10-02 01:25:23,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2019-10-02 01:25:23,444 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:25:23,445 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 01:25:23,446 INFO L418 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:25:23,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:25:23,447 INFO L82 PathProgramCache]: Analyzing trace with hash -124404866, now seen corresponding path program 1 times [2019-10-02 01:25:23,447 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:25:23,447 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:25:23,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:25:23,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:25:23,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:25:23,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:25:23,899 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 125 proven. 77 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-02 01:25:23,900 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:25:23,900 INFO L224 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 [2019-10-02 01:25:23,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:25:24,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:25:24,033 INFO L256 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-02 01:25:24,046 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:25:24,182 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 125 proven. 2 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-10-02 01:25:24,194 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 01:25:24,195 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2019-10-02 01:25:24,196 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 01:25:24,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 01:25:24,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-10-02 01:25:24,197 INFO L87 Difference]: Start difference. First operand 2855 states and 3894 transitions. Second operand 7 states. [2019-10-02 01:25:28,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:25:28,283 INFO L93 Difference]: Finished difference Result 8583 states and 11883 transitions. [2019-10-02 01:25:28,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 01:25:28,283 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 247 [2019-10-02 01:25:28,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:25:28,328 INFO L225 Difference]: With dead ends: 8583 [2019-10-02 01:25:28,329 INFO L226 Difference]: Without dead ends: 5734 [2019-10-02 01:25:28,346 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 250 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2019-10-02 01:25:28,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5734 states. [2019-10-02 01:25:28,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5734 to 5698. [2019-10-02 01:25:28,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5698 states. [2019-10-02 01:25:28,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5698 states to 5698 states and 7193 transitions. [2019-10-02 01:25:28,549 INFO L78 Accepts]: Start accepts. Automaton has 5698 states and 7193 transitions. Word has length 247 [2019-10-02 01:25:28,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:25:28,551 INFO L475 AbstractCegarLoop]: Abstraction has 5698 states and 7193 transitions. [2019-10-02 01:25:28,551 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 01:25:28,551 INFO L276 IsEmpty]: Start isEmpty. Operand 5698 states and 7193 transitions. [2019-10-02 01:25:28,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 432 [2019-10-02 01:25:28,562 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:25:28,562 INFO L411 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 01:25:28,563 INFO L418 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:25:28,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:25:28,563 INFO L82 PathProgramCache]: Analyzing trace with hash 1309734060, now seen corresponding path program 1 times [2019-10-02 01:25:28,563 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:25:28,563 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:25:28,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:25:28,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:25:28,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:25:28,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:25:29,130 INFO L134 CoverageAnalysis]: Checked inductivity of 428 backedges. 349 proven. 2 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-10-02 01:25:29,130 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:25:29,131 INFO L224 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 [2019-10-02 01:25:29,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:25:29,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:25:29,314 INFO L256 TraceCheckSpWp]: Trace formula consists of 653 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 01:25:29,336 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:25:29,597 INFO L134 CoverageAnalysis]: Checked inductivity of 428 backedges. 349 proven. 2 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-10-02 01:25:29,602 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 01:25:29,602 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-10-02 01:25:29,603 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 01:25:29,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 01:25:29,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-10-02 01:25:29,606 INFO L87 Difference]: Start difference. First operand 5698 states and 7193 transitions. Second operand 9 states. [2019-10-02 01:25:37,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:25:37,351 INFO L93 Difference]: Finished difference Result 16806 states and 23127 transitions. [2019-10-02 01:25:37,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-10-02 01:25:37,351 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 431 [2019-10-02 01:25:37,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:25:37,424 INFO L225 Difference]: With dead ends: 16806 [2019-10-02 01:25:37,424 INFO L226 Difference]: Without dead ends: 11114 [2019-10-02 01:25:37,445 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 466 GetRequests, 444 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=167, Invalid=385, Unknown=0, NotChecked=0, Total=552 [2019-10-02 01:25:37,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11114 states. [2019-10-02 01:25:37,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11114 to 9141. [2019-10-02 01:25:37,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9141 states. [2019-10-02 01:25:37,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9141 states to 9141 states and 11586 transitions. [2019-10-02 01:25:37,764 INFO L78 Accepts]: Start accepts. Automaton has 9141 states and 11586 transitions. Word has length 431 [2019-10-02 01:25:37,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:25:37,766 INFO L475 AbstractCegarLoop]: Abstraction has 9141 states and 11586 transitions. [2019-10-02 01:25:37,766 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 01:25:37,767 INFO L276 IsEmpty]: Start isEmpty. Operand 9141 states and 11586 transitions. [2019-10-02 01:25:37,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 438 [2019-10-02 01:25:37,784 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:25:37,785 INFO L411 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 01:25:37,785 INFO L418 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:25:37,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:25:37,786 INFO L82 PathProgramCache]: Analyzing trace with hash -835180680, now seen corresponding path program 1 times [2019-10-02 01:25:37,786 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:25:37,786 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:25:37,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:25:37,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:25:37,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:25:37,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:25:38,159 INFO L134 CoverageAnalysis]: Checked inductivity of 434 backedges. 272 proven. 82 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-10-02 01:25:38,159 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:25:38,159 INFO L224 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 [2019-10-02 01:25:38,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:25:38,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:25:38,293 INFO L256 TraceCheckSpWp]: Trace formula consists of 660 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-02 01:25:38,299 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:25:38,468 INFO L134 CoverageAnalysis]: Checked inductivity of 434 backedges. 288 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (4)] Exception during sending of exit command (exit): Stream closed [2019-10-02 01:25:38,481 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 01:25:38,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2019-10-02 01:25:38,484 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 01:25:38,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 01:25:38,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-10-02 01:25:38,485 INFO L87 Difference]: Start difference. First operand 9141 states and 11586 transitions. Second operand 7 states. [2019-10-02 01:25:46,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:25:46,848 INFO L93 Difference]: Finished difference Result 26696 states and 37998 transitions. [2019-10-02 01:25:46,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-02 01:25:46,849 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 437 [2019-10-02 01:25:46,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:25:46,994 INFO L225 Difference]: With dead ends: 26696 [2019-10-02 01:25:46,995 INFO L226 Difference]: Without dead ends: 17870 [2019-10-02 01:25:47,059 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 462 GetRequests, 447 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2019-10-02 01:25:47,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17870 states. [2019-10-02 01:25:47,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17870 to 17068. [2019-10-02 01:25:47,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17068 states. [2019-10-02 01:25:47,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17068 states to 17068 states and 22618 transitions. [2019-10-02 01:25:47,794 INFO L78 Accepts]: Start accepts. Automaton has 17068 states and 22618 transitions. Word has length 437 [2019-10-02 01:25:47,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:25:47,795 INFO L475 AbstractCegarLoop]: Abstraction has 17068 states and 22618 transitions. [2019-10-02 01:25:47,795 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 01:25:47,796 INFO L276 IsEmpty]: Start isEmpty. Operand 17068 states and 22618 transitions. [2019-10-02 01:25:47,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 509 [2019-10-02 01:25:47,821 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:25:47,822 INFO L411 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 01:25:47,822 INFO L418 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:25:47,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:25:47,823 INFO L82 PathProgramCache]: Analyzing trace with hash 1499027376, now seen corresponding path program 1 times [2019-10-02 01:25:47,823 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:25:47,823 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:25:47,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:25:47,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:25:47,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:25:47,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:25:48,174 INFO L134 CoverageAnalysis]: Checked inductivity of 534 backedges. 192 proven. 0 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2019-10-02 01:25:48,174 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 01:25:48,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 01:25:48,175 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 01:25:48,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 01:25:48,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 01:25:48,176 INFO L87 Difference]: Start difference. First operand 17068 states and 22618 transitions. Second operand 3 states. [2019-10-02 01:25:50,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:25:50,407 INFO L93 Difference]: Finished difference Result 34134 states and 45334 transitions. [2019-10-02 01:25:50,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 01:25:50,408 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 508 [2019-10-02 01:25:50,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:25:50,491 INFO L225 Difference]: With dead ends: 34134 [2019-10-02 01:25:50,492 INFO L226 Difference]: Without dead ends: 17381 [2019-10-02 01:25:50,551 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 01:25:50,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17381 states. [2019-10-02 01:25:50,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17381 to 17066. [2019-10-02 01:25:50,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17066 states. [2019-10-02 01:25:50,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17066 states to 17066 states and 22590 transitions. [2019-10-02 01:25:50,996 INFO L78 Accepts]: Start accepts. Automaton has 17066 states and 22590 transitions. Word has length 508 [2019-10-02 01:25:50,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:25:50,998 INFO L475 AbstractCegarLoop]: Abstraction has 17066 states and 22590 transitions. [2019-10-02 01:25:50,998 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 01:25:50,998 INFO L276 IsEmpty]: Start isEmpty. Operand 17066 states and 22590 transitions. [2019-10-02 01:25:51,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 518 [2019-10-02 01:25:51,028 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:25:51,028 INFO L411 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 01:25:51,029 INFO L418 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:25:51,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:25:51,029 INFO L82 PathProgramCache]: Analyzing trace with hash -242121612, now seen corresponding path program 1 times [2019-10-02 01:25:51,029 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:25:51,029 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:25:51,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:25:51,031 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:25:51,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:25:51,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:25:51,735 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 298 proven. 65 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-10-02 01:25:51,736 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:25:51,736 INFO L224 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) [2019-10-02 01:25:51,763 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 01:25:51,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:25:51,893 INFO L256 TraceCheckSpWp]: Trace formula consists of 740 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 01:25:51,909 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:25:51,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 01:25:52,094 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 375 proven. 2 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2019-10-02 01:25:52,107 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 01:25:52,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 11 [2019-10-02 01:25:52,108 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 01:25:52,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 01:25:52,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-10-02 01:25:52,109 INFO L87 Difference]: Start difference. First operand 17066 states and 22590 transitions. Second operand 11 states. [2019-10-02 01:26:14,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:26:14,666 INFO L93 Difference]: Finished difference Result 51302 states and 71087 transitions. [2019-10-02 01:26:14,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-10-02 01:26:14,666 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 517 [2019-10-02 01:26:14,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:26:14,806 INFO L225 Difference]: With dead ends: 51302 [2019-10-02 01:26:14,807 INFO L226 Difference]: Without dead ends: 34244 [2019-10-02 01:26:14,879 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 652 GetRequests, 576 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2026 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1058, Invalid=4948, Unknown=0, NotChecked=0, Total=6006 [2019-10-02 01:26:14,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34244 states. [2019-10-02 01:26:15,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34244 to 29776. [2019-10-02 01:26:15,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29776 states. [2019-10-02 01:26:15,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29776 states to 29776 states and 37667 transitions. [2019-10-02 01:26:15,722 INFO L78 Accepts]: Start accepts. Automaton has 29776 states and 37667 transitions. Word has length 517 [2019-10-02 01:26:15,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:26:15,723 INFO L475 AbstractCegarLoop]: Abstraction has 29776 states and 37667 transitions. [2019-10-02 01:26:15,723 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 01:26:15,723 INFO L276 IsEmpty]: Start isEmpty. Operand 29776 states and 37667 transitions. [2019-10-02 01:26:15,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 533 [2019-10-02 01:26:15,745 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:26:15,746 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 01:26:15,746 INFO L418 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:26:15,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:26:15,747 INFO L82 PathProgramCache]: Analyzing trace with hash -1392523965, now seen corresponding path program 1 times [2019-10-02 01:26:15,748 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:26:15,748 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:26:15,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:26:15,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:26:15,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:26:15,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:26:16,372 INFO L134 CoverageAnalysis]: Checked inductivity of 732 backedges. 487 proven. 2 refuted. 0 times theorem prover too weak. 243 trivial. 0 not checked. [2019-10-02 01:26:16,373 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:26:16,373 INFO L224 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 [2019-10-02 01:26:16,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:26:16,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:26:16,611 INFO L256 TraceCheckSpWp]: Trace formula consists of 790 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 01:26:16,621 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:26:16,898 INFO L134 CoverageAnalysis]: Checked inductivity of 732 backedges. 487 proven. 2 refuted. 0 times theorem prover too weak. 243 trivial. 0 not checked. [2019-10-02 01:26:16,913 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 01:26:16,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-10-02 01:26:16,914 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 01:26:16,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 01:26:16,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-02 01:26:16,916 INFO L87 Difference]: Start difference. First operand 29776 states and 37667 transitions. Second operand 6 states. [2019-10-02 01:26:20,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:26:20,797 INFO L93 Difference]: Finished difference Result 63741 states and 81565 transitions. [2019-10-02 01:26:20,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 01:26:20,798 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 532 [2019-10-02 01:26:20,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:26:20,973 INFO L225 Difference]: With dead ends: 63741 [2019-10-02 01:26:20,974 INFO L226 Difference]: Without dead ends: 34282 [2019-10-02 01:26:21,056 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 544 GetRequests, 536 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2019-10-02 01:26:21,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34282 states. [2019-10-02 01:26:21,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34282 to 31967. [2019-10-02 01:26:21,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31967 states. [2019-10-02 01:26:21,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31967 states to 31967 states and 39872 transitions. [2019-10-02 01:26:21,856 INFO L78 Accepts]: Start accepts. Automaton has 31967 states and 39872 transitions. Word has length 532 [2019-10-02 01:26:21,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:26:21,857 INFO L475 AbstractCegarLoop]: Abstraction has 31967 states and 39872 transitions. [2019-10-02 01:26:21,857 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 01:26:21,858 INFO L276 IsEmpty]: Start isEmpty. Operand 31967 states and 39872 transitions. [2019-10-02 01:26:21,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 558 [2019-10-02 01:26:21,877 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:26:21,877 INFO L411 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-02 01:26:21,878 INFO L418 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:26:21,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:26:21,878 INFO L82 PathProgramCache]: Analyzing trace with hash 724515022, now seen corresponding path program 1 times [2019-10-02 01:26:21,878 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:26:21,878 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:26:21,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:26:21,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:26:21,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:26:21,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:26:23,039 INFO L134 CoverageAnalysis]: Checked inductivity of 558 backedges. 186 proven. 278 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2019-10-02 01:26:23,039 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:26:23,039 INFO L224 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 [2019-10-02 01:26:23,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:26:23,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:26:23,219 INFO L256 TraceCheckSpWp]: Trace formula consists of 777 conjuncts, 16 conjunts are in the unsatisfiable core [2019-10-02 01:26:23,227 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:26:23,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 01:26:23,512 INFO L134 CoverageAnalysis]: Checked inductivity of 558 backedges. 346 proven. 0 refuted. 0 times theorem prover too weak. 212 trivial. 0 not checked. [2019-10-02 01:26:23,516 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 01:26:23,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2019-10-02 01:26:23,517 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 01:26:23,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 01:26:23,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-10-02 01:26:23,519 INFO L87 Difference]: Start difference. First operand 31967 states and 39872 transitions. Second operand 9 states. [2019-10-02 01:26:29,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:26:29,020 INFO L93 Difference]: Finished difference Result 62104 states and 78060 transitions. [2019-10-02 01:26:29,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-02 01:26:29,020 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 557 [2019-10-02 01:26:29,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:26:29,149 INFO L225 Difference]: With dead ends: 62104 [2019-10-02 01:26:29,150 INFO L226 Difference]: Without dead ends: 30454 [2019-10-02 01:26:29,225 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 579 GetRequests, 562 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2019-10-02 01:26:29,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30454 states. [2019-10-02 01:26:29,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30454 to 30414. [2019-10-02 01:26:29,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30414 states. [2019-10-02 01:26:29,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30414 states to 30414 states and 38278 transitions. [2019-10-02 01:26:29,920 INFO L78 Accepts]: Start accepts. Automaton has 30414 states and 38278 transitions. Word has length 557 [2019-10-02 01:26:29,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:26:29,921 INFO L475 AbstractCegarLoop]: Abstraction has 30414 states and 38278 transitions. [2019-10-02 01:26:29,921 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 01:26:29,921 INFO L276 IsEmpty]: Start isEmpty. Operand 30414 states and 38278 transitions. [2019-10-02 01:26:29,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 653 [2019-10-02 01:26:29,946 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:26:29,947 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-02 01:26:29,947 INFO L418 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:26:29,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:26:29,947 INFO L82 PathProgramCache]: Analyzing trace with hash 177923789, now seen corresponding path program 1 times [2019-10-02 01:26:29,948 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:26:29,948 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:26:29,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:26:29,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:26:29,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:26:30,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:26:31,355 INFO L134 CoverageAnalysis]: Checked inductivity of 896 backedges. 262 proven. 540 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2019-10-02 01:26:31,356 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:26:31,356 INFO L224 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 [2019-10-02 01:26:31,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:26:31,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:26:31,529 INFO L256 TraceCheckSpWp]: Trace formula consists of 909 conjuncts, 17 conjunts are in the unsatisfiable core [2019-10-02 01:26:31,545 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:26:31,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-02 01:26:31,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-02 01:26:32,435 INFO L134 CoverageAnalysis]: Checked inductivity of 896 backedges. 643 proven. 41 refuted. 0 times theorem prover too weak. 212 trivial. 0 not checked. [2019-10-02 01:26:32,440 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 01:26:32,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 17 [2019-10-02 01:26:32,442 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-02 01:26:32,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-02 01:26:32,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2019-10-02 01:26:32,443 INFO L87 Difference]: Start difference. First operand 30414 states and 38278 transitions. Second operand 17 states. [2019-10-02 01:26:49,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:26:49,226 INFO L93 Difference]: Finished difference Result 73355 states and 94007 transitions. [2019-10-02 01:26:49,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-10-02 01:26:49,226 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 652 [2019-10-02 01:26:49,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:26:49,382 INFO L225 Difference]: With dead ends: 73355 [2019-10-02 01:26:49,383 INFO L226 Difference]: Without dead ends: 39369 [2019-10-02 01:26:49,490 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 782 GetRequests, 704 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2097 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1009, Invalid=5311, Unknown=0, NotChecked=0, Total=6320 [2019-10-02 01:26:49,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39369 states. [2019-10-02 01:26:50,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39369 to 37708. [2019-10-02 01:26:50,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37708 states. [2019-10-02 01:26:50,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37708 states to 37708 states and 46811 transitions. [2019-10-02 01:26:50,511 INFO L78 Accepts]: Start accepts. Automaton has 37708 states and 46811 transitions. Word has length 652 [2019-10-02 01:26:50,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:26:50,511 INFO L475 AbstractCegarLoop]: Abstraction has 37708 states and 46811 transitions. [2019-10-02 01:26:50,511 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-02 01:26:50,512 INFO L276 IsEmpty]: Start isEmpty. Operand 37708 states and 46811 transitions. [2019-10-02 01:26:50,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 666 [2019-10-02 01:26:50,531 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:26:50,532 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 01:26:50,532 INFO L418 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:26:50,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:26:50,533 INFO L82 PathProgramCache]: Analyzing trace with hash 450148309, now seen corresponding path program 1 times [2019-10-02 01:26:50,533 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:26:50,533 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:26:50,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:26:50,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:26:50,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:26:50,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:26:51,917 INFO L134 CoverageAnalysis]: Checked inductivity of 845 backedges. 417 proven. 240 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2019-10-02 01:26:51,918 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:26:51,918 INFO L224 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 [2019-10-02 01:26:51,971 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:26:52,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:26:52,211 INFO L256 TraceCheckSpWp]: Trace formula consists of 928 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 01:26:52,224 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:26:52,614 INFO L134 CoverageAnalysis]: Checked inductivity of 845 backedges. 501 proven. 2 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2019-10-02 01:26:52,630 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 01:26:52,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 11 [2019-10-02 01:26:52,632 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 01:26:52,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 01:26:52,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-10-02 01:26:52,633 INFO L87 Difference]: Start difference. First operand 37708 states and 46811 transitions. Second operand 11 states. [2019-10-02 01:26:58,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:26:58,432 INFO L93 Difference]: Finished difference Result 77082 states and 95556 transitions. [2019-10-02 01:26:58,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-02 01:26:58,432 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 665 [2019-10-02 01:26:58,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:26:58,526 INFO L225 Difference]: With dead ends: 77082 [2019-10-02 01:26:58,526 INFO L226 Difference]: Without dead ends: 39994 [2019-10-02 01:26:58,590 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 694 GetRequests, 674 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=275, Unknown=0, NotChecked=0, Total=380 [2019-10-02 01:26:58,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39994 states. [2019-10-02 01:26:59,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39994 to 36840. [2019-10-02 01:26:59,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36840 states. [2019-10-02 01:26:59,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36840 states to 36840 states and 45087 transitions. [2019-10-02 01:26:59,450 INFO L78 Accepts]: Start accepts. Automaton has 36840 states and 45087 transitions. Word has length 665 [2019-10-02 01:26:59,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:26:59,452 INFO L475 AbstractCegarLoop]: Abstraction has 36840 states and 45087 transitions. [2019-10-02 01:26:59,452 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 01:26:59,452 INFO L276 IsEmpty]: Start isEmpty. Operand 36840 states and 45087 transitions. [2019-10-02 01:26:59,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 712 [2019-10-02 01:26:59,482 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:26:59,484 INFO L411 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, 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-02 01:26:59,485 INFO L418 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:26:59,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:26:59,485 INFO L82 PathProgramCache]: Analyzing trace with hash -1120308886, now seen corresponding path program 1 times [2019-10-02 01:26:59,485 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:26:59,486 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:26:59,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:26:59,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:26:59,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:26:59,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:27:00,360 INFO L134 CoverageAnalysis]: Checked inductivity of 663 backedges. 192 proven. 0 refuted. 0 times theorem prover too weak. 471 trivial. 0 not checked. [2019-10-02 01:27:00,361 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 01:27:00,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 01:27:00,362 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 01:27:00,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 01:27:00,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 01:27:00,363 INFO L87 Difference]: Start difference. First operand 36840 states and 45087 transitions. Second operand 3 states. [2019-10-02 01:27:02,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:27:02,994 INFO L93 Difference]: Finished difference Result 75229 states and 92641 transitions. [2019-10-02 01:27:02,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 01:27:02,995 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 711 [2019-10-02 01:27:02,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:27:03,077 INFO L225 Difference]: With dead ends: 75229 [2019-10-02 01:27:03,077 INFO L226 Difference]: Without dead ends: 39009 [2019-10-02 01:27:03,137 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 01:27:03,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39009 states. [2019-10-02 01:27:03,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39009 to 38696. [2019-10-02 01:27:03,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38696 states. [2019-10-02 01:27:03,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38696 states to 38696 states and 46379 transitions. [2019-10-02 01:27:03,812 INFO L78 Accepts]: Start accepts. Automaton has 38696 states and 46379 transitions. Word has length 711 [2019-10-02 01:27:03,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:27:03,814 INFO L475 AbstractCegarLoop]: Abstraction has 38696 states and 46379 transitions. [2019-10-02 01:27:03,814 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 01:27:03,814 INFO L276 IsEmpty]: Start isEmpty. Operand 38696 states and 46379 transitions. [2019-10-02 01:27:03,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 780 [2019-10-02 01:27:03,844 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:27:03,844 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 01:27:03,845 INFO L418 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:27:03,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:27:03,845 INFO L82 PathProgramCache]: Analyzing trace with hash 71229590, now seen corresponding path program 1 times [2019-10-02 01:27:03,845 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:27:03,846 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:27:03,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:27:03,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:27:03,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:27:03,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:27:04,548 INFO L134 CoverageAnalysis]: Checked inductivity of 1329 backedges. 649 proven. 2 refuted. 0 times theorem prover too weak. 678 trivial. 0 not checked. [2019-10-02 01:27:04,549 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:27:04,549 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 01:27:04,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:27:05,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:27:05,046 INFO L256 TraceCheckSpWp]: Trace formula consists of 1079 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-02 01:27:05,058 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:27:05,636 INFO L134 CoverageAnalysis]: Checked inductivity of 1329 backedges. 900 proven. 6 refuted. 0 times theorem prover too weak. 423 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (10)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 01:27:05,650 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 01:27:05,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2019-10-02 01:27:05,652 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 01:27:05,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 01:27:05,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-10-02 01:27:05,653 INFO L87 Difference]: Start difference. First operand 38696 states and 46379 transitions. Second operand 9 states. [2019-10-02 01:27:11,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:27:11,697 INFO L93 Difference]: Finished difference Result 76111 states and 90189 transitions. [2019-10-02 01:27:11,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-02 01:27:11,697 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 779 [2019-10-02 01:27:11,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:27:11,741 INFO L225 Difference]: With dead ends: 76111 [2019-10-02 01:27:11,741 INFO L226 Difference]: Without dead ends: 24065 [2019-10-02 01:27:11,808 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 805 GetRequests, 787 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=111, Invalid=269, Unknown=0, NotChecked=0, Total=380 [2019-10-02 01:27:11,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24065 states. [2019-10-02 01:27:12,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24065 to 20257. [2019-10-02 01:27:12,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20257 states. [2019-10-02 01:27:12,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20257 states to 20257 states and 21770 transitions. [2019-10-02 01:27:12,431 INFO L78 Accepts]: Start accepts. Automaton has 20257 states and 21770 transitions. Word has length 779 [2019-10-02 01:27:12,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:27:12,432 INFO L475 AbstractCegarLoop]: Abstraction has 20257 states and 21770 transitions. [2019-10-02 01:27:12,432 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 01:27:12,432 INFO L276 IsEmpty]: Start isEmpty. Operand 20257 states and 21770 transitions. [2019-10-02 01:27:12,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 851 [2019-10-02 01:27:12,446 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:27:12,447 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 01:27:12,447 INFO L418 AbstractCegarLoop]: === Iteration 14 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:27:12,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:27:12,448 INFO L82 PathProgramCache]: Analyzing trace with hash 181722999, now seen corresponding path program 1 times [2019-10-02 01:27:12,448 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:27:12,448 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:27:12,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:27:12,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:27:12,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:27:12,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:27:13,715 INFO L134 CoverageAnalysis]: Checked inductivity of 1114 backedges. 167 proven. 725 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2019-10-02 01:27:13,716 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:27:13,716 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 01:27:13,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:27:13,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:27:13,975 INFO L256 TraceCheckSpWp]: Trace formula consists of 1106 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-02 01:27:13,985 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:27:13,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:27:14,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:27:14,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:27:15,785 WARN L191 SmtUtils]: Spent 1.51 s on a formula simplification that was a NOOP. DAG size: 25 [2019-10-02 01:27:15,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 01:27:16,792 INFO L134 CoverageAnalysis]: Checked inductivity of 1114 backedges. 698 proven. 61 refuted. 0 times theorem prover too weak. 355 trivial. 0 not checked. [2019-10-02 01:27:16,800 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 01:27:16,801 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 6] total 19 [2019-10-02 01:27:16,802 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-02 01:27:16,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-02 01:27:16,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2019-10-02 01:27:16,803 INFO L87 Difference]: Start difference. First operand 20257 states and 21770 transitions. Second operand 19 states. [2019-10-02 01:27:29,505 WARN L191 SmtUtils]: Spent 516.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 49 [2019-10-02 01:27:29,932 WARN L191 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 25 [2019-10-02 01:27:32,171 WARN L191 SmtUtils]: Spent 2.09 s on a formula simplification. DAG size of input: 59 DAG size of output: 43 [2019-10-02 01:27:37,444 WARN L191 SmtUtils]: Spent 4.09 s on a formula simplification. DAG size of input: 51 DAG size of output: 47 [2019-10-02 01:27:39,753 WARN L191 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 35 [2019-10-02 01:27:42,020 WARN L191 SmtUtils]: Spent 2.04 s on a formula simplification that was a NOOP. DAG size: 37 [2019-10-02 01:27:44,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:27:44,617 INFO L93 Difference]: Finished difference Result 55374 states and 59682 transitions. [2019-10-02 01:27:44,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-10-02 01:27:44,618 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 850 [2019-10-02 01:27:44,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:27:44,681 INFO L225 Difference]: With dead ends: 55374 [2019-10-02 01:27:44,682 INFO L226 Difference]: Without dead ends: 36036 [2019-10-02 01:27:44,716 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 974 GetRequests, 900 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1880 ImplicationChecksByTransitivity, 15.6s TimeCoverageRelationStatistics Valid=1055, Invalid=4495, Unknown=0, NotChecked=0, Total=5550 [2019-10-02 01:27:44,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36036 states. [2019-10-02 01:27:45,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36036 to 30049. [2019-10-02 01:27:45,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30049 states. [2019-10-02 01:27:45,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30049 states to 30049 states and 32235 transitions. [2019-10-02 01:27:45,122 INFO L78 Accepts]: Start accepts. Automaton has 30049 states and 32235 transitions. Word has length 850 [2019-10-02 01:27:45,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:27:45,123 INFO L475 AbstractCegarLoop]: Abstraction has 30049 states and 32235 transitions. [2019-10-02 01:27:45,123 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-02 01:27:45,123 INFO L276 IsEmpty]: Start isEmpty. Operand 30049 states and 32235 transitions. [2019-10-02 01:27:45,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 904 [2019-10-02 01:27:45,153 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:27:45,154 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-02 01:27:45,154 INFO L418 AbstractCegarLoop]: === Iteration 15 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:27:45,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:27:45,155 INFO L82 PathProgramCache]: Analyzing trace with hash 1350268043, now seen corresponding path program 1 times [2019-10-02 01:27:45,155 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:27:45,155 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:27:45,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:27:45,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:27:45,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:27:45,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:27:45,825 INFO L134 CoverageAnalysis]: Checked inductivity of 1173 backedges. 621 proven. 61 refuted. 0 times theorem prover too weak. 491 trivial. 0 not checked. [2019-10-02 01:27:45,825 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:27:45,825 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 01:27:45,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:27:46,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:27:46,075 INFO L256 TraceCheckSpWp]: Trace formula consists of 1158 conjuncts, 16 conjunts are in the unsatisfiable core [2019-10-02 01:27:46,084 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:27:46,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:27:46,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:27:48,697 WARN L191 SmtUtils]: Spent 2.51 s on a formula simplification. DAG size of input: 24 DAG size of output: 21 [2019-10-02 01:27:48,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:27:49,613 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((v_~a0~0_835 Int)) (let ((.cse0 (mod v_~a0~0_835 299926))) (and (<= .cse0 (+ c_~a0~0 300074)) (= 0 .cse0) (<= (+ v_~a0~0_835 44) 0)))) (exists ((v_prenex_7 Int)) (let ((.cse1 (mod v_prenex_7 299926))) (and (< v_prenex_7 0) (<= (+ v_prenex_7 44) 0) (<= .cse1 (+ c_~a0~0 600000)) (not (= 0 .cse1)))))) is different from true [2019-10-02 01:27:49,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:27:49,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:27:53,954 WARN L191 SmtUtils]: Spent 2.26 s on a formula simplification. DAG size of input: 27 DAG size of output: 20 [2019-10-02 01:27:55,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:27:55,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:27:55,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:27:57,032 INFO L134 CoverageAnalysis]: Checked inductivity of 1173 backedges. 0 proven. 667 refuted. 0 times theorem prover too weak. 491 trivial. 15 not checked. [2019-10-02 01:27:57,036 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 01:27:57,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 14 [2019-10-02 01:27:57,038 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-02 01:27:57,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-02 01:27:57,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=120, Unknown=2, NotChecked=22, Total=182 [2019-10-02 01:27:57,038 INFO L87 Difference]: Start difference. First operand 30049 states and 32235 transitions. Second operand 14 states. [2019-10-02 01:28:11,951 WARN L191 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 24 DAG size of output: 17 [2019-10-02 01:28:14,400 WARN L191 SmtUtils]: Spent 2.06 s on a formula simplification. DAG size of input: 41 DAG size of output: 34 [2019-10-02 01:28:37,855 WARN L191 SmtUtils]: Spent 3.81 s on a formula simplification. DAG size of input: 31 DAG size of output: 19 [2019-10-02 01:29:18,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:29:18,044 INFO L93 Difference]: Finished difference Result 48710 states and 53170 transitions. [2019-10-02 01:29:18,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-10-02 01:29:18,045 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 903 [2019-10-02 01:29:18,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:29:18,198 INFO L225 Difference]: With dead ends: 48710 [2019-10-02 01:29:18,198 INFO L226 Difference]: Without dead ends: 48708 [2019-10-02 01:29:18,231 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 959 GetRequests, 916 SyntacticMatches, 9 SemanticMatches, 34 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 382 ImplicationChecksByTransitivity, 23.5s TimeCoverageRelationStatistics Valid=266, Invalid=922, Unknown=6, NotChecked=66, Total=1260 [2019-10-02 01:29:18,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48708 states. [2019-10-02 01:29:19,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48708 to 46133. [2019-10-02 01:29:19,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46133 states. [2019-10-02 01:29:19,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46133 states to 46133 states and 49508 transitions. [2019-10-02 01:29:19,159 INFO L78 Accepts]: Start accepts. Automaton has 46133 states and 49508 transitions. Word has length 903 [2019-10-02 01:29:19,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:29:19,159 INFO L475 AbstractCegarLoop]: Abstraction has 46133 states and 49508 transitions. [2019-10-02 01:29:19,159 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-02 01:29:19,159 INFO L276 IsEmpty]: Start isEmpty. Operand 46133 states and 49508 transitions. [2019-10-02 01:29:19,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 945 [2019-10-02 01:29:19,197 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:29:19,197 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 01:29:19,197 INFO L418 AbstractCegarLoop]: === Iteration 16 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:29:19,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:29:19,198 INFO L82 PathProgramCache]: Analyzing trace with hash 1610424128, now seen corresponding path program 1 times [2019-10-02 01:29:19,198 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:29:19,198 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:29:19,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:29:19,200 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:29:19,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:29:19,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:29:20,453 INFO L134 CoverageAnalysis]: Checked inductivity of 1508 backedges. 856 proven. 298 refuted. 0 times theorem prover too weak. 354 trivial. 0 not checked. [2019-10-02 01:29:20,454 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:29:20,454 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 01:29:20,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:29:20,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:29:20,706 INFO L256 TraceCheckSpWp]: Trace formula consists of 1235 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-02 01:29:20,714 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:29:20,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:29:20,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:29:20,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 01:29:20,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 01:29:20,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 01:29:20,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:29:20,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 01:29:21,414 INFO L134 CoverageAnalysis]: Checked inductivity of 1508 backedges. 1171 proven. 84 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2019-10-02 01:29:21,418 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 01:29:21,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 8] total 20 [2019-10-02 01:29:21,420 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-10-02 01:29:21,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-10-02 01:29:21,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2019-10-02 01:29:21,421 INFO L87 Difference]: Start difference. First operand 46133 states and 49508 transitions. Second operand 20 states. [2019-10-02 01:29:33,370 WARN L191 SmtUtils]: Spent 1.63 s on a formula simplification. DAG size of input: 50 DAG size of output: 43 [2019-10-02 01:29:34,778 WARN L191 SmtUtils]: Spent 636.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 27 [2019-10-02 01:29:39,337 WARN L191 SmtUtils]: Spent 1.16 s on a formula simplification. DAG size of input: 52 DAG size of output: 48 [2019-10-02 01:29:47,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:29:47,805 INFO L93 Difference]: Finished difference Result 102381 states and 109736 transitions. [2019-10-02 01:29:47,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2019-10-02 01:29:47,805 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 944 [2019-10-02 01:29:47,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:29:47,919 INFO L225 Difference]: With dead ends: 102381 [2019-10-02 01:29:47,919 INFO L226 Difference]: Without dead ends: 59035 [2019-10-02 01:29:47,986 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 1123 GetRequests, 1011 SyntacticMatches, 4 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4566 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=1830, Invalid=10159, Unknown=1, NotChecked=0, Total=11990 [2019-10-02 01:29:48,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59035 states. [2019-10-02 01:29:48,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59035 to 40407. [2019-10-02 01:29:48,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40407 states. [2019-10-02 01:29:48,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40407 states to 40407 states and 42037 transitions. [2019-10-02 01:29:48,863 INFO L78 Accepts]: Start accepts. Automaton has 40407 states and 42037 transitions. Word has length 944 [2019-10-02 01:29:48,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:29:48,864 INFO L475 AbstractCegarLoop]: Abstraction has 40407 states and 42037 transitions. [2019-10-02 01:29:48,864 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-10-02 01:29:48,864 INFO L276 IsEmpty]: Start isEmpty. Operand 40407 states and 42037 transitions. [2019-10-02 01:29:48,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1446 [2019-10-02 01:29:48,921 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:29:48,922 INFO L411 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 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, 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] [2019-10-02 01:29:48,922 INFO L418 AbstractCegarLoop]: === Iteration 17 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:29:48,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:29:48,923 INFO L82 PathProgramCache]: Analyzing trace with hash -196888371, now seen corresponding path program 1 times [2019-10-02 01:29:48,923 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:29:48,923 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:29:48,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:29:48,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:29:48,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:29:49,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:29:50,312 INFO L134 CoverageAnalysis]: Checked inductivity of 3500 backedges. 1243 proven. 228 refuted. 0 times theorem prover too weak. 2029 trivial. 0 not checked. [2019-10-02 01:29:50,312 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:29:50,313 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 01:29:50,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:29:50,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:29:50,718 INFO L256 TraceCheckSpWp]: Trace formula consists of 1801 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-02 01:29:50,727 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:29:51,802 INFO L134 CoverageAnalysis]: Checked inductivity of 3500 backedges. 2231 proven. 2 refuted. 0 times theorem prover too weak. 1267 trivial. 0 not checked. [2019-10-02 01:29:51,810 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 01:29:51,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 8 [2019-10-02 01:29:51,812 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 01:29:51,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 01:29:51,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-10-02 01:29:51,812 INFO L87 Difference]: Start difference. First operand 40407 states and 42037 transitions. Second operand 8 states. [2019-10-02 01:29:54,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:29:54,814 INFO L93 Difference]: Finished difference Result 74820 states and 77934 transitions. [2019-10-02 01:29:54,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 01:29:54,815 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 1445 [2019-10-02 01:29:54,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:29:54,816 INFO L225 Difference]: With dead ends: 74820 [2019-10-02 01:29:54,817 INFO L226 Difference]: Without dead ends: 0 [2019-10-02 01:29:54,874 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 1459 GetRequests, 1450 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2019-10-02 01:29:54,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-02 01:29:54,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-02 01:29:54,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-02 01:29:54,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-02 01:29:54,875 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1445 [2019-10-02 01:29:54,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:29:54,876 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-02 01:29:54,876 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 01:29:54,876 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-02 01:29:54,876 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-02 01:29:54,881 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-02 01:29:55,395 WARN L191 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 82 [2019-10-02 01:30:06,235 WARN L191 SmtUtils]: Spent 8.08 s on a formula simplification. DAG size of input: 2070 DAG size of output: 1759 [2019-10-02 01:30:13,464 WARN L191 SmtUtils]: Spent 7.22 s on a formula simplification. DAG size of input: 2070 DAG size of output: 1759 [2019-10-02 01:30:36,605 WARN L191 SmtUtils]: Spent 21.49 s on a formula simplification. DAG size of input: 1184 DAG size of output: 230 [2019-10-02 01:30:56,008 WARN L191 SmtUtils]: Spent 19.31 s on a formula simplification. DAG size of input: 1245 DAG size of output: 237 [2019-10-02 01:32:04,723 WARN L191 SmtUtils]: Spent 1.14 m on a formula simplification. DAG size of input: 1695 DAG size of output: 186 [2019-10-02 01:33:07,787 WARN L191 SmtUtils]: Spent 1.05 m on a formula simplification. DAG size of input: 1695 DAG size of output: 186 [2019-10-02 01:33:27,868 WARN L191 SmtUtils]: Spent 20.01 s on a formula simplification. DAG size of input: 1265 DAG size of output: 266 [2019-10-02 01:33:27,872 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2019-10-02 01:33:27,872 INFO L439 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~a29~0 |old(~a29~0)|) (= ~a2~0 |old(~a2~0)|) (= ~a0~0 |old(~a0~0)|) (= ~a4~0 |old(~a4~0)|)) [2019-10-02 01:33:27,872 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-02 01:33:27,872 INFO L443 ceAbstractionStarter]: For program point calculate_output2EXIT(lines 1658 1758) no Hoare annotation was computed. [2019-10-02 01:33:27,872 INFO L443 ceAbstractionStarter]: For program point L1749(lines 1749 1756) no Hoare annotation was computed. [2019-10-02 01:33:27,873 INFO L443 ceAbstractionStarter]: For program point L1729(lines 1729 1756) no Hoare annotation was computed. [2019-10-02 01:33:27,873 INFO L439 ceAbstractionStarter]: At program point calculate_output2ENTRY(lines 1658 1758) the Hoare annotation is: (let ((.cse35 (= ~a29~0 |old(~a29~0)|)) (.cse47 (= ~a2~0 |old(~a2~0)|)) (.cse37 (= ~a4~0 |old(~a4~0)|))) (let ((.cse45 (+ |old(~a0~0)| 147)) (.cse29 (and .cse35 .cse47 .cse37)) (.cse21 (not (= 1 |old(~a2~0)|))) (.cse43 (+ |old(~a29~0)| 127)) (.cse40 (= 1 ~a2~0)) (.cse14 (not (<= (+ |old(~a4~0)| 89) 0))) (.cse12 (not (<= (+ |old(~a0~0)| 104) 0))) (.cse3 (not (<= 0 (+ |old(~a4~0)| 85)))) (.cse0 (not (<= (+ |old(~a4~0)| 42) 0))) (.cse15 (not (< 43 |old(~a29~0)|))) (.cse6 (not (= 3 |old(~a2~0)|))) (.cse18 (not (= 4 |old(~a2~0)|))) (.cse48 (= 3 ~a2~0)) (.cse44 (= 2 ~a2~0)) (.cse30 (= ~a0~0 |old(~a0~0)|)) (.cse36 (= 4 ~a2~0))) (let ((.cse7 (and .cse30 (and .cse35 .cse36 .cse37))) (.cse26 (and .cse30 (and .cse35 .cse44 .cse37))) (.cse33 (and (<= (+ ~a0~0 104) 0) .cse30 (and (<= 0 (+ ~a4~0 85)) (<= (+ ~a4~0 42) 0) .cse35 .cse47 .cse48 .cse37 (< 43 ~a29~0)))) (.cse28 (and .cse18 (not (<= 48792 |old(~a29~0)|)))) (.cse34 (or .cse12 (or .cse3 (or .cse0 .cse15 .cse6)))) (.cse8 (or .cse18 .cse14)) (.cse20 (and .cse35 .cse40 .cse30 .cse37)) (.cse32 (or .cse14 (= 5 |old(~a2~0)|))) (.cse4 (not (<= 0 (+ |old(~a29~0)| 600001)))) (.cse9 (not (<= 0 (+ |old(~a29~0)| 599991)))) (.cse25 (not (<= (+ |old(~a0~0)| 61) 0))) (.cse24 (not (<= (+ |old(~a4~0)| 86) 0))) (.cse38 (not (<= (+ (* 5 |old(~a0~0)|) 779) |old(~a29~0)|))) (.cse2 (and .cse35 .cse30 .cse48 .cse37)) (.cse16 (not (<= .cse43 0))) (.cse42 (or .cse14 .cse21)) (.cse23 (and .cse30 .cse29)) (.cse13 (and .cse35 .cse47 .cse30 .cse37)) (.cse5 (not (<= |old(~a29~0)| 43))) (.cse41 (forall ((v_prenex_1 Int)) (let ((.cse46 (mod (+ v_prenex_1 11) 29))) (or (not (<= .cse46 (+ |old(~a29~0)| 14))) (not (< (+ v_prenex_1 371124) 0)) (= .cse46 0))))) (.cse10 (not (<= 4 |old(~a2~0)|))) (.cse19 (not (<= (+ |old(~a0~0)| 98) 0))) (.cse11 (not (< 0 .cse45))) (.cse1 (not (<= .cse45 0))) (.cse22 (not (<= 0 (+ |old(~a0~0)| 600000)))) (.cse39 (and .cse35 .cse44 .cse30 .cse37)) (.cse31 (not (<= 0 .cse43))) (.cse27 (not (= 2 |old(~a2~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or .cse7 (or .cse8 .cse9)) (or .cse10 .cse0 .cse3 .cse11 .cse5 .cse12 .cse13 .cse9) (or .cse13 .cse12 (or .cse10 .cse14 .cse15)) (or .cse10 .cse14 .cse13 .cse16 .cse12) (or (forall ((v_~a0~0_835 Int)) (let ((.cse17 (mod v_~a0~0_835 299926))) (or (not (<= .cse17 (+ |old(~a0~0)| 600000))) (not (<= v_~a0~0_835 |old(~a0~0)|)) (not (< v_~a0~0_835 0)) (= 0 .cse17)))) .cse7 (or .cse18 .cse0 .cse15 .cse3 .cse12)) (or .cse2 .cse0 .cse3 .cse11 .cse15 .cse19 .cse6) (or .cse20 (or (or .cse21 .cse0 .cse15 .cse3 .cse12) .cse22)) (or .cse1 (or .cse10 .cse0 .cse15 .cse22) .cse23) (or .cse10 .cse0 .cse1 .cse3 .cse22 .cse13 .cse9) (or (or .cse24 .cse21) .cse25 (not (<= (+ |old(~a29~0)| 401505) 0)) .cse13) (or .cse26 (or (or .cse0 .cse3 .cse27 .cse19) .cse28 .cse11)) (or (and .cse29 .cse30) (or .cse31 (or .cse10 .cse14 .cse5 .cse11))) (or .cse10 .cse14 .cse15 .cse13 .cse28) (or .cse26 (or .cse4 (or .cse32 .cse27) .cse11)) (or .cse25 .cse32 .cse2 .cse6) (or .cse33 (or .cse22 .cse34)) (or .cse10 .cse13 .cse14 .cse11 .cse19) (or (or (or .cse3 (or .cse21 .cse0 .cse11) .cse19) .cse9) .cse23) (or .cse33 .cse28 .cse34) (or .cse25 (and .cse35 .cse36 .cse30 .cse37) .cse8) (or .cse38 .cse21 .cse0 .cse3 .cse22 .cse5 .cse20 .cse9) (or .cse25 .cse32 .cse5 .cse27 .cse39) (or (or .cse24 .cse38) .cse21 .cse20 .cse16 (not (<= (+ |old(~a29~0)| |old(~a0~0)| 401652) 0))) (or .cse39 .cse0 .cse3 .cse15 .cse22 .cse12 .cse27) (or .cse21 .cse0 .cse3 .cse22 .cse5 .cse31 .cse20) (or (or .cse32 .cse6) .cse4 .cse2) (or .cse25 (and .cse35 (and .cse40 .cse37) .cse30) (or .cse21 .cse0 .cse5) .cse3 .cse11 .cse9) (or .cse0 .cse3 .cse11 .cse5 .cse41 .cse27 .cse19 .cse39) (or .cse25 .cse13 .cse42) (or .cse24 .cse38 .cse5 .cse6 .cse2) (or (or .cse16 (not (< 0 (+ |old(~a29~0)| 144))) .cse42) .cse23) (or .cse13 (and (or .cse10 .cse0 .cse5 .cse3 .cse41 .cse19) (or .cse10 (not (<= 207266 |old(~a29~0)|)) .cse0 .cse3 .cse19)) .cse11) (or .cse0 .cse1 .cse3 .cse22 .cse39 .cse31 .cse27))))) [2019-10-02 01:33:27,873 INFO L443 ceAbstractionStarter]: For program point L1742(lines 1742 1756) no Hoare annotation was computed. [2019-10-02 01:33:27,874 INFO L443 ceAbstractionStarter]: For program point L1709(lines 1709 1756) no Hoare annotation was computed. [2019-10-02 01:33:27,874 INFO L443 ceAbstractionStarter]: For program point L1672(lines 1672 1756) no Hoare annotation was computed. [2019-10-02 01:33:27,874 INFO L443 ceAbstractionStarter]: For program point L1701(lines 1701 1756) no Hoare annotation was computed. [2019-10-02 01:33:27,874 INFO L443 ceAbstractionStarter]: For program point L1668(lines 1668 1756) no Hoare annotation was computed. [2019-10-02 01:33:27,874 INFO L443 ceAbstractionStarter]: For program point L1722(lines 1722 1756) no Hoare annotation was computed. [2019-10-02 01:33:27,874 INFO L443 ceAbstractionStarter]: For program point L1685(lines 1685 1756) no Hoare annotation was computed. [2019-10-02 01:33:27,874 INFO L443 ceAbstractionStarter]: For program point L1710(lines 1710 1721) no Hoare annotation was computed. [2019-10-02 01:33:27,874 INFO L443 ceAbstractionStarter]: For program point L1710-2(lines 1710 1721) no Hoare annotation was computed. [2019-10-02 01:33:27,875 INFO L443 ceAbstractionStarter]: For program point calculate_output2FINAL(lines 1658 1758) no Hoare annotation was computed. [2019-10-02 01:33:27,875 INFO L443 ceAbstractionStarter]: For program point L1706(lines 1706 1756) no Hoare annotation was computed. [2019-10-02 01:33:27,875 INFO L443 ceAbstractionStarter]: For program point L1735(lines 1735 1756) no Hoare annotation was computed. [2019-10-02 01:33:27,875 INFO L443 ceAbstractionStarter]: For program point L1694(lines 1694 1756) no Hoare annotation was computed. [2019-10-02 01:33:27,875 INFO L443 ceAbstractionStarter]: For program point L1661(lines 1661 1756) no Hoare annotation was computed. [2019-10-02 01:33:27,875 INFO L443 ceAbstractionStarter]: For program point L1686(lines 1686 1693) no Hoare annotation was computed. [2019-10-02 01:33:27,875 INFO L443 ceAbstractionStarter]: For program point L1686-2(lines 1686 1693) no Hoare annotation was computed. [2019-10-02 01:33:27,875 INFO L443 ceAbstractionStarter]: For program point L1678(lines 1678 1756) no Hoare annotation was computed. [2019-10-02 01:33:27,875 INFO L443 ceAbstractionStarter]: For program point L234(lines 234 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,876 INFO L443 ceAbstractionStarter]: For program point L168-1(lines 23 1656) no Hoare annotation was computed. [2019-10-02 01:33:27,876 INFO L443 ceAbstractionStarter]: For program point L102-1(lines 23 1656) no Hoare annotation was computed. [2019-10-02 01:33:27,876 INFO L443 ceAbstractionStarter]: For program point L36-1(lines 23 1656) no Hoare annotation was computed. [2019-10-02 01:33:27,876 INFO L443 ceAbstractionStarter]: For program point L895(lines 895 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,876 INFO L443 ceAbstractionStarter]: For program point L829(lines 829 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,876 INFO L443 ceAbstractionStarter]: For program point L433(lines 433 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,876 INFO L443 ceAbstractionStarter]: For program point L367(lines 367 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,876 INFO L443 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2019-10-02 01:33:27,876 INFO L443 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2019-10-02 01:33:27,876 INFO L443 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2019-10-02 01:33:27,876 INFO L443 ceAbstractionStarter]: For program point L830(lines 830 839) no Hoare annotation was computed. [2019-10-02 01:33:27,876 INFO L443 ceAbstractionStarter]: For program point L830-2(lines 830 839) no Hoare annotation was computed. [2019-10-02 01:33:27,876 INFO L443 ceAbstractionStarter]: For program point L1623(lines 1623 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,877 INFO L443 ceAbstractionStarter]: For program point L1359(lines 1359 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,877 INFO L443 ceAbstractionStarter]: For program point L171-1(lines 23 1656) no Hoare annotation was computed. [2019-10-02 01:33:27,877 INFO L443 ceAbstractionStarter]: For program point L1162(lines 1162 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,877 INFO L443 ceAbstractionStarter]: For program point L105-1(lines 23 1656) no Hoare annotation was computed. [2019-10-02 01:33:27,877 INFO L443 ceAbstractionStarter]: For program point L39-1(lines 23 1656) no Hoare annotation was computed. [2019-10-02 01:33:27,877 INFO L443 ceAbstractionStarter]: For program point L1030(lines 1030 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,877 INFO L443 ceAbstractionStarter]: For program point L634(lines 634 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,877 INFO L443 ceAbstractionStarter]: For program point L1559(lines 1559 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,877 INFO L443 ceAbstractionStarter]: For program point L502(lines 502 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,877 INFO L443 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2019-10-02 01:33:27,878 INFO L443 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2019-10-02 01:33:27,878 INFO L443 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2019-10-02 01:33:27,878 INFO L443 ceAbstractionStarter]: For program point L569(lines 569 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,878 INFO L443 ceAbstractionStarter]: For program point L1494(lines 1494 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,878 INFO L443 ceAbstractionStarter]: For program point L1098(lines 1098 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,878 INFO L443 ceAbstractionStarter]: For program point L966(lines 966 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,878 INFO L443 ceAbstractionStarter]: For program point L768(lines 768 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,878 INFO L443 ceAbstractionStarter]: For program point L306(lines 306 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,878 INFO L443 ceAbstractionStarter]: For program point L1231(lines 1231 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,878 INFO L443 ceAbstractionStarter]: For program point L174-1(lines 23 1656) no Hoare annotation was computed. [2019-10-02 01:33:27,879 INFO L443 ceAbstractionStarter]: For program point L108-1(lines 23 1656) no Hoare annotation was computed. [2019-10-02 01:33:27,879 INFO L443 ceAbstractionStarter]: For program point L1099(lines 1099 1107) no Hoare annotation was computed. [2019-10-02 01:33:27,879 INFO L443 ceAbstractionStarter]: For program point L42-1(lines 23 1656) no Hoare annotation was computed. [2019-10-02 01:33:27,879 INFO L443 ceAbstractionStarter]: For program point L1099-2(lines 1099 1107) no Hoare annotation was computed. [2019-10-02 01:33:27,879 INFO L443 ceAbstractionStarter]: For program point L901(lines 901 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,879 INFO L443 ceAbstractionStarter]: For program point L439(lines 439 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,879 INFO L443 ceAbstractionStarter]: For program point L373(lines 373 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,879 INFO L443 ceAbstractionStarter]: For program point L307(lines 307 319) no Hoare annotation was computed. [2019-10-02 01:33:27,879 INFO L443 ceAbstractionStarter]: For program point L241(lines 241 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,879 INFO L443 ceAbstractionStarter]: For program point L307-2(lines 307 319) no Hoare annotation was computed. [2019-10-02 01:33:27,879 INFO L443 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2019-10-02 01:33:27,879 INFO L443 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2019-10-02 01:33:27,880 INFO L443 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2019-10-02 01:33:27,880 INFO L443 ceAbstractionStarter]: For program point L1629(lines 1629 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,880 INFO L443 ceAbstractionStarter]: For program point L1431(lines 1431 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,880 INFO L443 ceAbstractionStarter]: For program point L1365(lines 1365 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,880 INFO L443 ceAbstractionStarter]: For program point L1035(lines 1035 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,880 INFO L443 ceAbstractionStarter]: For program point L507(lines 507 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,880 INFO L443 ceAbstractionStarter]: For program point L1300(lines 1300 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,880 INFO L443 ceAbstractionStarter]: For program point L177-1(lines 23 1656) no Hoare annotation was computed. [2019-10-02 01:33:27,880 INFO L443 ceAbstractionStarter]: For program point L1168(lines 1168 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,880 INFO L443 ceAbstractionStarter]: For program point L111-1(lines 23 1656) no Hoare annotation was computed. [2019-10-02 01:33:27,880 INFO L443 ceAbstractionStarter]: For program point L45-1(lines 23 1656) no Hoare annotation was computed. [2019-10-02 01:33:27,880 INFO L443 ceAbstractionStarter]: For program point L574(lines 574 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,880 INFO L443 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2019-10-02 01:33:27,880 INFO L443 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2019-10-02 01:33:27,880 INFO L443 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2019-10-02 01:33:27,881 INFO L443 ceAbstractionStarter]: For program point L707(lines 707 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,881 INFO L443 ceAbstractionStarter]: For program point L641(lines 641 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,881 INFO L443 ceAbstractionStarter]: For program point L575(lines 575 586) no Hoare annotation was computed. [2019-10-02 01:33:27,881 INFO L443 ceAbstractionStarter]: For program point L1566(lines 1566 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,881 INFO L443 ceAbstractionStarter]: For program point L575-2(lines 575 586) no Hoare annotation was computed. [2019-10-02 01:33:27,881 INFO L443 ceAbstractionStarter]: For program point L1038(lines 1038 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,881 INFO L443 ceAbstractionStarter]: For program point L840(lines 840 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,881 INFO L443 ceAbstractionStarter]: For program point L774(lines 774 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,881 INFO L443 ceAbstractionStarter]: For program point L642(lines 642 651) no Hoare annotation was computed. [2019-10-02 01:33:27,881 INFO L443 ceAbstractionStarter]: For program point L642-2(lines 642 651) no Hoare annotation was computed. [2019-10-02 01:33:27,881 INFO L443 ceAbstractionStarter]: For program point L1501(lines 1501 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,881 INFO L443 ceAbstractionStarter]: For program point L1237(lines 1237 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,881 INFO L443 ceAbstractionStarter]: For program point L180-1(lines 23 1656) no Hoare annotation was computed. [2019-10-02 01:33:27,881 INFO L443 ceAbstractionStarter]: For program point L114-1(lines 23 1656) no Hoare annotation was computed. [2019-10-02 01:33:27,881 INFO L443 ceAbstractionStarter]: For program point L48-1(lines 23 1656) no Hoare annotation was computed. [2019-10-02 01:33:27,882 INFO L443 ceAbstractionStarter]: For program point L973(lines 973 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,882 INFO L443 ceAbstractionStarter]: For program point L907(lines 907 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,882 INFO L443 ceAbstractionStarter]: For program point L445(lines 445 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,882 INFO L443 ceAbstractionStarter]: For program point L247(lines 247 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,882 INFO L443 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2019-10-02 01:33:27,882 INFO L443 ceAbstractionStarter]: For program point L1172(lines 1172 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,882 INFO L443 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2019-10-02 01:33:27,882 INFO L443 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2019-10-02 01:33:27,882 INFO L443 ceAbstractionStarter]: For program point L1635(lines 1635 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,882 INFO L443 ceAbstractionStarter]: For program point L380(lines 380 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,882 INFO L443 ceAbstractionStarter]: For program point L1371(lines 1371 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,882 INFO L443 ceAbstractionStarter]: For program point L1570(lines 1570 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,883 INFO L443 ceAbstractionStarter]: For program point L1438(lines 1438 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,883 INFO L443 ceAbstractionStarter]: For program point L1306(lines 1306 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,883 INFO L443 ceAbstractionStarter]: For program point L183-1(lines 23 1656) no Hoare annotation was computed. [2019-10-02 01:33:27,883 INFO L443 ceAbstractionStarter]: For program point L117-1(lines 23 1656) no Hoare annotation was computed. [2019-10-02 01:33:27,883 INFO L443 ceAbstractionStarter]: For program point L1108(lines 1108 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,883 INFO L443 ceAbstractionStarter]: For program point L51-1(lines 23 1656) no Hoare annotation was computed. [2019-10-02 01:33:27,883 INFO L443 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 23 1656) no Hoare annotation was computed. [2019-10-02 01:33:27,883 INFO L443 ceAbstractionStarter]: For program point L712(lines 712 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,883 INFO L443 ceAbstractionStarter]: For program point L1571(lines 1571 1581) no Hoare annotation was computed. [2019-10-02 01:33:27,883 INFO L443 ceAbstractionStarter]: For program point L514(lines 514 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,883 INFO L443 ceAbstractionStarter]: For program point L1571-2(lines 1571 1581) no Hoare annotation was computed. [2019-10-02 01:33:27,884 INFO L443 ceAbstractionStarter]: For program point L1439(lines 1439 1448) no Hoare annotation was computed. [2019-10-02 01:33:27,884 INFO L443 ceAbstractionStarter]: For program point L1439-2(lines 1439 1448) no Hoare annotation was computed. [2019-10-02 01:33:27,884 INFO L443 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2019-10-02 01:33:27,884 INFO L443 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2019-10-02 01:33:27,884 INFO L443 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2019-10-02 01:33:27,884 INFO L443 ceAbstractionStarter]: For program point L845(lines 845 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,884 INFO L443 ceAbstractionStarter]: For program point L779(lines 779 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,884 INFO L443 ceAbstractionStarter]: For program point L449(lines 449 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,884 INFO L443 ceAbstractionStarter]: For program point L1044(lines 1044 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,884 INFO L443 ceAbstractionStarter]: For program point L912(lines 912 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,885 INFO L443 ceAbstractionStarter]: For program point L384(lines 384 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,885 INFO L443 ceAbstractionStarter]: For program point L1243(lines 1243 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,885 INFO L443 ceAbstractionStarter]: For program point L186-1(lines 23 1656) no Hoare annotation was computed. [2019-10-02 01:33:27,885 INFO L443 ceAbstractionStarter]: For program point L120-1(lines 23 1656) no Hoare annotation was computed. [2019-10-02 01:33:27,885 INFO L443 ceAbstractionStarter]: For program point L54-1(lines 23 1656) no Hoare annotation was computed. [2019-10-02 01:33:27,885 INFO L443 ceAbstractionStarter]: For program point L979(lines 979 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,885 INFO L443 ceAbstractionStarter]: For program point L1640(lines 1640 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,885 INFO L443 ceAbstractionStarter]: For program point L1508(lines 1508 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,885 INFO L443 ceAbstractionStarter]: For program point L253(lines 253 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,885 INFO L443 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2019-10-02 01:33:27,886 INFO L443 ceAbstractionStarter]: For program point L1178(lines 1178 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,886 INFO L443 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2019-10-02 01:33:27,886 INFO L443 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2019-10-02 01:33:27,886 INFO L443 ceAbstractionStarter]: For program point L320(lines 320 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,886 INFO L443 ceAbstractionStarter]: For program point L1378(lines 1378 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,886 INFO L443 ceAbstractionStarter]: For program point L189-1(lines 23 1656) no Hoare annotation was computed. [2019-10-02 01:33:27,886 INFO L443 ceAbstractionStarter]: For program point L123-1(lines 23 1656) no Hoare annotation was computed. [2019-10-02 01:33:27,886 INFO L443 ceAbstractionStarter]: For program point L57-1(lines 23 1656) no Hoare annotation was computed. [2019-10-02 01:33:27,886 INFO L443 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 196) no Hoare annotation was computed. [2019-10-02 01:33:27,887 INFO L443 ceAbstractionStarter]: For program point L718(lines 718 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,887 INFO L443 ceAbstractionStarter]: For program point L652(lines 652 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,887 INFO L443 ceAbstractionStarter]: For program point L520(lines 520 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,888 INFO L443 ceAbstractionStarter]: For program point L1511(lines 1511 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,889 INFO L443 ceAbstractionStarter]: For program point L1313(lines 1313 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,889 INFO L443 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2019-10-02 01:33:27,889 INFO L443 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2019-10-02 01:33:27,889 INFO L443 ceAbstractionStarter]: For program point L1115(lines 1115 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,889 INFO L443 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2019-10-02 01:33:27,889 INFO L443 ceAbstractionStarter]: For program point L1049(lines 1049 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,889 INFO L443 ceAbstractionStarter]: For program point L851(lines 851 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,889 INFO L443 ceAbstractionStarter]: For program point L587(lines 587 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,889 INFO L443 ceAbstractionStarter]: For program point L521(lines 521 528) no Hoare annotation was computed. [2019-10-02 01:33:27,889 INFO L443 ceAbstractionStarter]: For program point L521-2(lines 521 528) no Hoare annotation was computed. [2019-10-02 01:33:27,890 INFO L443 ceAbstractionStarter]: For program point L1050(lines 1050 1061) no Hoare annotation was computed. [2019-10-02 01:33:27,890 INFO L443 ceAbstractionStarter]: For program point L1050-2(lines 1050 1061) no Hoare annotation was computed. [2019-10-02 01:33:27,890 INFO L443 ceAbstractionStarter]: For program point L786(lines 786 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,890 INFO L439 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 23 1656) the Hoare annotation is: (let ((.cse8 (= ~a29~0 |old(~a29~0)|)) (.cse38 (= ~a2~0 |old(~a2~0)|)) (.cse11 (= ~a4~0 |old(~a4~0)|))) (let ((.cse43 (+ |old(~a0~0)| 147)) (.cse4 (not (<= 0 (+ |old(~a4~0)| 85)))) (.cse2 (not (<= (+ |old(~a4~0)| 42) 0))) (.cse23 (not (< 43 |old(~a29~0)|))) (.cse32 (not (= 3 |old(~a2~0)|))) (.cse17 (not (<= (+ |old(~a0~0)| 104) 0))) (.cse44 (= 3 ~a2~0)) (.cse42 (= 2 ~a2~0)) (.cse45 (+ |old(~a29~0)| 127)) (.cse1 (not (= 1 |old(~a2~0)|))) (.cse10 (= ~a0~0 |old(~a0~0)|)) (.cse47 (and .cse8 .cse38 .cse11)) (.cse3 (not (<= |old(~a29~0)| 43))) (.cse41 (not (= 4 |old(~a2~0)|))) (.cse15 (not (<= (+ |old(~a4~0)| 89) 0)))) (let ((.cse12 (or .cse3 (or .cse41 .cse15))) (.cse25 (and .cse10 .cse47)) (.cse28 (or .cse15 .cse1)) (.cse18 (not (<= 0 .cse45))) (.cse36 (and (and .cse8 .cse42 .cse11) .cse10)) (.cse7 (and .cse47 .cse10)) (.cse20 (forall ((v_prenex_1 Int)) (let ((.cse46 (mod (+ v_prenex_1 11) 29))) (or (not (<= .cse46 (+ |old(~a29~0)| 14))) (not (< (+ v_prenex_1 371124) 0)) (= .cse46 0))))) (.cse27 (and .cse8 (= 1 ~a2~0) .cse10 .cse11)) (.cse0 (not (<= (+ |old(~a0~0)| 61) 0))) (.cse35 (or .cse15 (= 5 |old(~a2~0)|))) (.cse19 (and .cse8 .cse42 .cse10 .cse11)) (.cse9 (= 4 ~a2~0)) (.cse16 (not (<= .cse45 0))) (.cse37 (not (<= 0 (+ |old(~a29~0)| 600001)))) (.cse21 (not (= 2 |old(~a2~0)|))) (.cse22 (not (<= (+ |old(~a0~0)| 98) 0))) (.cse29 (not (<= (+ (* 5 |old(~a0~0)|) 779) |old(~a29~0)|))) (.cse31 (and .cse8 .cse10 .cse44 .cse11)) (.cse39 (not (<= (+ |old(~a4~0)| 86) 0))) (.cse33 (and .cse10 (and (and (<= 0 (+ ~a4~0 85)) (<= ~a2~0 |old(~a2~0)|) (<= (+ ~a4~0 42) 0) .cse44 .cse11 (< 43 ~a29~0)) .cse8 (<= (+ ~a0~0 104) 0)))) (.cse24 (and .cse41 (not (<= 48792 |old(~a29~0)|)))) (.cse34 (or (or .cse4 (or .cse2 .cse23 .cse32)) .cse17)) (.cse5 (not (< 0 .cse43))) (.cse30 (not (<= .cse43 0))) (.cse13 (and .cse8 .cse38 .cse10 .cse11)) (.cse14 (not (<= 4 |old(~a2~0)|))) (.cse26 (not (<= 0 (+ |old(~a0~0)| 600000)))) (.cse6 (not (<= 0 (+ |old(~a29~0)| 599991))))) (and (or .cse0 (or .cse1 .cse2 .cse3) .cse4 .cse5 .cse6 .cse7) (or .cse0 (and .cse8 .cse9 .cse10 .cse11) .cse12) (or .cse13 (or .cse14 .cse15 .cse16) .cse17) (or (or (or .cse14 .cse15 .cse3 .cse5) .cse18) .cse7) (or .cse2 .cse4 .cse5 .cse3 .cse19 .cse20 .cse21 .cse22) (or .cse13 .cse17 (or .cse14 .cse15 .cse23)) (or .cse14 .cse15 .cse23 .cse24 .cse13) (or (or (or .cse4 .cse22 (or .cse1 .cse2 .cse5)) .cse6) .cse25) (or .cse1 .cse2 .cse3 .cse4 .cse18 .cse26 .cse27) (or (and .cse10 (and .cse8 .cse9 .cse11)) (or .cse12 .cse6)) (or (or .cse16 .cse28) .cse25) (or .cse27 .cse29 .cse1 .cse2 .cse4 .cse26 .cse17 .cse6) (or .cse2 .cse30 .cse4 .cse31 .cse3 .cse32 .cse6) (or .cse0 .cse28 .cse13) (or .cse19 .cse30 .cse4 .cse18 .cse2 .cse21 .cse26) (or .cse2 .cse31 .cse4 .cse5 .cse23 .cse22 .cse32) (or .cse33 (or .cse34 .cse26)) (or .cse0 .cse35 .cse31 .cse32) (or .cse14 .cse15 .cse13 .cse5 .cse22) (or (or (or .cse2 .cse4 .cse17 .cse21) .cse23 .cse5) .cse36) (or (or .cse37 (or .cse35 .cse21) .cse5) .cse36) (or .cse30 .cse7 (or (or .cse14 .cse2 .cse23) .cse26)) (or (or .cse35 .cse32) .cse31 .cse37) (or (and .cse11 .cse8 .cse38 .cse10) (and (or .cse14 .cse2 .cse3 .cse4 .cse20 .cse22) (or .cse14 (not (<= 207266 |old(~a29~0)|)) .cse2 .cse4 .cse22)) .cse5) (or (or .cse39 .cse29) .cse1 .cse27 .cse16 (not (<= (+ |old(~a29~0)| |old(~a0~0)| 401652) 0))) (or .cse0 .cse35 .cse3 .cse21 .cse19) (or (forall ((v_~a0~0_835 Int)) (let ((.cse40 (mod v_~a0~0_835 299926))) (or (not (<= .cse40 (+ |old(~a0~0)| 600000))) (not (<= v_~a0~0_835 |old(~a0~0)|)) (not (< v_~a0~0_835 0)) (= 0 .cse40)))) (or .cse41 .cse2 .cse23 .cse4 .cse17) (and .cse8 .cse10 (and .cse9 .cse11))) (or .cse31 .cse30 (or .cse2 .cse16 .cse32) .cse4 .cse37) (or (or .cse24 (or .cse2 .cse4 .cse5 .cse21 .cse22)) (and .cse10 (and .cse8 (and .cse42 .cse11)))) (or .cse39 .cse29 .cse3 .cse32 .cse31) (or (or .cse39 .cse1) (not (<= (+ |old(~a29~0)| 401505) 0)) .cse13) (or .cse33 .cse24 .cse34) (or .cse14 .cse2 .cse4 .cse13 .cse5 .cse3 .cse17 .cse6) (or .cse30 .cse13 .cse4 (or .cse14 .cse2) .cse26 .cse6))))) [2019-10-02 01:33:27,890 INFO L443 ceAbstractionStarter]: For program point L456(lines 456 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,890 INFO L443 ceAbstractionStarter]: For program point L390(lines 390 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,890 INFO L443 ceAbstractionStarter]: For program point L1249(lines 1249 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,891 INFO L443 ceAbstractionStarter]: For program point L192-1(lines 23 1656) no Hoare annotation was computed. [2019-10-02 01:33:27,891 INFO L443 ceAbstractionStarter]: For program point L126-1(lines 23 1656) no Hoare annotation was computed. [2019-10-02 01:33:27,891 INFO L443 ceAbstractionStarter]: For program point L60-1(lines 23 1656) no Hoare annotation was computed. [2019-10-02 01:33:27,891 INFO L443 ceAbstractionStarter]: For program point L985(lines 985 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,891 INFO L443 ceAbstractionStarter]: For program point L919(lines 919 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,891 INFO L443 ceAbstractionStarter]: For program point L391(lines 391 402) no Hoare annotation was computed. [2019-10-02 01:33:27,891 INFO L443 ceAbstractionStarter]: For program point L391-2(lines 391 402) no Hoare annotation was computed. [2019-10-02 01:33:27,891 INFO L443 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2019-10-02 01:33:27,891 INFO L443 ceAbstractionStarter]: For program point L1184(lines 1184 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,892 INFO L443 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2019-10-02 01:33:27,892 INFO L443 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2019-10-02 01:33:27,892 INFO L443 ceAbstractionStarter]: For program point L1647(lines 1647 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,892 INFO L443 ceAbstractionStarter]: For program point L1449(lines 1449 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,892 INFO L443 ceAbstractionStarter]: For program point L1317(lines 1317 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,892 INFO L443 ceAbstractionStarter]: For program point L260(lines 260 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,892 INFO L443 ceAbstractionStarter]: For program point L855(lines 855 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,892 INFO L443 ceAbstractionStarter]: For program point L657(lines 657 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,892 INFO L443 ceAbstractionStarter]: For program point L1582(lines 1582 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,893 INFO L443 ceAbstractionStarter]: For program point L1516(lines 1516 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,893 INFO L443 ceAbstractionStarter]: For program point L327(lines 327 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,893 INFO L443 ceAbstractionStarter]: For program point L195-1(lines 23 1656) no Hoare annotation was computed. [2019-10-02 01:33:27,893 INFO L443 ceAbstractionStarter]: For program point L129-1(lines 23 1656) no Hoare annotation was computed. [2019-10-02 01:33:27,893 INFO L443 ceAbstractionStarter]: For program point L63-1(lines 23 1656) no Hoare annotation was computed. [2019-10-02 01:33:27,893 INFO L443 ceAbstractionStarter]: For program point L1385(lines 1385 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,893 INFO L443 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2019-10-02 01:33:27,893 INFO L443 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2019-10-02 01:33:27,893 INFO L443 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2019-10-02 01:33:27,894 INFO L443 ceAbstractionStarter]: For program point L725(lines 725 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,894 INFO L443 ceAbstractionStarter]: For program point L1122(lines 1122 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,894 INFO L443 ceAbstractionStarter]: For program point L594(lines 594 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,894 INFO L443 ceAbstractionStarter]: For program point L462(lines 462 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,894 INFO L443 ceAbstractionStarter]: For program point L1321(lines 1321 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,894 INFO L443 ceAbstractionStarter]: For program point L1255(lines 1255 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,894 INFO L443 ceAbstractionStarter]: For program point L198-1(lines 23 1656) no Hoare annotation was computed. [2019-10-02 01:33:27,894 INFO L443 ceAbstractionStarter]: For program point L132-1(lines 23 1656) no Hoare annotation was computed. [2019-10-02 01:33:27,895 INFO L443 ceAbstractionStarter]: For program point L66-1(lines 23 1656) no Hoare annotation was computed. [2019-10-02 01:33:27,895 INFO L443 ceAbstractionStarter]: For program point L925(lines 925 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,895 INFO L443 ceAbstractionStarter]: For program point L793(lines 793 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,895 INFO L443 ceAbstractionStarter]: For program point L595(lines 595 605) no Hoare annotation was computed. [2019-10-02 01:33:27,895 INFO L443 ceAbstractionStarter]: For program point L529(lines 529 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,895 INFO L443 ceAbstractionStarter]: For program point L595-2(lines 595 605) no Hoare annotation was computed. [2019-10-02 01:33:27,895 INFO L443 ceAbstractionStarter]: For program point L1388(lines 1388 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,895 INFO L443 ceAbstractionStarter]: For program point L1322(lines 1322 1332) no Hoare annotation was computed. [2019-10-02 01:33:27,895 INFO L443 ceAbstractionStarter]: For program point L1322-2(lines 1322 1332) no Hoare annotation was computed. [2019-10-02 01:33:27,896 INFO L443 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2019-10-02 01:33:27,896 INFO L443 ceAbstractionStarter]: For program point L1190(lines 1190 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,896 INFO L443 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2019-10-02 01:33:27,896 INFO L443 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2019-10-02 01:33:27,896 INFO L443 ceAbstractionStarter]: For program point L992(lines 992 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,896 INFO L443 ceAbstractionStarter]: For program point L794(lines 794 803) no Hoare annotation was computed. [2019-10-02 01:33:27,896 INFO L443 ceAbstractionStarter]: For program point L794-2(lines 794 803) no Hoare annotation was computed. [2019-10-02 01:33:27,896 INFO L443 ceAbstractionStarter]: For program point L662(lines 662 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,896 INFO L443 ceAbstractionStarter]: For program point L530(lines 530 541) no Hoare annotation was computed. [2019-10-02 01:33:27,896 INFO L443 ceAbstractionStarter]: For program point L530-2(lines 530 541) no Hoare annotation was computed. [2019-10-02 01:33:27,897 INFO L443 ceAbstractionStarter]: For program point L266(lines 266 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,897 INFO L443 ceAbstractionStarter]: For program point L1522(lines 1522 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,897 INFO L443 ceAbstractionStarter]: For program point L1456(lines 1456 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,897 INFO L443 ceAbstractionStarter]: For program point L333(lines 333 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,897 INFO L443 ceAbstractionStarter]: For program point L201-1(lines 23 1656) no Hoare annotation was computed. [2019-10-02 01:33:27,897 INFO L443 ceAbstractionStarter]: For program point L135-1(lines 23 1656) no Hoare annotation was computed. [2019-10-02 01:33:27,897 INFO L443 ceAbstractionStarter]: For program point L69-1(lines 23 1656) no Hoare annotation was computed. [2019-10-02 01:33:27,897 INFO L443 ceAbstractionStarter]: For program point L862(lines 862 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,898 INFO L439 ceAbstractionStarter]: At program point L1655(line 1655) the Hoare annotation is: (let ((.cse9 (= ~a29~0 |old(~a29~0)|)) (.cse27 (= ~a2~0 |old(~a2~0)|)) (.cse12 (= ~a4~0 |old(~a4~0)|)) (.cse47 (+ |old(~a0~0)| 147)) (.cse4 (not (<= (+ |old(~a4~0)| 89) 0)))) (let ((.cse20 (not (<= 0 (+ |old(~a4~0)| 85)))) (.cse18 (not (<= (+ |old(~a4~0)| 42) 0))) (.cse7 (not (<= (+ |old(~a0~0)| 104) 0))) (.cse44 (= 1 ~a2~0)) (.cse43 (= 3 ~a2~0)) (.cse39 (= 2 ~a2~0)) (.cse42 (or .cse4 (= 5 |old(~a2~0)|))) (.cse21 (not (= 3 |old(~a2~0)|))) (.cse33 (not (< 43 |old(~a29~0)|))) (.cse49 (+ |old(~a4~0)| 86)) (.cse15 (not (< 0 .cse47))) (.cse50 (+ |old(~a29~0)| 127)) (.cse25 (not (= 1 |old(~a2~0)|))) (.cse46 (and .cse9 .cse27 .cse12)) (.cse11 (= ~a0~0 |old(~a0~0)|)) (.cse14 (not (<= |old(~a29~0)| 43))) (.cse32 (not (= 4 |old(~a2~0)|)))) (let ((.cse13 (or .cse14 (or .cse32 .cse4))) (.cse10 (= 4 ~a2~0)) (.cse17 (and .cse46 .cse11)) (.cse35 (or .cse4 .cse25)) (.cse16 (not (<= 0 .cse50))) (.cse23 (and .cse33 (or .cse32 (and (not (< 0 .cse49)) .cse15 (not (<= (+ |old(~a29~0)| 16) 0)))))) (.cse1 (or .cse42 .cse14 .cse21)) (.cse8 (not (<= (+ |old(~a0~0)| 61) 0))) (.cse30 (and .cse9 .cse39 .cse11 .cse12)) (.cse26 (<= (+ ~a0~0 61) 0)) (.cse28 (not (= 2 |old(~a2~0)|))) (.cse5 (not (<= .cse50 0))) (.cse2 (not (<= 0 (+ |old(~a29~0)| 600001)))) (.cse24 (not (<= .cse49 0))) (.cse0 (and .cse9 .cse11 .cse43 .cse12)) (.cse41 (not (<= (+ (* 5 |old(~a0~0)|) 779) |old(~a29~0)|))) (.cse40 (and .cse9 .cse44 .cse11 .cse12)) (.cse37 (and (<= (+ ~a0~0 104) 0) .cse11 (and (<= 0 (+ ~a4~0 85)) (<= (+ ~a4~0 42) 0) .cse9 .cse27 .cse43 .cse12 (< 43 ~a29~0)))) (.cse36 (and .cse32 (not (<= 48792 |old(~a29~0)|)))) (.cse38 (or (or .cse20 (or .cse18 .cse33 .cse21)) .cse7)) (.cse45 (forall ((v_prenex_1 Int)) (let ((.cse48 (mod (+ v_prenex_1 11) 29))) (or (not (<= .cse48 (+ |old(~a29~0)| 14))) (not (< (+ v_prenex_1 371124) 0)) (= .cse48 0))))) (.cse34 (not (<= (+ |old(~a0~0)| 98) 0))) (.cse19 (not (<= .cse47 0))) (.cse6 (and .cse9 .cse27 .cse11 .cse12)) (.cse3 (not (<= 4 |old(~a2~0)|))) (.cse29 (not (<= 0 (+ |old(~a0~0)| 600000)))) (.cse22 (not (<= 0 (+ |old(~a29~0)| 599991))))) (and (or .cse0 .cse1 .cse2) (or (or .cse3 .cse4 .cse5) .cse6 .cse7) (or .cse8 (and .cse9 .cse10 .cse11 .cse12) .cse13) (or (or (or .cse3 .cse4 .cse14 .cse15) .cse16) .cse17) (or .cse18 .cse19 .cse0 .cse20 .cse14 .cse21 .cse22) (or .cse6 .cse23 (or .cse3 .cse4 .cse7)) (or (or .cse24 .cse25) (not (<= (+ |old(~a29~0)| 401505) 0)) (and .cse26 .cse9 .cse27 .cse11 .cse12)) (or .cse19 .cse20 .cse16 .cse18 .cse28 .cse29 .cse30) (or (or .cse13 .cse22) (and (and (and .cse9 .cse12) .cse10) .cse11)) (or (forall ((v_~a0~0_835 Int)) (let ((.cse31 (mod v_~a0~0_835 299926))) (or (not (<= .cse31 (+ |old(~a0~0)| 600000))) (not (<= v_~a0~0_835 |old(~a0~0)|)) (not (< v_~a0~0_835 0)) (= 0 .cse31)))) (or .cse32 .cse18 .cse33 .cse20 .cse7) (and .cse11 (and .cse9 .cse10 .cse12))) (or (or (or .cse20 .cse34 (or .cse25 .cse18 .cse15)) .cse22) .cse17) (or .cse8 .cse35 .cse6) (or .cse3 .cse4 .cse33 .cse6 .cse36) (or .cse3 .cse6 .cse4 .cse15 .cse34) (or (or .cse20 (or .cse18 .cse33 .cse15 .cse21) .cse34) .cse0) (or .cse37 (or .cse38 .cse29)) (or (or .cse5 .cse35) (and (and .cse9 .cse27 .cse12 (or (< 0 (+ ~a29~0 144)) .cse26)) .cse11)) (or (and .cse11 (and .cse9 .cse39 .cse12)) (or .cse36 (or .cse18 .cse20 .cse15 .cse28 .cse34))) (or .cse25 .cse18 .cse14 .cse40 .cse20 .cse16 .cse29) (or (or .cse24 .cse41) .cse25 .cse40 .cse5 (not (<= (+ |old(~a29~0)| |old(~a0~0)| 401652) 0))) (or .cse8 .cse42 .cse14 .cse28 .cse30) (or (or (or .cse18 .cse20 .cse7 .cse28) .cse23 .cse15) .cse30) (or .cse8 .cse1 .cse0) (or (and (and .cse9 .cse12 .cse43) .cse11) (or .cse42 .cse33 .cse21)) (or .cse8 (and .cse9 (and .cse44 .cse12) .cse11) (or .cse25 .cse18 .cse14) .cse20 .cse15 .cse22) (or .cse18 .cse20 .cse15 .cse14 .cse45 .cse28 .cse34 .cse30) (or (and .cse11 (and .cse9 .cse39 (or (< 0 (+ ~a29~0 16)) (not (= 3 calculate_output_~input)) .cse26) .cse12)) (or .cse2 (or .cse42 .cse28) .cse15)) (or .cse0 .cse19 (or .cse18 .cse5 .cse21) .cse20 .cse2) (or .cse24 .cse41 .cse14 .cse21 .cse0) (or .cse41 .cse25 .cse18 .cse20 .cse40 .cse29 .cse7 .cse22) (or .cse19 (or (or .cse3 .cse18 .cse33) .cse29) (and .cse11 .cse46)) (or .cse37 .cse36 .cse38) (or .cse3 .cse18 .cse20 .cse6 .cse15 .cse14 .cse7 .cse22) (or .cse6 (and (or .cse3 .cse18 .cse14 .cse20 .cse45 .cse34) (or .cse3 (not (<= 207266 |old(~a29~0)|)) .cse18 .cse20 .cse34)) .cse15) (or .cse19 .cse6 .cse20 (or .cse3 .cse18) .cse29 .cse22))))) [2019-10-02 01:33:27,898 INFO L443 ceAbstractionStarter]: For program point L1655-1(line 1655) no Hoare annotation was computed. [2019-10-02 01:33:27,899 INFO L443 ceAbstractionStarter]: For program point L1589(lines 1589 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,900 INFO L443 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2019-10-02 01:33:27,900 INFO L443 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2019-10-02 01:33:27,900 INFO L443 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2019-10-02 01:33:27,900 INFO L443 ceAbstractionStarter]: For program point L1128(lines 1128 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,900 INFO L443 ceAbstractionStarter]: For program point L1062(lines 1062 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,901 INFO L443 ceAbstractionStarter]: For program point L930(lines 930 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,901 INFO L443 ceAbstractionStarter]: For program point L732(lines 732 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,902 INFO L443 ceAbstractionStarter]: For program point L468(lines 468 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,902 INFO L443 ceAbstractionStarter]: For program point L336(lines 336 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,902 INFO L443 ceAbstractionStarter]: For program point L1261(lines 1261 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,903 INFO L443 ceAbstractionStarter]: For program point L204-1(lines 23 1656) no Hoare annotation was computed. [2019-10-02 01:33:27,903 INFO L443 ceAbstractionStarter]: For program point L138-1(lines 23 1656) no Hoare annotation was computed. [2019-10-02 01:33:27,903 INFO L443 ceAbstractionStarter]: For program point L72-1(lines 23 1656) no Hoare annotation was computed. [2019-10-02 01:33:27,903 INFO L443 ceAbstractionStarter]: For program point L1063(lines 1063 1073) no Hoare annotation was computed. [2019-10-02 01:33:27,903 INFO L443 ceAbstractionStarter]: For program point L1063-2(lines 1063 1073) no Hoare annotation was computed. [2019-10-02 01:33:27,903 INFO L443 ceAbstractionStarter]: For program point L403(lines 403 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,903 INFO L443 ceAbstractionStarter]: For program point L1394(lines 1394 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,905 INFO L443 ceAbstractionStarter]: For program point L205(line 205) no Hoare annotation was computed. [2019-10-02 01:33:27,905 INFO L443 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2019-10-02 01:33:27,905 INFO L443 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2019-10-02 01:33:27,906 INFO L443 ceAbstractionStarter]: For program point L998(lines 998 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,906 INFO L443 ceAbstractionStarter]: For program point L668(lines 668 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,906 INFO L443 ceAbstractionStarter]: For program point L1461(lines 1461 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,906 INFO L443 ceAbstractionStarter]: For program point L1395(lines 1395 1407) no Hoare annotation was computed. [2019-10-02 01:33:27,906 INFO L443 ceAbstractionStarter]: For program point L1395-2(lines 1395 1407) no Hoare annotation was computed. [2019-10-02 01:33:27,906 INFO L443 ceAbstractionStarter]: For program point L1197(lines 1197 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,906 INFO L443 ceAbstractionStarter]: For program point L735(lines 735 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,906 INFO L443 ceAbstractionStarter]: For program point L1528(lines 1528 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,906 INFO L443 ceAbstractionStarter]: For program point L273(lines 273 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,906 INFO L443 ceAbstractionStarter]: For program point L1264(lines 1264 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,907 INFO L443 ceAbstractionStarter]: For program point L141-1(lines 23 1656) no Hoare annotation was computed. [2019-10-02 01:33:27,907 INFO L443 ceAbstractionStarter]: For program point L75-1(lines 23 1656) no Hoare annotation was computed. [2019-10-02 01:33:27,907 INFO L443 ceAbstractionStarter]: For program point L868(lines 868 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,907 INFO L443 ceAbstractionStarter]: For program point L1595(lines 1595 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,907 INFO L443 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2019-10-02 01:33:27,907 INFO L443 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2019-10-02 01:33:27,907 INFO L443 ceAbstractionStarter]: For program point L935(lines 935 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,907 INFO L443 ceAbstractionStarter]: For program point L341(lines 341 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,907 INFO L443 ceAbstractionStarter]: For program point L1134(lines 1134 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,907 INFO L443 ceAbstractionStarter]: For program point L804(lines 804 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,907 INFO L443 ceAbstractionStarter]: For program point L606(lines 606 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,908 INFO L443 ceAbstractionStarter]: For program point L474(lines 474 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,908 INFO L443 ceAbstractionStarter]: For program point L408(lines 408 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,908 INFO L443 ceAbstractionStarter]: For program point L342(lines 342 349) no Hoare annotation was computed. [2019-10-02 01:33:27,908 INFO L443 ceAbstractionStarter]: For program point L1333(lines 1333 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,908 INFO L443 ceAbstractionStarter]: For program point L342-2(lines 342 349) no Hoare annotation was computed. [2019-10-02 01:33:27,908 INFO L443 ceAbstractionStarter]: For program point L144-1(lines 23 1656) no Hoare annotation was computed. [2019-10-02 01:33:27,908 INFO L443 ceAbstractionStarter]: For program point L1135(lines 1135 1144) no Hoare annotation was computed. [2019-10-02 01:33:27,908 INFO L443 ceAbstractionStarter]: For program point L78-1(lines 23 1656) no Hoare annotation was computed. [2019-10-02 01:33:27,908 INFO L443 ceAbstractionStarter]: For program point L1135-2(lines 1135 1144) no Hoare annotation was computed. [2019-10-02 01:33:27,908 INFO L443 ceAbstractionStarter]: For program point L1466(lines 1466 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,909 INFO L443 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2019-10-02 01:33:27,909 INFO L443 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2019-10-02 01:33:27,909 INFO L443 ceAbstractionStarter]: For program point L1004(lines 1004 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,909 INFO L443 ceAbstractionStarter]: For program point L542(lines 542 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,909 INFO L443 ceAbstractionStarter]: For program point L1533(lines 1533 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,909 INFO L443 ceAbstractionStarter]: For program point L278(lines 278 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,909 INFO L443 ceAbstractionStarter]: For program point L1203(lines 1203 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,909 INFO L443 ceAbstractionStarter]: For program point L675(lines 675 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,909 INFO L443 ceAbstractionStarter]: For program point L147-1(lines 23 1656) no Hoare annotation was computed. [2019-10-02 01:33:27,909 INFO L443 ceAbstractionStarter]: For program point L81-1(lines 23 1656) no Hoare annotation was computed. [2019-10-02 01:33:27,910 INFO L443 ceAbstractionStarter]: For program point L874(lines 874 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,910 INFO L443 ceAbstractionStarter]: For program point L742(lines 742 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,910 INFO L443 ceAbstractionStarter]: For program point L1271(lines 1271 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,910 INFO L443 ceAbstractionStarter]: For program point L214(lines 214 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,910 INFO L443 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2019-10-02 01:33:27,910 INFO L443 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2019-10-02 01:33:27,910 INFO L443 ceAbstractionStarter]: For program point L1602(lines 1602 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,910 INFO L443 ceAbstractionStarter]: For program point L479(lines 479 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,910 INFO L443 ceAbstractionStarter]: For program point L1338(lines 1338 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,910 INFO L443 ceAbstractionStarter]: For program point L1074(lines 1074 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,910 INFO L443 ceAbstractionStarter]: For program point L942(lines 942 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,911 INFO L443 ceAbstractionStarter]: For program point L546(lines 546 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,911 INFO L443 ceAbstractionStarter]: For program point L150-1(lines 23 1656) no Hoare annotation was computed. [2019-10-02 01:33:27,911 INFO L443 ceAbstractionStarter]: For program point L84-1(lines 23 1656) no Hoare annotation was computed. [2019-10-02 01:33:27,911 INFO L443 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 23 1656) no Hoare annotation was computed. [2019-10-02 01:33:27,911 INFO L443 ceAbstractionStarter]: For program point L811(lines 811 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,911 INFO L443 ceAbstractionStarter]: For program point L613(lines 613 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,911 INFO L443 ceAbstractionStarter]: For program point L547(lines 547 556) no Hoare annotation was computed. [2019-10-02 01:33:27,911 INFO L443 ceAbstractionStarter]: For program point L547-2(lines 547 556) no Hoare annotation was computed. [2019-10-02 01:33:27,911 INFO L443 ceAbstractionStarter]: For program point L415(lines 415 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,912 INFO L443 ceAbstractionStarter]: For program point L1208(lines 1208 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,912 INFO L443 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2019-10-02 01:33:27,912 INFO L443 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2019-10-02 01:33:27,912 INFO L443 ceAbstractionStarter]: For program point L1473(lines 1473 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,912 INFO L443 ceAbstractionStarter]: For program point L350(lines 350 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,912 INFO L443 ceAbstractionStarter]: For program point L1011(lines 1011 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,912 INFO L443 ceAbstractionStarter]: For program point L681(lines 681 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,912 INFO L443 ceAbstractionStarter]: For program point L1606(lines 1606 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,912 INFO L443 ceAbstractionStarter]: For program point L1540(lines 1540 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,912 INFO L443 ceAbstractionStarter]: For program point L1408(lines 1408 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,913 INFO L443 ceAbstractionStarter]: For program point L285(lines 285 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,913 INFO L443 ceAbstractionStarter]: For program point L219(lines 219 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,913 INFO L443 ceAbstractionStarter]: For program point L153-1(lines 23 1656) no Hoare annotation was computed. [2019-10-02 01:33:27,913 INFO L443 ceAbstractionStarter]: For program point L87-1(lines 23 1656) no Hoare annotation was computed. [2019-10-02 01:33:27,913 INFO L443 ceAbstractionStarter]: For program point L880(lines 880 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,913 INFO L443 ceAbstractionStarter]: For program point L748(lines 748 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,913 INFO L443 ceAbstractionStarter]: For program point L1277(lines 1277 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,913 INFO L443 ceAbstractionStarter]: For program point L220(lines 220 228) no Hoare annotation was computed. [2019-10-02 01:33:27,913 INFO L443 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2019-10-02 01:33:27,913 INFO L443 ceAbstractionStarter]: For program point L220-2(lines 220 228) no Hoare annotation was computed. [2019-10-02 01:33:27,913 INFO L443 ceAbstractionStarter]: For program point L1145(lines 1145 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,914 INFO L443 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2019-10-02 01:33:27,914 INFO L443 ceAbstractionStarter]: For program point L1344(lines 1344 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,914 INFO L443 ceAbstractionStarter]: For program point L1212(lines 1212 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,914 INFO L443 ceAbstractionStarter]: For program point L948(lines 948 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,914 INFO L443 ceAbstractionStarter]: For program point L486(lines 486 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,914 INFO L443 ceAbstractionStarter]: For program point L156-1(lines 23 1656) no Hoare annotation was computed. [2019-10-02 01:33:27,914 INFO L443 ceAbstractionStarter]: For program point L90-1(lines 23 1656) no Hoare annotation was computed. [2019-10-02 01:33:27,914 INFO L443 ceAbstractionStarter]: For program point L1081(lines 1081 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,914 INFO L443 ceAbstractionStarter]: For program point L24(lines 24 26) no Hoare annotation was computed. [2019-10-02 01:33:27,914 INFO L443 ceAbstractionStarter]: For program point L24-2(lines 23 1656) no Hoare annotation was computed. [2019-10-02 01:33:27,915 INFO L443 ceAbstractionStarter]: For program point L817(lines 817 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,915 INFO L443 ceAbstractionStarter]: For program point L1478(lines 1478 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,915 INFO L443 ceAbstractionStarter]: For program point L355(lines 355 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,915 INFO L443 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2019-10-02 01:33:27,915 INFO L443 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2019-10-02 01:33:27,915 INFO L443 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2019-10-02 01:33:27,915 INFO L443 ceAbstractionStarter]: For program point L1016(lines 1016 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,915 INFO L443 ceAbstractionStarter]: For program point L620(lines 620 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,915 INFO L443 ceAbstractionStarter]: For program point L422(lines 422 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,915 INFO L443 ceAbstractionStarter]: For program point L1413(lines 1413 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,916 INFO L443 ceAbstractionStarter]: For program point L885(lines 885 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,916 INFO L443 ceAbstractionStarter]: For program point L687(lines 687 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,916 INFO L443 ceAbstractionStarter]: For program point L1612(lines 1612 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,916 INFO L443 ceAbstractionStarter]: For program point L159-1(lines 23 1656) no Hoare annotation was computed. [2019-10-02 01:33:27,916 INFO L443 ceAbstractionStarter]: For program point L1150(lines 1150 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,916 INFO L443 ceAbstractionStarter]: For program point L93-1(lines 23 1656) no Hoare annotation was computed. [2019-10-02 01:33:27,916 INFO L443 ceAbstractionStarter]: For program point L27-1(lines 23 1656) no Hoare annotation was computed. [2019-10-02 01:33:27,916 INFO L443 ceAbstractionStarter]: For program point L886(lines 886 894) no Hoare annotation was computed. [2019-10-02 01:33:27,916 INFO L443 ceAbstractionStarter]: For program point L886-2(lines 886 894) no Hoare annotation was computed. [2019-10-02 01:33:27,916 INFO L443 ceAbstractionStarter]: For program point L754(lines 754 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,916 INFO L443 ceAbstractionStarter]: For program point L1613(lines 1613 1622) no Hoare annotation was computed. [2019-10-02 01:33:27,917 INFO L443 ceAbstractionStarter]: For program point L1547(lines 1547 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,917 INFO L443 ceAbstractionStarter]: For program point L1613-2(lines 1613 1622) no Hoare annotation was computed. [2019-10-02 01:33:27,917 INFO L443 ceAbstractionStarter]: For program point L292(lines 292 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,917 INFO L443 ceAbstractionStarter]: For program point L1283(lines 1283 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,917 INFO L443 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2019-10-02 01:33:27,917 INFO L443 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2019-10-02 01:33:27,917 INFO L443 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2019-10-02 01:33:27,917 INFO L443 ceAbstractionStarter]: For program point L1019(lines 1019 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,917 INFO L443 ceAbstractionStarter]: For program point L557(lines 557 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,917 INFO L443 ceAbstractionStarter]: For program point L491(lines 491 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,917 INFO L443 ceAbstractionStarter]: For program point L1482(lines 1482 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,918 INFO L443 ceAbstractionStarter]: For program point L1350(lines 1350 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,918 INFO L443 ceAbstractionStarter]: For program point L1218(lines 1218 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,918 INFO L443 ceAbstractionStarter]: For program point L1086(lines 1086 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,918 INFO L443 ceAbstractionStarter]: For program point L558(lines 558 568) no Hoare annotation was computed. [2019-10-02 01:33:27,918 INFO L443 ceAbstractionStarter]: For program point L558-2(lines 558 568) no Hoare annotation was computed. [2019-10-02 01:33:27,918 INFO L443 ceAbstractionStarter]: For program point L1351(lines 1351 1358) no Hoare annotation was computed. [2019-10-02 01:33:27,918 INFO L443 ceAbstractionStarter]: For program point L1351-2(lines 1351 1358) no Hoare annotation was computed. [2019-10-02 01:33:27,918 INFO L443 ceAbstractionStarter]: For program point L162-1(lines 23 1656) no Hoare annotation was computed. [2019-10-02 01:33:27,918 INFO L443 ceAbstractionStarter]: For program point L96-1(lines 23 1656) no Hoare annotation was computed. [2019-10-02 01:33:27,918 INFO L443 ceAbstractionStarter]: For program point L30-1(lines 23 1656) no Hoare annotation was computed. [2019-10-02 01:33:27,919 INFO L443 ceAbstractionStarter]: For program point L955(lines 955 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,919 INFO L443 ceAbstractionStarter]: For program point L361(lines 361 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,919 INFO L443 ceAbstractionStarter]: For program point L229(lines 229 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,919 INFO L443 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2019-10-02 01:33:27,919 INFO L443 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2019-10-02 01:33:27,919 INFO L443 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2019-10-02 01:33:27,919 INFO L443 ceAbstractionStarter]: For program point L824(lines 824 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,919 INFO L443 ceAbstractionStarter]: For program point L428(lines 428 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,919 INFO L443 ceAbstractionStarter]: For program point L1419(lines 1419 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,919 INFO L443 ceAbstractionStarter]: For program point L693(lines 693 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,920 INFO L443 ceAbstractionStarter]: For program point L627(lines 627 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,920 INFO L443 ceAbstractionStarter]: For program point L1420(lines 1420 1430) no Hoare annotation was computed. [2019-10-02 01:33:27,920 INFO L443 ceAbstractionStarter]: For program point L1420-2(lines 1420 1430) no Hoare annotation was computed. [2019-10-02 01:33:27,920 INFO L443 ceAbstractionStarter]: For program point L165-1(lines 23 1656) no Hoare annotation was computed. [2019-10-02 01:33:27,920 INFO L443 ceAbstractionStarter]: For program point L1156(lines 1156 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,920 INFO L443 ceAbstractionStarter]: For program point L99-1(lines 23 1656) no Hoare annotation was computed. [2019-10-02 01:33:27,920 INFO L443 ceAbstractionStarter]: For program point L33-1(lines 23 1656) no Hoare annotation was computed. [2019-10-02 01:33:27,920 INFO L443 ceAbstractionStarter]: For program point L694(lines 694 706) no Hoare annotation was computed. [2019-10-02 01:33:27,920 INFO L443 ceAbstractionStarter]: For program point L694-2(lines 694 706) no Hoare annotation was computed. [2019-10-02 01:33:27,920 INFO L443 ceAbstractionStarter]: For program point L1289(lines 1289 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,920 INFO L443 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2019-10-02 01:33:27,921 INFO L443 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2019-10-02 01:33:27,921 INFO L443 ceAbstractionStarter]: For program point L1091(lines 1091 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,921 INFO L443 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2019-10-02 01:33:27,921 INFO L443 ceAbstractionStarter]: For program point L959(lines 959 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,921 INFO L443 ceAbstractionStarter]: For program point L761(lines 761 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,921 INFO L443 ceAbstractionStarter]: For program point L1554(lines 1554 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,921 INFO L443 ceAbstractionStarter]: For program point L497(lines 497 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,921 INFO L443 ceAbstractionStarter]: For program point L1488(lines 1488 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,921 INFO L443 ceAbstractionStarter]: For program point L299(lines 299 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,921 INFO L443 ceAbstractionStarter]: For program point L1290(lines 1290 1299) no Hoare annotation was computed. [2019-10-02 01:33:27,922 INFO L443 ceAbstractionStarter]: For program point L1224(lines 1224 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,922 INFO L443 ceAbstractionStarter]: For program point L1290-2(lines 1290 1299) no Hoare annotation was computed. [2019-10-02 01:33:27,922 INFO L443 ceAbstractionStarter]: For program point L1026(lines 1026 1654) no Hoare annotation was computed. [2019-10-02 01:33:27,922 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-02 01:33:27,922 INFO L439 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (let ((.cse0 (+ ~a0~0 44))) (and (<= (+ ~a4~0 89) 0) (= 1 ~a2~0) (<= 0 .cse0) (<= .cse0 0) (= (+ ~a29~0 127) 0))) [2019-10-02 01:33:27,922 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-02 01:33:27,922 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-02 01:33:27,922 INFO L439 ceAbstractionStarter]: At program point mainENTRY(lines 1760 1776) the Hoare annotation is: (let ((.cse0 (+ |old(~a0~0)| 44))) (or (not (= 1 |old(~a2~0)|)) (not (= 0 (+ |old(~a29~0)| 127))) (not (<= .cse0 0)) (not (<= (+ |old(~a4~0)| 89) 0)) (not (<= 0 .cse0)) (and (= 1 ~a2~0) (= ~a0~0 |old(~a0~0)|) (= ~a4~0 |old(~a4~0)|) (= (+ ~a29~0 127) 0)))) [2019-10-02 01:33:27,922 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 1760 1776) no Hoare annotation was computed. [2019-10-02 01:33:27,923 INFO L439 ceAbstractionStarter]: At program point L1774(line 1774) the Hoare annotation is: (let ((.cse32 (+ ~a29~0 127)) (.cse31 (+ ~a0~0 147)) (.cse5 (<= (+ ~a0~0 104) 0)) (.cse4 (<= 0 (+ ~a4~0 85))) (.cse8 (<= (+ ~a4~0 42) 0)) (.cse28 (= 1 |old(~a2~0)|)) (.cse3 (= 3 ~a2~0)) (.cse15 (< 43 ~a29~0)) (.cse1 (<= ~a29~0 43)) (.cse14 (= 4 ~a2~0)) (.cse10 (<= (+ ~a4~0 89) 0)) (.cse12 (= 1 ~a2~0)) (.cse33 (<= |old(~a2~0)| 2))) (let ((.cse13 (exists ((v_~a0~0_835 Int)) (let ((.cse35 (mod v_~a0~0_835 299926))) (and (<= v_~a0~0_835 |old(~a0~0)|) (< v_~a0~0_835 0) (<= .cse35 (+ ~a0~0 600000)) (not (= 0 .cse35)))))) (.cse20 (exists ((v_prenex_1 Int)) (let ((.cse34 (mod (+ v_prenex_1 11) 29))) (and (< (+ v_prenex_1 371124) 0) (not (= .cse34 0)) (<= .cse34 (+ ~a29~0 14)))))) (.cse22 (and .cse10 .cse12 .cse33)) (.cse25 (<= 0 (+ ~a29~0 600001))) (.cse2 (<= (+ (* 5 ~a0~0) 779) ~a29~0)) (.cse26 (and .cse10 .cse1 .cse14 .cse33)) (.cse11 (<= (+ ~a0~0 61) 0)) (.cse29 (and .cse5 (and .cse4 .cse8 .cse28 .cse3 .cse15))) (.cse21 (+ |old(~a0~0)| 44)) (.cse24 (= 2 ~a2~0)) (.cse17 (or (= 4 |old(~a2~0)|) (not .cse14))) (.cse30 (or .cse14 (<= 48792 ~a29~0))) (.cse19 (<= (+ ~a0~0 98) 0)) (.cse7 (< 0 .cse31)) (.cse0 (<= (+ ~a4~0 86) 0)) (.cse27 (<= 0 .cse32)) (.cse6 (<= 4 ~a2~0)) (.cse16 (<= 0 (+ ~a0~0 600000))) (.cse23 (<= .cse32 0)) (.cse9 (<= 0 (+ ~a29~0 599991))) (.cse18 (<= .cse31 0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6 .cse7 .cse1 .cse8 .cse9) (and .cse10 .cse3 .cse11) (and .cse4 (and .cse8 .cse12 .cse7 .cse1) .cse11 .cse9) (and .cse13 (and .cse4 .cse8 .cse5 .cse14 .cse15)) (and (and (and .cse4 .cse16 (and .cse8 .cse17 .cse6)) .cse9) .cse18) (and .cse7 (or (and .cse4 .cse19 .cse6 .cse1 .cse8 .cse20) (and .cse4 .cse19 (<= 207266 ~a29~0) .cse6 .cse8))) (and (and (and .cse4 .cse6 .cse8 .cse13) .cse9) .cse18) (not (<= .cse21 0)) (and .cse22 .cse23) (and .cse10 .cse1 .cse24 .cse11) (and (and .cse4 .cse1 .cse16 .cse8 .cse2 .cse12) .cse9) (and (and .cse4 .cse8 .cse12 .cse5 .cse15) .cse16) (and .cse4 .cse5 .cse16 .cse24 .cse8 .cse15) (and .cse4 .cse19 .cse1 .cse7 .cse24 .cse8 .cse20) (and .cse18 (and .cse4 .cse8 .cse23 .cse3 .cse25)) (and .cse10 .cse25 .cse3) (and .cse26 .cse9) (and .cse18 (and .cse4 .cse16 .cse24 .cse27 .cse8)) (and (and .cse10 .cse6 .cse1 .cse7) .cse27) (not .cse28) (and .cse10 .cse19 .cse6 .cse7) (and .cse10 .cse6 .cse5 .cse23) (and .cse29 .cse16) (not (= 0 (+ |old(~a29~0)| 127))) (and .cse22 .cse11) (and (and .cse4 .cse19 (and .cse8 (= ~a2~0 |old(~a2~0)|) .cse7)) .cse9) (and (and .cse10 .cse24) .cse7 .cse25) (and (<= (+ ~a29~0 ~a0~0 401652) 0) (and .cse0 .cse2 .cse12) .cse23) (and .cse26 .cse11) (and .cse18 (and .cse6 .cse16 .cse15 .cse8)) (and .cse29 .cse30) (not (<= 0 .cse21)) (and (and .cse4 .cse19 .cse7 .cse24 .cse8) .cse30) (and .cse18 (and .cse4 .cse1 .cse8 .cse3 .cse9)) (and .cse10 .cse17 .cse6 .cse30) (and .cse4 .cse19 (and .cse8 (and .cse7 .cse3) .cse15)) (and .cse0 .cse12 (<= (+ ~a29~0 401505) 0)) (and .cse4 .cse1 .cse16 .cse27 .cse8 .cse12) (not (<= (+ |old(~a4~0)| 89) 0)) (and .cse10 .cse5 .cse6 .cse15) (and (and .cse4 .cse16 .cse14 .cse8 .cse23 .cse9) .cse18)))) [2019-10-02 01:33:27,923 INFO L443 ceAbstractionStarter]: For program point L1774-1(line 1774) no Hoare annotation was computed. [2019-10-02 01:33:27,923 INFO L443 ceAbstractionStarter]: For program point L1771(line 1771) no Hoare annotation was computed. [2019-10-02 01:33:27,924 INFO L439 ceAbstractionStarter]: At program point L1766-2(lines 1766 1775) the Hoare annotation is: (let ((.cse32 (+ ~a29~0 127)) (.cse31 (+ ~a0~0 147)) (.cse5 (<= (+ ~a0~0 104) 0)) (.cse4 (<= 0 (+ ~a4~0 85))) (.cse8 (<= (+ ~a4~0 42) 0)) (.cse28 (= 1 |old(~a2~0)|)) (.cse3 (= 3 ~a2~0)) (.cse15 (< 43 ~a29~0)) (.cse1 (<= ~a29~0 43)) (.cse14 (= 4 ~a2~0)) (.cse10 (<= (+ ~a4~0 89) 0)) (.cse12 (= 1 ~a2~0)) (.cse33 (<= |old(~a2~0)| 2))) (let ((.cse13 (exists ((v_~a0~0_835 Int)) (let ((.cse35 (mod v_~a0~0_835 299926))) (and (<= v_~a0~0_835 |old(~a0~0)|) (< v_~a0~0_835 0) (<= .cse35 (+ ~a0~0 600000)) (not (= 0 .cse35)))))) (.cse20 (exists ((v_prenex_1 Int)) (let ((.cse34 (mod (+ v_prenex_1 11) 29))) (and (< (+ v_prenex_1 371124) 0) (not (= .cse34 0)) (<= .cse34 (+ ~a29~0 14)))))) (.cse22 (and .cse10 .cse12 .cse33)) (.cse25 (<= 0 (+ ~a29~0 600001))) (.cse2 (<= (+ (* 5 ~a0~0) 779) ~a29~0)) (.cse26 (and .cse10 .cse1 .cse14 .cse33)) (.cse11 (<= (+ ~a0~0 61) 0)) (.cse29 (and .cse5 (and .cse4 .cse8 .cse28 .cse3 .cse15))) (.cse21 (+ |old(~a0~0)| 44)) (.cse24 (= 2 ~a2~0)) (.cse17 (or (= 4 |old(~a2~0)|) (not .cse14))) (.cse30 (or .cse14 (<= 48792 ~a29~0))) (.cse19 (<= (+ ~a0~0 98) 0)) (.cse7 (< 0 .cse31)) (.cse0 (<= (+ ~a4~0 86) 0)) (.cse27 (<= 0 .cse32)) (.cse6 (<= 4 ~a2~0)) (.cse16 (<= 0 (+ ~a0~0 600000))) (.cse23 (<= .cse32 0)) (.cse9 (<= 0 (+ ~a29~0 599991))) (.cse18 (<= .cse31 0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6 .cse7 .cse1 .cse8 .cse9) (and .cse10 .cse3 .cse11) (and .cse4 (and .cse8 .cse12 .cse7 .cse1) .cse11 .cse9) (and .cse13 (and .cse4 .cse8 .cse5 .cse14 .cse15)) (and (and (and .cse4 .cse16 (and .cse8 .cse17 .cse6)) .cse9) .cse18) (and .cse7 (or (and .cse4 .cse19 .cse6 .cse1 .cse8 .cse20) (and .cse4 .cse19 (<= 207266 ~a29~0) .cse6 .cse8))) (and (and (and .cse4 .cse6 .cse8 .cse13) .cse9) .cse18) (not (<= .cse21 0)) (and .cse22 .cse23) (and .cse10 .cse1 .cse24 .cse11) (and (and .cse4 .cse1 .cse16 .cse8 .cse2 .cse12) .cse9) (and (and .cse4 .cse8 .cse12 .cse5 .cse15) .cse16) (and .cse4 .cse5 .cse16 .cse24 .cse8 .cse15) (and .cse4 .cse19 .cse1 .cse7 .cse24 .cse8 .cse20) (and .cse18 (and .cse4 .cse8 .cse23 .cse3 .cse25)) (and .cse10 .cse25 .cse3) (and .cse26 .cse9) (and .cse18 (and .cse4 .cse16 .cse24 .cse27 .cse8)) (and (and .cse10 .cse6 .cse1 .cse7) .cse27) (not .cse28) (and .cse10 .cse19 .cse6 .cse7) (and .cse10 .cse6 .cse5 .cse23) (and .cse29 .cse16) (not (= 0 (+ |old(~a29~0)| 127))) (and .cse22 .cse11) (and (and .cse4 .cse19 (and .cse8 (= ~a2~0 |old(~a2~0)|) .cse7)) .cse9) (and (and .cse10 .cse24) .cse7 .cse25) (and (<= (+ ~a29~0 ~a0~0 401652) 0) (and .cse0 .cse2 .cse12) .cse23) (and .cse26 .cse11) (and .cse18 (and .cse6 .cse16 .cse15 .cse8)) (and .cse29 .cse30) (not (<= 0 .cse21)) (and (and .cse4 .cse19 .cse7 .cse24 .cse8) .cse30) (and .cse18 (and .cse4 .cse1 .cse8 .cse3 .cse9)) (and .cse10 .cse17 .cse6 .cse30) (and .cse4 .cse19 (and .cse8 (and .cse7 .cse3) .cse15)) (and .cse0 .cse12 (<= (+ ~a29~0 401505) 0)) (and .cse4 .cse1 .cse16 .cse27 .cse8 .cse12) (not (<= (+ |old(~a4~0)| 89) 0)) (and .cse10 .cse5 .cse6 .cse15) (and (and .cse4 .cse16 .cse14 .cse8 .cse23 .cse9) .cse18)))) [2019-10-02 01:33:27,924 INFO L443 ceAbstractionStarter]: For program point L1766-3(lines 1760 1776) no Hoare annotation was computed. [2019-10-02 01:33:27,943 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_835,QUANTIFIED] [2019-10-02 01:33:27,945 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_835,QUANTIFIED] [2019-10-02 01:33:27,945 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_835,QUANTIFIED] [2019-10-02 01:33:27,950 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_835,QUANTIFIED] [2019-10-02 01:33:27,956 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-10-02 01:33:27,956 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-10-02 01:33:27,957 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-10-02 01:33:27,957 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_835,QUANTIFIED] [2019-10-02 01:33:27,958 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_835,QUANTIFIED] [2019-10-02 01:33:27,958 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_835,QUANTIFIED] [2019-10-02 01:33:27,959 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_835,QUANTIFIED] [2019-10-02 01:33:27,960 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-10-02 01:33:27,961 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-10-02 01:33:27,961 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-10-02 01:33:27,983 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_835,QUANTIFIED] [2019-10-02 01:33:27,983 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_835,QUANTIFIED] [2019-10-02 01:33:27,984 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_835,QUANTIFIED] [2019-10-02 01:33:27,984 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_835,QUANTIFIED] [2019-10-02 01:33:27,984 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-10-02 01:33:27,985 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-10-02 01:33:27,985 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-10-02 01:33:27,986 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_835,QUANTIFIED] [2019-10-02 01:33:27,989 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_835,QUANTIFIED] [2019-10-02 01:33:27,990 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_835,QUANTIFIED] [2019-10-02 01:33:27,990 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_835,QUANTIFIED] [2019-10-02 01:33:27,991 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-10-02 01:33:27,991 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-10-02 01:33:27,991 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-10-02 01:33:27,996 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.10 01:33:27 BoogieIcfgContainer [2019-10-02 01:33:27,996 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-02 01:33:28,001 INFO L168 Benchmark]: Toolchain (without parser) took 500468.22 ms. Allocated memory was 140.0 MB in the beginning and 2.7 GB in the end (delta: 2.6 GB). Free memory was 82.2 MB in the beginning and 933.1 MB in the end (delta: -850.8 MB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. [2019-10-02 01:33:28,002 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 140.0 MB. Free memory was 105.9 MB in the beginning and 105.7 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-10-02 01:33:28,003 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1479.87 ms. Allocated memory was 140.0 MB in the beginning and 223.9 MB in the end (delta: 83.9 MB). Free memory was 82.0 MB in the beginning and 151.3 MB in the end (delta: -69.3 MB). Peak memory consumption was 37.8 MB. Max. memory is 7.1 GB. [2019-10-02 01:33:28,003 INFO L168 Benchmark]: Boogie Preprocessor took 193.02 ms. Allocated memory is still 223.9 MB. Free memory was 151.3 MB in the beginning and 139.3 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 7.1 GB. [2019-10-02 01:33:28,006 INFO L168 Benchmark]: RCFGBuilder took 3282.71 ms. Allocated memory was 223.9 MB in the beginning and 273.7 MB in the end (delta: 49.8 MB). Free memory was 139.3 MB in the beginning and 169.5 MB in the end (delta: -30.2 MB). Peak memory consumption was 112.2 MB. Max. memory is 7.1 GB. [2019-10-02 01:33:28,007 INFO L168 Benchmark]: TraceAbstraction took 495503.05 ms. Allocated memory was 273.7 MB in the beginning and 2.7 GB in the end (delta: 2.4 GB). Free memory was 169.5 MB in the beginning and 933.1 MB in the end (delta: -763.6 MB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. [2019-10-02 01:33:28,013 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 140.0 MB. Free memory was 105.9 MB in the beginning and 105.7 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1479.87 ms. Allocated memory was 140.0 MB in the beginning and 223.9 MB in the end (delta: 83.9 MB). Free memory was 82.0 MB in the beginning and 151.3 MB in the end (delta: -69.3 MB). Peak memory consumption was 37.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 193.02 ms. Allocated memory is still 223.9 MB. Free memory was 151.3 MB in the beginning and 139.3 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3282.71 ms. Allocated memory was 223.9 MB in the beginning and 273.7 MB in the end (delta: 49.8 MB). Free memory was 139.3 MB in the beginning and 169.5 MB in the end (delta: -30.2 MB). Peak memory consumption was 112.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 495503.05 ms. Allocated memory was 273.7 MB in the beginning and 2.7 GB in the end (delta: 2.4 GB). Free memory was 169.5 MB in the beginning and 933.1 MB in the end (delta: -763.6 MB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_835,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_835,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_835,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_835,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_835,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_835,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_835,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_835,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_835,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_835,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_835,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_835,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_835,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_835,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_835,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_835,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 196]: 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: 1766]: Loop Invariant [2019-10-02 01:33:28,027 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_835,QUANTIFIED] [2019-10-02 01:33:28,027 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_835,QUANTIFIED] [2019-10-02 01:33:28,027 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_835,QUANTIFIED] [2019-10-02 01:33:28,028 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_835,QUANTIFIED] [2019-10-02 01:33:28,028 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-10-02 01:33:28,029 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-10-02 01:33:28,029 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-10-02 01:33:28,029 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_835,QUANTIFIED] [2019-10-02 01:33:28,030 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_835,QUANTIFIED] [2019-10-02 01:33:28,030 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_835,QUANTIFIED] [2019-10-02 01:33:28,030 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_835,QUANTIFIED] [2019-10-02 01:33:28,031 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-10-02 01:33:28,031 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-10-02 01:33:28,032 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-10-02 01:33:28,034 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_835,QUANTIFIED] [2019-10-02 01:33:28,034 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_835,QUANTIFIED] [2019-10-02 01:33:28,034 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_835,QUANTIFIED] [2019-10-02 01:33:28,035 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_835,QUANTIFIED] [2019-10-02 01:33:28,035 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-10-02 01:33:28,036 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-10-02 01:33:28,036 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-10-02 01:33:28,036 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_835,QUANTIFIED] [2019-10-02 01:33:28,037 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_835,QUANTIFIED] [2019-10-02 01:33:28,037 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_835,QUANTIFIED] [2019-10-02 01:33:28,037 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_835,QUANTIFIED] [2019-10-02 01:33:28,038 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-10-02 01:33:28,038 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-10-02 01:33:28,038 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((((a4 + 86 <= 0 && a29 <= 43) && 5 * a0 + 779 <= a29) && 3 == a2) || ((((((0 <= a4 + 85 && a0 + 104 <= 0) && 4 <= a2) && 0 < a0 + 147) && a29 <= 43) && a4 + 42 <= 0) && 0 <= a29 + 599991)) || ((a4 + 89 <= 0 && 3 == a2) && a0 + 61 <= 0)) || (((0 <= a4 + 85 && ((a4 + 42 <= 0 && 1 == a2) && 0 < a0 + 147) && a29 <= 43) && a0 + 61 <= 0) && 0 <= a29 + 599991)) || ((\exists v_~a0~0_835 : int :: ((v_~a0~0_835 <= \old(a0) && v_~a0~0_835 < 0) && v_~a0~0_835 % 299926 <= a0 + 600000) && !(0 == v_~a0~0_835 % 299926)) && (((0 <= a4 + 85 && a4 + 42 <= 0) && a0 + 104 <= 0) && 4 == a2) && 43 < a29)) || ((((0 <= a4 + 85 && 0 <= a0 + 600000) && (a4 + 42 <= 0 && (4 == \old(a2) || !(4 == a2))) && 4 <= a2) && 0 <= a29 + 599991) && a0 + 147 <= 0)) || (0 < a0 + 147 && ((((((0 <= a4 + 85 && a0 + 98 <= 0) && 4 <= a2) && a29 <= 43) && a4 + 42 <= 0) && (\exists v_prenex_1 : int :: (v_prenex_1 + 371124 < 0 && !((v_prenex_1 + 11) % 29 == 0)) && (v_prenex_1 + 11) % 29 <= a29 + 14)) || ((((0 <= a4 + 85 && a0 + 98 <= 0) && 207266 <= a29) && 4 <= a2) && a4 + 42 <= 0)))) || (((((0 <= a4 + 85 && 4 <= a2) && a4 + 42 <= 0) && (\exists v_~a0~0_835 : int :: ((v_~a0~0_835 <= \old(a0) && v_~a0~0_835 < 0) && v_~a0~0_835 % 299926 <= a0 + 600000) && !(0 == v_~a0~0_835 % 299926))) && 0 <= a29 + 599991) && a0 + 147 <= 0)) || !(\old(a0) + 44 <= 0)) || (((a4 + 89 <= 0 && 1 == a2) && \old(a2) <= 2) && a29 + 127 <= 0)) || (((a4 + 89 <= 0 && a29 <= 43) && 2 == a2) && a0 + 61 <= 0)) || ((((((0 <= a4 + 85 && a29 <= 43) && 0 <= a0 + 600000) && a4 + 42 <= 0) && 5 * a0 + 779 <= a29) && 1 == a2) && 0 <= a29 + 599991)) || (((((0 <= a4 + 85 && a4 + 42 <= 0) && 1 == a2) && a0 + 104 <= 0) && 43 < a29) && 0 <= a0 + 600000)) || (((((0 <= a4 + 85 && a0 + 104 <= 0) && 0 <= a0 + 600000) && 2 == a2) && a4 + 42 <= 0) && 43 < a29)) || ((((((0 <= a4 + 85 && a0 + 98 <= 0) && a29 <= 43) && 0 < a0 + 147) && 2 == a2) && a4 + 42 <= 0) && (\exists v_prenex_1 : int :: (v_prenex_1 + 371124 < 0 && !((v_prenex_1 + 11) % 29 == 0)) && (v_prenex_1 + 11) % 29 <= a29 + 14))) || (a0 + 147 <= 0 && (((0 <= a4 + 85 && a4 + 42 <= 0) && a29 + 127 <= 0) && 3 == a2) && 0 <= a29 + 600001)) || ((a4 + 89 <= 0 && 0 <= a29 + 600001) && 3 == a2)) || ((((a4 + 89 <= 0 && a29 <= 43) && 4 == a2) && \old(a2) <= 2) && 0 <= a29 + 599991)) || (a0 + 147 <= 0 && (((0 <= a4 + 85 && 0 <= a0 + 600000) && 2 == a2) && 0 <= a29 + 127) && a4 + 42 <= 0)) || ((((a4 + 89 <= 0 && 4 <= a2) && a29 <= 43) && 0 < a0 + 147) && 0 <= a29 + 127)) || !(1 == \old(a2))) || (((a4 + 89 <= 0 && a0 + 98 <= 0) && 4 <= a2) && 0 < a0 + 147)) || (((a4 + 89 <= 0 && 4 <= a2) && a0 + 104 <= 0) && a29 + 127 <= 0)) || ((a0 + 104 <= 0 && (((0 <= a4 + 85 && a4 + 42 <= 0) && 1 == \old(a2)) && 3 == a2) && 43 < a29) && 0 <= a0 + 600000)) || !(0 == \old(a29) + 127)) || (((a4 + 89 <= 0 && 1 == a2) && \old(a2) <= 2) && a0 + 61 <= 0)) || (((0 <= a4 + 85 && a0 + 98 <= 0) && (a4 + 42 <= 0 && a2 == \old(a2)) && 0 < a0 + 147) && 0 <= a29 + 599991)) || (((a4 + 89 <= 0 && 2 == a2) && 0 < a0 + 147) && 0 <= a29 + 600001)) || ((a29 + a0 + 401652 <= 0 && (a4 + 86 <= 0 && 5 * a0 + 779 <= a29) && 1 == a2) && a29 + 127 <= 0)) || ((((a4 + 89 <= 0 && a29 <= 43) && 4 == a2) && \old(a2) <= 2) && a0 + 61 <= 0)) || (a0 + 147 <= 0 && ((4 <= a2 && 0 <= a0 + 600000) && 43 < a29) && a4 + 42 <= 0)) || ((a0 + 104 <= 0 && (((0 <= a4 + 85 && a4 + 42 <= 0) && 1 == \old(a2)) && 3 == a2) && 43 < a29) && (4 == a2 || 48792 <= a29))) || !(0 <= \old(a0) + 44)) || (((((0 <= a4 + 85 && a0 + 98 <= 0) && 0 < a0 + 147) && 2 == a2) && a4 + 42 <= 0) && (4 == a2 || 48792 <= a29))) || (a0 + 147 <= 0 && (((0 <= a4 + 85 && a29 <= 43) && a4 + 42 <= 0) && 3 == a2) && 0 <= a29 + 599991)) || (((a4 + 89 <= 0 && (4 == \old(a2) || !(4 == a2))) && 4 <= a2) && (4 == a2 || 48792 <= a29))) || ((0 <= a4 + 85 && a0 + 98 <= 0) && (a4 + 42 <= 0 && 0 < a0 + 147 && 3 == a2) && 43 < a29)) || ((a4 + 86 <= 0 && 1 == a2) && a29 + 401505 <= 0)) || (((((0 <= a4 + 85 && a29 <= 43) && 0 <= a0 + 600000) && 0 <= a29 + 127) && a4 + 42 <= 0) && 1 == a2)) || !(\old(a4) + 89 <= 0)) || (((a4 + 89 <= 0 && a0 + 104 <= 0) && 4 <= a2) && 43 < a29)) || ((((((0 <= a4 + 85 && 0 <= a0 + 600000) && 4 == a2) && a4 + 42 <= 0) && a29 + 127 <= 0) && 0 <= a29 + 599991) && a0 + 147 <= 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 437 locations, 1 error locations. SAFE Result, 495.3s OverallTime, 17 OverallIterations, 7 TraceHistogramMax, 236.0s AutomataDifference, 0.0s DeadEndRemovalTime, 212.9s HoareAnnotationTime, HoareTripleCheckerStatistics: 2588 SDtfs, 48447 SDslu, 5410 SDs, 0 SdLazy, 90070 SolverSat, 13717 SolverUnsat, 27 SolverUnknown, 0 SolverNotchecked, 166.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 9778 GetRequests, 9269 SyntacticMatches, 18 SemanticMatches, 491 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 11280 ImplicationChecksByTransitivity, 52.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=46133occurred in iteration=15, 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: 9.6s AutomataMinimizationTime, 17 MinimizatonAttempts, 46079 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 6604 PreInvPairs, 7480 NumberOfFragments, 7208 HoareAnnotationTreeSize, 6604 FomulaSimplifications, 1622111 FormulaSimplificationTreeSizeReduction, 20.0s HoareSimplificationTime, 9 FomulaSimplificationsInter, 1015069 FormulaSimplificationTreeSizeReductionInter, 192.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.8s SsaConstructionTime, 3.3s SatisfiabilityAnalysisTime, 22.9s InterpolantComputationTime, 19344 NumberOfCodeBlocks, 19344 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 19314 ConstructedInterpolants, 149 QuantifiedInterpolants, 43258284 SizeOfPredicates, 14 NumberOfNonLiveVariables, 12267 ConjunctsInSsa, 106 ConjunctsInUnsatCore, 30 InterpolantComputations, 6 PerfectInterpolantSequences, 24101/27587 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! [MP z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process Received shutdown request...