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/Problem16_label11.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 01:31:22,536 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 01:31:22,538 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 01:31:22,550 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 01:31:22,551 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 01:31:22,552 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 01:31:22,553 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 01:31:22,555 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 01:31:22,557 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 01:31:22,558 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 01:31:22,559 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 01:31:22,560 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 01:31:22,560 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 01:31:22,561 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 01:31:22,562 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 01:31:22,564 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 01:31:22,565 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 01:31:22,566 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 01:31:22,567 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 01:31:22,569 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 01:31:22,571 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 01:31:22,572 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 01:31:22,573 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 01:31:22,574 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 01:31:22,576 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 01:31:22,576 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 01:31:22,576 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 01:31:22,577 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 01:31:22,578 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 01:31:22,579 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 01:31:22,579 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 01:31:22,580 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 01:31:22,580 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 01:31:22,581 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 01:31:22,582 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 01:31:22,582 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 01:31:22,583 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 01:31:22,583 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 01:31:22,583 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 01:31:22,584 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 01:31:22,585 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 01:31:22,586 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:31:22,638 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 01:31:22,639 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 01:31:22,641 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 01:31:22,642 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 01:31:22,642 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 01:31:22,643 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 01:31:22,643 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 01:31:22,643 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 01:31:22,643 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 01:31:22,643 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 01:31:22,645 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 01:31:22,645 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 01:31:22,645 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 01:31:22,646 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 01:31:22,646 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 01:31:22,646 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 01:31:22,646 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 01:31:22,647 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 01:31:22,647 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 01:31:22,647 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 01:31:22,648 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 01:31:22,648 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 01:31:22,648 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 01:31:22,648 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 01:31:22,649 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 01:31:22,649 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 01:31:22,649 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 01:31:22,649 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 01:31:22,649 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 01:31:22,696 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 01:31:22,709 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 01:31:22,713 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 01:31:22,714 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 01:31:22,715 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 01:31:22,715 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem16_label11.c [2019-10-02 01:31:22,853 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a5c0ad8e/1a028b88e6484c399fafa561f4e9b1ac/FLAG2add3e35c [2019-10-02 01:31:23,549 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 01:31:23,550 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem16_label11.c [2019-10-02 01:31:23,566 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a5c0ad8e/1a028b88e6484c399fafa561f4e9b1ac/FLAG2add3e35c [2019-10-02 01:31:23,664 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a5c0ad8e/1a028b88e6484c399fafa561f4e9b1ac [2019-10-02 01:31:23,672 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 01:31:23,674 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 01:31:23,675 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 01:31:23,675 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 01:31:23,679 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 01:31:23,681 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 01:31:23" (1/1) ... [2019-10-02 01:31:23,684 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c9fb768 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:31:23, skipping insertion in model container [2019-10-02 01:31:23,684 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 01:31:23" (1/1) ... [2019-10-02 01:31:23,691 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 01:31:23,764 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 01:31:24,640 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 01:31:24,646 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 01:31:25,186 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 01:31:25,208 INFO L192 MainTranslator]: Completed translation [2019-10-02 01:31:25,209 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:31:25 WrapperNode [2019-10-02 01:31:25,210 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 01:31:25,211 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 01:31:25,211 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 01:31:25,212 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 01:31:25,227 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:31:25" (1/1) ... [2019-10-02 01:31:25,227 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:31:25" (1/1) ... [2019-10-02 01:31:25,268 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:31:25" (1/1) ... [2019-10-02 01:31:25,268 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:31:25" (1/1) ... [2019-10-02 01:31:25,327 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:31:25" (1/1) ... [2019-10-02 01:31:25,342 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:31:25" (1/1) ... [2019-10-02 01:31:25,361 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:31:25" (1/1) ... [2019-10-02 01:31:25,376 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 01:31:25,376 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 01:31:25,377 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 01:31:25,377 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 01:31:25,378 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:31:25" (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:31:25,444 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 01:31:25,444 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 01:31:25,444 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-10-02 01:31:25,444 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2019-10-02 01:31:25,445 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 01:31:25,445 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-10-02 01:31:25,445 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2019-10-02 01:31:25,446 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 01:31:25,446 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 01:31:25,446 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-02 01:31:25,446 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 01:31:25,447 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 01:31:25,447 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 01:31:27,871 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 01:31:27,871 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-02 01:31:27,873 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 01:31:27 BoogieIcfgContainer [2019-10-02 01:31:27,874 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 01:31:27,876 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 01:31:27,876 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 01:31:27,880 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 01:31:27,881 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 01:31:23" (1/3) ... [2019-10-02 01:31:27,882 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e77ba24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 01:31:27, skipping insertion in model container [2019-10-02 01:31:27,882 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:31:25" (2/3) ... [2019-10-02 01:31:27,883 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e77ba24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 01:31:27, skipping insertion in model container [2019-10-02 01:31:27,883 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 01:31:27" (3/3) ... [2019-10-02 01:31:27,884 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem16_label11.c [2019-10-02 01:31:27,895 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 01:31:27,906 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 01:31:27,923 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 01:31:27,975 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 01:31:27,976 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 01:31:27,976 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 01:31:27,976 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 01:31:27,977 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 01:31:27,977 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 01:31:27,977 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 01:31:27,977 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 01:31:27,977 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 01:31:28,012 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states. [2019-10-02 01:31:28,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-10-02 01:31:28,022 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:31:28,024 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] [2019-10-02 01:31:28,025 INFO L418 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:31:28,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:31:28,031 INFO L82 PathProgramCache]: Analyzing trace with hash -1003051062, now seen corresponding path program 1 times [2019-10-02 01:31:28,033 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:31:28,034 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:31:28,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:31:28,084 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:31:28,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:31:28,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:31:28,391 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:31:28,393 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 01:31:28,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 01:31:28,398 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 01:31:28,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 01:31:28,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 01:31:28,415 INFO L87 Difference]: Start difference. First operand 409 states. Second operand 3 states. [2019-10-02 01:31:30,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:31:30,897 INFO L93 Difference]: Finished difference Result 1153 states and 2141 transitions. [2019-10-02 01:31:30,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 01:31:30,904 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2019-10-02 01:31:30,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:31:30,926 INFO L225 Difference]: With dead ends: 1153 [2019-10-02 01:31:30,926 INFO L226 Difference]: Without dead ends: 682 [2019-10-02 01:31:30,936 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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:31:30,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 682 states. [2019-10-02 01:31:31,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 682 to 682. [2019-10-02 01:31:31,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 682 states. [2019-10-02 01:31:31,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 682 states and 1184 transitions. [2019-10-02 01:31:31,043 INFO L78 Accepts]: Start accepts. Automaton has 682 states and 1184 transitions. Word has length 61 [2019-10-02 01:31:31,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:31:31,043 INFO L475 AbstractCegarLoop]: Abstraction has 682 states and 1184 transitions. [2019-10-02 01:31:31,044 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 01:31:31,044 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 1184 transitions. [2019-10-02 01:31:31,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-10-02 01:31:31,050 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:31:31,050 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, 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:31:31,051 INFO L418 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:31:31,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:31:31,051 INFO L82 PathProgramCache]: Analyzing trace with hash 1399533719, now seen corresponding path program 1 times [2019-10-02 01:31:31,052 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:31:31,052 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:31:31,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:31:31,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:31:31,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:31:31,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:31:31,246 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 01:31:31,246 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 01:31:31,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 01:31:31,248 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 01:31:31,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 01:31:31,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 01:31:31,249 INFO L87 Difference]: Start difference. First operand 682 states and 1184 transitions. Second operand 5 states. [2019-10-02 01:31:34,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:31:34,137 INFO L93 Difference]: Finished difference Result 2066 states and 3624 transitions. [2019-10-02 01:31:34,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 01:31:34,138 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 130 [2019-10-02 01:31:34,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:31:34,158 INFO L225 Difference]: With dead ends: 2066 [2019-10-02 01:31:34,159 INFO L226 Difference]: Without dead ends: 1390 [2019-10-02 01:31:34,162 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-10-02 01:31:34,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1390 states. [2019-10-02 01:31:34,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1390 to 1372. [2019-10-02 01:31:34,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1372 states. [2019-10-02 01:31:34,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1372 states to 1372 states and 2268 transitions. [2019-10-02 01:31:34,261 INFO L78 Accepts]: Start accepts. Automaton has 1372 states and 2268 transitions. Word has length 130 [2019-10-02 01:31:34,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:31:34,265 INFO L475 AbstractCegarLoop]: Abstraction has 1372 states and 2268 transitions. [2019-10-02 01:31:34,265 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 01:31:34,265 INFO L276 IsEmpty]: Start isEmpty. Operand 1372 states and 2268 transitions. [2019-10-02 01:31:34,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-10-02 01:31:34,277 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:31:34,277 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:34,277 INFO L418 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:31:34,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:31:34,278 INFO L82 PathProgramCache]: Analyzing trace with hash -32887422, now seen corresponding path program 1 times [2019-10-02 01:31:34,278 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:31:34,278 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:31:34,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:31:34,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:31:34,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:31:34,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:31:34,538 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 01:31:34,540 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 01:31:34,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 01:31:34,542 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 01:31:34,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 01:31:34,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-02 01:31:34,543 INFO L87 Difference]: Start difference. First operand 1372 states and 2268 transitions. Second operand 6 states. [2019-10-02 01:31:37,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:31:37,181 INFO L93 Difference]: Finished difference Result 3472 states and 5791 transitions. [2019-10-02 01:31:37,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 01:31:37,182 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 159 [2019-10-02 01:31:37,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:31:37,199 INFO L225 Difference]: With dead ends: 3472 [2019-10-02 01:31:37,199 INFO L226 Difference]: Without dead ends: 2106 [2019-10-02 01:31:37,204 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-10-02 01:31:37,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2106 states. [2019-10-02 01:31:37,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2106 to 2081. [2019-10-02 01:31:37,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2081 states. [2019-10-02 01:31:37,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2081 states to 2081 states and 3263 transitions. [2019-10-02 01:31:37,351 INFO L78 Accepts]: Start accepts. Automaton has 2081 states and 3263 transitions. Word has length 159 [2019-10-02 01:31:37,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:31:37,361 INFO L475 AbstractCegarLoop]: Abstraction has 2081 states and 3263 transitions. [2019-10-02 01:31:37,361 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 01:31:37,362 INFO L276 IsEmpty]: Start isEmpty. Operand 2081 states and 3263 transitions. [2019-10-02 01:31:37,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-10-02 01:31:37,366 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:31:37,366 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:37,367 INFO L418 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:31:37,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:31:37,367 INFO L82 PathProgramCache]: Analyzing trace with hash -909637690, now seen corresponding path program 1 times [2019-10-02 01:31:37,367 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:31:37,367 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:31:37,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:31:37,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:31:37,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:31:37,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:31:37,559 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 01:31:37,559 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 01:31:37,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 01:31:37,560 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 01:31:37,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 01:31:37,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-02 01:31:37,561 INFO L87 Difference]: Start difference. First operand 2081 states and 3263 transitions. Second operand 6 states. [2019-10-02 01:31:39,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:31:39,883 INFO L93 Difference]: Finished difference Result 5241 states and 8253 transitions. [2019-10-02 01:31:39,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 01:31:39,898 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 177 [2019-10-02 01:31:39,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:31:39,919 INFO L225 Difference]: With dead ends: 5241 [2019-10-02 01:31:39,919 INFO L226 Difference]: Without dead ends: 3166 [2019-10-02 01:31:39,925 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-10-02 01:31:39,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3166 states. [2019-10-02 01:31:40,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3166 to 3140. [2019-10-02 01:31:40,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3140 states. [2019-10-02 01:31:40,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3140 states to 3140 states and 4128 transitions. [2019-10-02 01:31:40,015 INFO L78 Accepts]: Start accepts. Automaton has 3140 states and 4128 transitions. Word has length 177 [2019-10-02 01:31:40,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:31:40,017 INFO L475 AbstractCegarLoop]: Abstraction has 3140 states and 4128 transitions. [2019-10-02 01:31:40,017 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 01:31:40,017 INFO L276 IsEmpty]: Start isEmpty. Operand 3140 states and 4128 transitions. [2019-10-02 01:31:40,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2019-10-02 01:31:40,021 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:31:40,021 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, 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] [2019-10-02 01:31:40,021 INFO L418 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:31:40,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:31:40,022 INFO L82 PathProgramCache]: Analyzing trace with hash -81123022, now seen corresponding path program 1 times [2019-10-02 01:31:40,022 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:31:40,022 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:31:40,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:31:40,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:31:40,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:31:40,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:31:40,275 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 120 proven. 53 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-02 01:31:40,275 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:31:40,276 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) [2019-10-02 01:31:40,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 01:31:40,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:31:40,375 INFO L256 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 01:31:40,389 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:31:40,556 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Stream closed [2019-10-02 01:31:40,562 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 01:31:40,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2019-10-02 01:31:40,563 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 01:31:40,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 01:31:40,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-02 01:31:40,564 INFO L87 Difference]: Start difference. First operand 3140 states and 4128 transitions. Second operand 6 states. [2019-10-02 01:31:44,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:31:44,273 INFO L93 Difference]: Finished difference Result 8358 states and 11154 transitions. [2019-10-02 01:31:44,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 01:31:44,283 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 259 [2019-10-02 01:31:44,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:31:44,307 INFO L225 Difference]: With dead ends: 8358 [2019-10-02 01:31:44,307 INFO L226 Difference]: Without dead ends: 5224 [2019-10-02 01:31:44,315 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 263 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-10-02 01:31:44,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5224 states. [2019-10-02 01:31:44,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5224 to 4863. [2019-10-02 01:31:44,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4863 states. [2019-10-02 01:31:44,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4863 states to 4863 states and 6273 transitions. [2019-10-02 01:31:44,441 INFO L78 Accepts]: Start accepts. Automaton has 4863 states and 6273 transitions. Word has length 259 [2019-10-02 01:31:44,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:31:44,442 INFO L475 AbstractCegarLoop]: Abstraction has 4863 states and 6273 transitions. [2019-10-02 01:31:44,442 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 01:31:44,442 INFO L276 IsEmpty]: Start isEmpty. Operand 4863 states and 6273 transitions. [2019-10-02 01:31:44,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 504 [2019-10-02 01:31:44,455 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:31:44,456 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:44,456 INFO L418 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:31:44,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:31:44,457 INFO L82 PathProgramCache]: Analyzing trace with hash 479925678, now seen corresponding path program 1 times [2019-10-02 01:31:44,457 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:31:44,457 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:31:44,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:31:44,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:31:44,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:31:44,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:31:45,008 INFO L134 CoverageAnalysis]: Checked inductivity of 521 backedges. 279 proven. 115 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2019-10-02 01:31:45,009 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:31:45,009 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:31:45,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:31:45,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:31:45,147 INFO L256 TraceCheckSpWp]: Trace formula consists of 734 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 01:31:45,159 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:31:45,456 INFO L134 CoverageAnalysis]: Checked inductivity of 521 backedges. 464 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-10-02 01:31:45,462 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 01:31:45,465 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-10-02 01:31:45,466 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 01:31:45,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 01:31:45,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-10-02 01:31:45,467 INFO L87 Difference]: Start difference. First operand 4863 states and 6273 transitions. Second operand 9 states. [2019-10-02 01:31:51,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:31:51,034 INFO L93 Difference]: Finished difference Result 14363 states and 19306 transitions. [2019-10-02 01:31:51,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-02 01:31:51,035 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 503 [2019-10-02 01:31:51,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:31:51,083 INFO L225 Difference]: With dead ends: 14363 [2019-10-02 01:31:51,083 INFO L226 Difference]: Without dead ends: 9506 [2019-10-02 01:31:51,100 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 524 GetRequests, 509 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272 [2019-10-02 01:31:51,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9506 states. [2019-10-02 01:31:51,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9506 to 8439. [2019-10-02 01:31:51,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8439 states. [2019-10-02 01:31:51,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8439 states to 8439 states and 10958 transitions. [2019-10-02 01:31:51,363 INFO L78 Accepts]: Start accepts. Automaton has 8439 states and 10958 transitions. Word has length 503 [2019-10-02 01:31:51,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:31:51,365 INFO L475 AbstractCegarLoop]: Abstraction has 8439 states and 10958 transitions. [2019-10-02 01:31:51,365 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 01:31:51,365 INFO L276 IsEmpty]: Start isEmpty. Operand 8439 states and 10958 transitions. [2019-10-02 01:31:51,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 636 [2019-10-02 01:31:51,404 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:31:51,405 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, 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, 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:31:51,406 INFO L418 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:31:51,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:31:51,407 INFO L82 PathProgramCache]: Analyzing trace with hash -1043292190, now seen corresponding path program 1 times [2019-10-02 01:31:51,408 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:31:51,408 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:31:51,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:31:51,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:31:51,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:31:51,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:31:52,168 INFO L134 CoverageAnalysis]: Checked inductivity of 851 backedges. 216 proven. 343 refuted. 0 times theorem prover too weak. 292 trivial. 0 not checked. [2019-10-02 01:31:52,168 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:31:52,168 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:31:52,187 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:31:52,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:31:52,329 INFO L256 TraceCheckSpWp]: Trace formula consists of 899 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-02 01:31:52,339 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:31:52,549 INFO L134 CoverageAnalysis]: Checked inductivity of 851 backedges. 406 proven. 0 refuted. 0 times theorem prover too weak. 445 trivial. 0 not checked. [2019-10-02 01:31:52,553 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 01:31:52,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2019-10-02 01:31:52,555 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 01:31:52,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 01:31:52,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-10-02 01:31:52,555 INFO L87 Difference]: Start difference. First operand 8439 states and 10958 transitions. Second operand 9 states. [2019-10-02 01:31:56,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:31:56,231 INFO L93 Difference]: Finished difference Result 16933 states and 22103 transitions. [2019-10-02 01:31:56,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-02 01:31:56,232 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 635 [2019-10-02 01:31:56,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:31:56,272 INFO L225 Difference]: With dead ends: 16933 [2019-10-02 01:31:56,272 INFO L226 Difference]: Without dead ends: 8500 [2019-10-02 01:31:56,302 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 661 GetRequests, 643 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2019-10-02 01:31:56,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8500 states. [2019-10-02 01:31:56,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8500 to 8480. [2019-10-02 01:31:56,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8480 states. [2019-10-02 01:31:56,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8480 states to 8480 states and 10665 transitions. [2019-10-02 01:31:56,567 INFO L78 Accepts]: Start accepts. Automaton has 8480 states and 10665 transitions. Word has length 635 [2019-10-02 01:31:56,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:31:56,568 INFO L475 AbstractCegarLoop]: Abstraction has 8480 states and 10665 transitions. [2019-10-02 01:31:56,569 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 01:31:56,569 INFO L276 IsEmpty]: Start isEmpty. Operand 8480 states and 10665 transitions. [2019-10-02 01:31:56,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 666 [2019-10-02 01:31:56,622 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:31:56,623 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, 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, 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] [2019-10-02 01:31:56,624 INFO L418 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:31:56,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:31:56,625 INFO L82 PathProgramCache]: Analyzing trace with hash -226353786, now seen corresponding path program 1 times [2019-10-02 01:31:56,625 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:31:56,625 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:31:56,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:31:56,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:31:56,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:31:56,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:31:57,762 INFO L134 CoverageAnalysis]: Checked inductivity of 851 backedges. 504 proven. 274 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2019-10-02 01:31:57,763 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:31:57,763 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) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 01:31:57,786 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:31:57,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:31:57,942 INFO L256 TraceCheckSpWp]: Trace formula consists of 925 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 01:31:57,953 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:31:58,353 INFO L134 CoverageAnalysis]: Checked inductivity of 851 backedges. 225 proven. 0 refuted. 0 times theorem prover too weak. 626 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (5)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 01:31:58,368 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 01:31:58,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2019-10-02 01:31:58,373 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 01:31:58,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 01:31:58,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-10-02 01:31:58,374 INFO L87 Difference]: Start difference. First operand 8480 states and 10665 transitions. Second operand 9 states. [2019-10-02 01:32:02,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:32:02,942 INFO L93 Difference]: Finished difference Result 20368 states and 25248 transitions. [2019-10-02 01:32:02,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 01:32:02,943 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 665 [2019-10-02 01:32:02,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:32:03,003 INFO L225 Difference]: With dead ends: 20368 [2019-10-02 01:32:03,003 INFO L226 Difference]: Without dead ends: 11894 [2019-10-02 01:32:03,041 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 686 GetRequests, 673 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2019-10-02 01:32:03,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11894 states. [2019-10-02 01:32:03,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11894 to 8812. [2019-10-02 01:32:03,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8812 states. [2019-10-02 01:32:03,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8812 states to 8812 states and 10592 transitions. [2019-10-02 01:32:03,271 INFO L78 Accepts]: Start accepts. Automaton has 8812 states and 10592 transitions. Word has length 665 [2019-10-02 01:32:03,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:32:03,272 INFO L475 AbstractCegarLoop]: Abstraction has 8812 states and 10592 transitions. [2019-10-02 01:32:03,272 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 01:32:03,272 INFO L276 IsEmpty]: Start isEmpty. Operand 8812 states and 10592 transitions. [2019-10-02 01:32:03,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 704 [2019-10-02 01:32:03,308 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:32:03,309 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:03,309 INFO L418 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:32:03,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:32:03,310 INFO L82 PathProgramCache]: Analyzing trace with hash 1224335838, now seen corresponding path program 1 times [2019-10-02 01:32:03,310 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:32:03,310 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:32:03,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:32:03,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:32:03,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:32:03,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:32:04,620 INFO L134 CoverageAnalysis]: Checked inductivity of 750 backedges. 556 proven. 2 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2019-10-02 01:32:04,621 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:32:04,621 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) [2019-10-02 01:32:04,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 01:32:04,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:32:04,795 INFO L256 TraceCheckSpWp]: Trace formula consists of 933 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 01:32:04,803 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:32:05,133 INFO L134 CoverageAnalysis]: Checked inductivity of 750 backedges. 556 proven. 2 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2019-10-02 01:32:05,136 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 01:32:05,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-10-02 01:32:05,138 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 01:32:05,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 01:32:05,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-10-02 01:32:05,141 INFO L87 Difference]: Start difference. First operand 8812 states and 10592 transitions. Second operand 9 states. [2019-10-02 01:32:11,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:32:11,280 INFO L93 Difference]: Finished difference Result 23996 states and 30534 transitions. [2019-10-02 01:32:11,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-02 01:32:11,281 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 703 [2019-10-02 01:32:11,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:32:11,348 INFO L225 Difference]: With dead ends: 23996 [2019-10-02 01:32:11,348 INFO L226 Difference]: Without dead ends: 11620 [2019-10-02 01:32:11,392 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 727 GetRequests, 710 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=107, Invalid=235, Unknown=0, NotChecked=0, Total=342 [2019-10-02 01:32:11,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11620 states. [2019-10-02 01:32:11,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11620 to 11406. [2019-10-02 01:32:11,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11406 states. [2019-10-02 01:32:11,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11406 states to 11406 states and 13164 transitions. [2019-10-02 01:32:11,807 INFO L78 Accepts]: Start accepts. Automaton has 11406 states and 13164 transitions. Word has length 703 [2019-10-02 01:32:11,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:32:11,809 INFO L475 AbstractCegarLoop]: Abstraction has 11406 states and 13164 transitions. [2019-10-02 01:32:11,809 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 01:32:11,809 INFO L276 IsEmpty]: Start isEmpty. Operand 11406 states and 13164 transitions. [2019-10-02 01:32:11,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 974 [2019-10-02 01:32:11,853 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:32:11,854 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, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-02 01:32:11,856 INFO L418 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:32:11,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:32:11,857 INFO L82 PathProgramCache]: Analyzing trace with hash -976365866, now seen corresponding path program 1 times [2019-10-02 01:32:11,857 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:32:11,857 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:32:11,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:32:11,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:32:11,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:32:12,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:32:13,610 INFO L134 CoverageAnalysis]: Checked inductivity of 2021 backedges. 997 proven. 2 refuted. 0 times theorem prover too weak. 1022 trivial. 0 not checked. [2019-10-02 01:32:13,610 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:32:13,611 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:32:13,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:32:13,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:32:13,979 INFO L256 TraceCheckSpWp]: Trace formula consists of 1316 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 01:32:13,997 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:32:14,815 INFO L134 CoverageAnalysis]: Checked inductivity of 2021 backedges. 997 proven. 2 refuted. 0 times theorem prover too weak. 1022 trivial. 0 not checked. [2019-10-02 01:32:14,827 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 01:32:14,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-10-02 01:32:14,830 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 01:32:14,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 01:32:14,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-10-02 01:32:14,830 INFO L87 Difference]: Start difference. First operand 11406 states and 13164 transitions. Second operand 9 states. [2019-10-02 01:32:19,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:32:19,233 INFO L93 Difference]: Finished difference Result 22333 states and 25496 transitions. [2019-10-02 01:32:19,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-02 01:32:19,234 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 973 [2019-10-02 01:32:19,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:32:19,268 INFO L225 Difference]: With dead ends: 22333 [2019-10-02 01:32:19,269 INFO L226 Difference]: Without dead ends: 10875 [2019-10-02 01:32:19,300 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 1000 GetRequests, 981 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=125, Invalid=295, Unknown=0, NotChecked=0, Total=420 [2019-10-02 01:32:19,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10875 states. [2019-10-02 01:32:19,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10875 to 10729. [2019-10-02 01:32:19,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10729 states. [2019-10-02 01:32:19,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10729 states to 10729 states and 11466 transitions. [2019-10-02 01:32:19,525 INFO L78 Accepts]: Start accepts. Automaton has 10729 states and 11466 transitions. Word has length 973 [2019-10-02 01:32:19,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:32:19,527 INFO L475 AbstractCegarLoop]: Abstraction has 10729 states and 11466 transitions. [2019-10-02 01:32:19,527 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 01:32:19,527 INFO L276 IsEmpty]: Start isEmpty. Operand 10729 states and 11466 transitions. [2019-10-02 01:32:19,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1189 [2019-10-02 01:32:19,569 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:32:19,571 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 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, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:19,572 INFO L418 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:32:19,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:32:19,572 INFO L82 PathProgramCache]: Analyzing trace with hash -1989601713, now seen corresponding path program 1 times [2019-10-02 01:32:19,572 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:32:19,572 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:32:19,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:32:19,574 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:32:19,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:32:19,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:32:22,689 INFO L134 CoverageAnalysis]: Checked inductivity of 2953 backedges. 1458 proven. 404 refuted. 0 times theorem prover too weak. 1091 trivial. 0 not checked. [2019-10-02 01:32:22,690 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:32:22,690 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:32:22,707 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:32:22,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:32:22,968 INFO L256 TraceCheckSpWp]: Trace formula consists of 1568 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 01:32:22,987 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:32:24,566 INFO L134 CoverageAnalysis]: Checked inductivity of 2953 backedges. 1252 proven. 2 refuted. 0 times theorem prover too weak. 1699 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (8)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 01:32:24,574 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 01:32:24,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 5] total 18 [2019-10-02 01:32:24,580 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-02 01:32:24,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-02 01:32:24,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2019-10-02 01:32:24,582 INFO L87 Difference]: Start difference. First operand 10729 states and 11466 transitions. Second operand 18 states. [2019-10-02 01:32:25,537 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 38 [2019-10-02 01:32:34,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:32:34,855 INFO L93 Difference]: Finished difference Result 23068 states and 25139 transitions. [2019-10-02 01:32:34,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-10-02 01:32:34,855 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 1188 [2019-10-02 01:32:34,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:32:34,898 INFO L225 Difference]: With dead ends: 23068 [2019-10-02 01:32:34,898 INFO L226 Difference]: Without dead ends: 12349 [2019-10-02 01:32:34,919 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 1264 GetRequests, 1214 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 664 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=562, Invalid=2090, Unknown=0, NotChecked=0, Total=2652 [2019-10-02 01:32:34,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12349 states. [2019-10-02 01:32:35,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12349 to 12317. [2019-10-02 01:32:35,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12317 states. [2019-10-02 01:32:35,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12317 states to 12317 states and 13257 transitions. [2019-10-02 01:32:35,158 INFO L78 Accepts]: Start accepts. Automaton has 12317 states and 13257 transitions. Word has length 1188 [2019-10-02 01:32:35,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:32:35,160 INFO L475 AbstractCegarLoop]: Abstraction has 12317 states and 13257 transitions. [2019-10-02 01:32:35,160 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-02 01:32:35,160 INFO L276 IsEmpty]: Start isEmpty. Operand 12317 states and 13257 transitions. [2019-10-02 01:32:35,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1460 [2019-10-02 01:32:35,232 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:32:35,233 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:35,234 INFO L418 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:32:35,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:32:35,234 INFO L82 PathProgramCache]: Analyzing trace with hash 1900052330, now seen corresponding path program 1 times [2019-10-02 01:32:35,235 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:32:35,235 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:32:35,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:32:35,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:32:35,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:32:35,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:32:36,335 WARN L191 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2019-10-02 01:32:40,632 INFO L134 CoverageAnalysis]: Checked inductivity of 3720 backedges. 855 proven. 675 refuted. 0 times theorem prover too weak. 2190 trivial. 0 not checked. [2019-10-02 01:32:40,632 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:32:40,632 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:32:40,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:32:40,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:32:40,982 INFO L256 TraceCheckSpWp]: Trace formula consists of 1839 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 01:32:41,001 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:32:42,599 INFO L134 CoverageAnalysis]: Checked inductivity of 3720 backedges. 2054 proven. 2 refuted. 0 times theorem prover too weak. 1664 trivial. 0 not checked. [2019-10-02 01:32:42,603 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 01:32:42,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 5] total 14 [2019-10-02 01:32:42,605 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-02 01:32:42,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-02 01:32:42,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2019-10-02 01:32:42,606 INFO L87 Difference]: Start difference. First operand 12317 states and 13257 transitions. Second operand 14 states. [2019-10-02 01:32:42,743 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 38 [2019-10-02 01:32:44,724 WARN L191 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 47 [2019-10-02 01:32:45,491 WARN L191 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2019-10-02 01:32:46,896 WARN L191 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 44 [2019-10-02 01:32:47,824 WARN L191 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2019-10-02 01:32:48,038 WARN L191 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2019-10-02 01:32:48,842 WARN L191 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 45 [2019-10-02 01:32:49,105 WARN L191 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 39 [2019-10-02 01:32:50,136 WARN L191 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 36 [2019-10-02 01:32:50,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:32:50,328 INFO L93 Difference]: Finished difference Result 22460 states and 23979 transitions. [2019-10-02 01:32:50,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-10-02 01:32:50,329 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 1459 [2019-10-02 01:32:50,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:32:50,355 INFO L225 Difference]: With dead ends: 22460 [2019-10-02 01:32:50,355 INFO L226 Difference]: Without dead ends: 11836 [2019-10-02 01:32:50,380 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 1536 GetRequests, 1489 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 609 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=549, Invalid=1707, Unknown=0, NotChecked=0, Total=2256 [2019-10-02 01:32:50,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11836 states. [2019-10-02 01:32:50,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11836 to 11416. [2019-10-02 01:32:50,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11416 states. [2019-10-02 01:32:50,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11416 states to 11416 states and 11872 transitions. [2019-10-02 01:32:50,577 INFO L78 Accepts]: Start accepts. Automaton has 11416 states and 11872 transitions. Word has length 1459 [2019-10-02 01:32:50,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:32:50,578 INFO L475 AbstractCegarLoop]: Abstraction has 11416 states and 11872 transitions. [2019-10-02 01:32:50,578 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-02 01:32:50,578 INFO L276 IsEmpty]: Start isEmpty. Operand 11416 states and 11872 transitions. [2019-10-02 01:32:50,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1525 [2019-10-02 01:32:50,665 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:32:50,668 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 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, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:50,669 INFO L418 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:32:50,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:32:50,670 INFO L82 PathProgramCache]: Analyzing trace with hash 1995698174, now seen corresponding path program 1 times [2019-10-02 01:32:50,670 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:32:50,670 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:32:50,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:32:50,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:32:50,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:32:50,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:32:52,939 INFO L134 CoverageAnalysis]: Checked inductivity of 4134 backedges. 841 proven. 393 refuted. 0 times theorem prover too weak. 2900 trivial. 0 not checked. [2019-10-02 01:32:52,939 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:32:52,939 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:32:52,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:32:53,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:32:53,317 INFO L256 TraceCheckSpWp]: Trace formula consists of 1965 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-02 01:32:53,336 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:32:54,727 INFO L134 CoverageAnalysis]: Checked inductivity of 4134 backedges. 1174 proven. 0 refuted. 0 times theorem prover too weak. 2960 trivial. 0 not checked. [2019-10-02 01:32:54,732 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 01:32:54,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 14 [2019-10-02 01:32:54,734 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-02 01:32:54,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-02 01:32:54,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2019-10-02 01:32:54,735 INFO L87 Difference]: Start difference. First operand 11416 states and 11872 transitions. Second operand 14 states. [2019-10-02 01:33:06,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:33:06,061 INFO L93 Difference]: Finished difference Result 28406 states and 29776 transitions. [2019-10-02 01:33:06,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-10-02 01:33:06,062 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 1524 [2019-10-02 01:33:06,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:33:06,064 INFO L225 Difference]: With dead ends: 28406 [2019-10-02 01:33:06,064 INFO L226 Difference]: Without dead ends: 0 [2019-10-02 01:33:06,106 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 1597 GetRequests, 1551 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 578 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=358, Invalid=1898, Unknown=0, NotChecked=0, Total=2256 [2019-10-02 01:33:06,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-02 01:33:06,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-02 01:33:06,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-02 01:33:06,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-02 01:33:06,107 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1524 [2019-10-02 01:33:06,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:33:06,108 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-02 01:33:06,108 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-02 01:33:06,108 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-02 01:33:06,108 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-02 01:33:06,113 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-02 01:33:07,851 WARN L191 SmtUtils]: Spent 1.72 s on a formula simplification. DAG size of input: 536 DAG size of output: 452 [2019-10-02 01:33:09,597 WARN L191 SmtUtils]: Spent 951.00 ms on a formula simplification. DAG size of input: 536 DAG size of output: 452 [2019-10-02 01:33:14,367 WARN L191 SmtUtils]: Spent 4.74 s on a formula simplification. DAG size of input: 437 DAG size of output: 111 [2019-10-02 01:33:17,210 WARN L191 SmtUtils]: Spent 2.77 s on a formula simplification. DAG size of input: 287 DAG size of output: 107 [2019-10-02 01:33:20,111 WARN L191 SmtUtils]: Spent 2.89 s on a formula simplification. DAG size of input: 275 DAG size of output: 110 [2019-10-02 01:33:22,996 WARN L191 SmtUtils]: Spent 2.87 s on a formula simplification. DAG size of input: 302 DAG size of output: 120 [2019-10-02 01:33:27,676 WARN L191 SmtUtils]: Spent 4.67 s on a formula simplification. DAG size of input: 437 DAG size of output: 111 [2019-10-02 01:33:27,679 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2019-10-02 01:33:27,679 INFO L439 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~a12~0 |old(~a12~0)|) (= ~a16~0 |old(~a16~0)|) (= ~a18~0 |old(~a18~0)|) (= ~a15~0 |old(~a15~0)|)) [2019-10-02 01:33:27,680 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-02 01:33:27,680 INFO L443 ceAbstractionStarter]: For program point L1497(lines 1497 1763) no Hoare annotation was computed. [2019-10-02 01:33:27,680 INFO L443 ceAbstractionStarter]: For program point calculate_output2EXIT(lines 1494 1765) no Hoare annotation was computed. [2019-10-02 01:33:27,680 INFO L443 ceAbstractionStarter]: For program point L1687(lines 1687 1763) no Hoare annotation was computed. [2019-10-02 01:33:27,680 INFO L443 ceAbstractionStarter]: For program point L1704(lines 1704 1763) no Hoare annotation was computed. [2019-10-02 01:33:27,680 INFO L443 ceAbstractionStarter]: For program point L1638(lines 1638 1763) no Hoare annotation was computed. [2019-10-02 01:33:27,680 INFO L443 ceAbstractionStarter]: For program point L1663(lines 1663 1763) no Hoare annotation was computed. [2019-10-02 01:33:27,681 INFO L443 ceAbstractionStarter]: For program point L1597(lines 1597 1763) no Hoare annotation was computed. [2019-10-02 01:33:27,681 INFO L443 ceAbstractionStarter]: For program point L1721(lines 1721 1763) no Hoare annotation was computed. [2019-10-02 01:33:27,681 INFO L443 ceAbstractionStarter]: For program point L1622(lines 1622 1763) no Hoare annotation was computed. [2019-10-02 01:33:27,681 INFO L443 ceAbstractionStarter]: For program point L1746(lines 1746 1763) no Hoare annotation was computed. [2019-10-02 01:33:27,681 INFO L443 ceAbstractionStarter]: For program point L1515(lines 1515 1763) no Hoare annotation was computed. [2019-10-02 01:33:27,681 INFO L443 ceAbstractionStarter]: For program point L1573(lines 1573 1763) no Hoare annotation was computed. [2019-10-02 01:33:27,682 INFO L443 ceAbstractionStarter]: For program point L1540(lines 1540 1763) no Hoare annotation was computed. [2019-10-02 01:33:27,682 INFO L443 ceAbstractionStarter]: For program point L1656(lines 1656 1763) no Hoare annotation was computed. [2019-10-02 01:33:27,682 INFO L443 ceAbstractionStarter]: For program point L1739(lines 1739 1763) no Hoare annotation was computed. [2019-10-02 01:33:27,682 INFO L443 ceAbstractionStarter]: For program point L1566(lines 1566 1763) no Hoare annotation was computed. [2019-10-02 01:33:27,682 INFO L443 ceAbstractionStarter]: For program point L1591(lines 1591 1763) no Hoare annotation was computed. [2019-10-02 01:33:27,682 INFO L443 ceAbstractionStarter]: For program point L1715(lines 1715 1763) no Hoare annotation was computed. [2019-10-02 01:33:27,682 INFO L443 ceAbstractionStarter]: For program point L1682(lines 1682 1763) no Hoare annotation was computed. [2019-10-02 01:33:27,682 INFO L443 ceAbstractionStarter]: For program point L1616(lines 1616 1763) no Hoare annotation was computed. [2019-10-02 01:33:27,683 INFO L443 ceAbstractionStarter]: For program point L1699(lines 1699 1763) no Hoare annotation was computed. [2019-10-02 01:33:27,683 INFO L443 ceAbstractionStarter]: For program point L1633(lines 1633 1763) no Hoare annotation was computed. [2019-10-02 01:33:27,683 INFO L443 ceAbstractionStarter]: For program point L1534(lines 1534 1763) no Hoare annotation was computed. [2019-10-02 01:33:27,683 INFO L443 ceAbstractionStarter]: For program point L1757(lines 1757 1763) no Hoare annotation was computed. [2019-10-02 01:33:27,683 INFO L443 ceAbstractionStarter]: For program point L1559(lines 1559 1763) no Hoare annotation was computed. [2019-10-02 01:33:27,683 INFO L443 ceAbstractionStarter]: For program point L1675(lines 1675 1763) no Hoare annotation was computed. [2019-10-02 01:33:27,683 INFO L443 ceAbstractionStarter]: For program point L1609(lines 1609 1763) no Hoare annotation was computed. [2019-10-02 01:33:27,683 INFO L443 ceAbstractionStarter]: For program point L1510(lines 1510 1763) no Hoare annotation was computed. [2019-10-02 01:33:27,684 INFO L443 ceAbstractionStarter]: For program point L1733(lines 1733 1763) no Hoare annotation was computed. [2019-10-02 01:33:27,684 INFO L439 ceAbstractionStarter]: At program point calculate_output2ENTRY(lines 1494 1765) the Hoare annotation is: (let ((.cse30 (= 7 |old(~a12~0)|))) (let ((.cse17 (= 8 |old(~a16~0)|)) (.cse23 (not .cse30)) (.cse22 (= ~a12~0 7)) (.cse29 (= 6 |old(~a12~0)|)) (.cse15 (= 12 |old(~a16~0)|)) (.cse18 (= 4 |old(~a15~0)|)) (.cse8 (= 8 |old(~a12~0)|)) (.cse9 (= ~a12~0 |old(~a12~0)|)) (.cse11 (= ~a16~0 |old(~a16~0)|)) (.cse12 (= ~a18~0 |old(~a18~0)|)) (.cse10 (= ~a15~0 |old(~a15~0)|))) (let ((.cse16 (not (<= |old(~a12~0)| 5))) (.cse14 (and .cse9 .cse11 .cse12 .cse10)) (.cse5 (or .cse30 (or .cse29 .cse15 .cse18 .cse8))) (.cse21 (not (= 3 |old(~a15~0)|))) (.cse20 (not .cse29)) (.cse25 (= ~a16~0 12)) (.cse24 (not .cse15)) (.cse28 (and .cse22 .cse11 .cse10)) (.cse2 (and .cse10 .cse11 (= ~a12~0 8) .cse12)) (.cse3 (not .cse8)) (.cse26 (or .cse15 .cse18 .cse23)) (.cse0 (not .cse18)) (.cse1 (not .cse17)) (.cse27 (not (= 10 |old(~a16~0)|))) (.cse4 (and .cse9 .cse11 .cse10)) (.cse31 (or .cse29 .cse15 .cse30 .cse18 .cse17)) (.cse7 (not (<= 6 |old(~a12~0)|))) (.cse19 (= ~a12~0 6)) (.cse13 (not (< 0 (+ |old(~a18~0)| 156)))) (.cse6 (not (= 9 |old(~a16~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3) (or .cse4 .cse5 .cse6) (or .cse1 .cse7 .cse8 (and .cse9 .cse10 .cse11 .cse12) .cse13) (or .cse0 .cse14 .cse8 .cse6) (or .cse0 .cse15 .cse16 .cse14 .cse17) (or .cse14 (or .cse18 .cse16) .cse13) (or .cse15 (and .cse11 .cse12 .cse10 .cse19) .cse20) (or (not (<= 135 |old(~a18~0)|)) .cse21 .cse3 .cse2) (or .cse0 .cse1 (and .cse10 .cse22 .cse11 .cse12) .cse23) (or .cse7 .cse14 .cse5) (or (or .cse18 .cse24 .cse23) .cse13 (and .cse22 .cse12 .cse25 .cse10)) (or .cse21 .cse24 (and .cse10 .cse12 .cse25 .cse19) .cse20 .cse13) (or .cse26 .cse27 .cse28) (or (and .cse9 .cse12 .cse25 .cse10) .cse7 (or .cse29 .cse30 .cse18 .cse24)) (or .cse1 (or .cse18 (not (<= |old(~a12~0)| 7))) .cse4) (or .cse26 .cse28 .cse6) (or .cse2 .cse3 .cse31) (or .cse26 .cse13 (and .cse22 .cse11 .cse12 .cse10)) (or .cse0 .cse1 (not (= 5 |old(~a12~0)|)) (and (= ~a12~0 5) .cse10 .cse11 .cse12)) (or .cse27 .cse4 .cse31) (or .cse29 .cse30 .cse7 (not (<= |old(~a12~0)| 8)) (and (not .cse19) (<= ~a12~0 8) (not (= 7 ~a12~0)) .cse10 .cse11 .cse12 (<= 6 ~a12~0)) .cse13 .cse6))))) [2019-10-02 01:33:27,685 INFO L443 ceAbstractionStarter]: For program point L1527(lines 1527 1763) no Hoare annotation was computed. [2019-10-02 01:33:27,685 INFO L443 ceAbstractionStarter]: For program point L1651(lines 1651 1763) no Hoare annotation was computed. [2019-10-02 01:33:27,685 INFO L443 ceAbstractionStarter]: For program point L1585(lines 1585 1763) no Hoare annotation was computed. [2019-10-02 01:33:27,685 INFO L443 ceAbstractionStarter]: For program point L1709(lines 1709 1763) no Hoare annotation was computed. [2019-10-02 01:33:27,685 INFO L443 ceAbstractionStarter]: For program point L1503(lines 1503 1763) no Hoare annotation was computed. [2019-10-02 01:33:27,685 INFO L443 ceAbstractionStarter]: For program point L1693(lines 1693 1763) no Hoare annotation was computed. [2019-10-02 01:33:27,685 INFO L443 ceAbstractionStarter]: For program point L1553(lines 1553 1763) no Hoare annotation was computed. [2019-10-02 01:33:27,685 INFO L443 ceAbstractionStarter]: For program point calculate_output2FINAL(lines 1494 1765) no Hoare annotation was computed. [2019-10-02 01:33:27,686 INFO L443 ceAbstractionStarter]: For program point L1669(lines 1669 1763) no Hoare annotation was computed. [2019-10-02 01:33:27,686 INFO L443 ceAbstractionStarter]: For program point L1603(lines 1603 1763) no Hoare annotation was computed. [2019-10-02 01:33:27,686 INFO L443 ceAbstractionStarter]: For program point L1727(lines 1727 1763) no Hoare annotation was computed. [2019-10-02 01:33:27,686 INFO L443 ceAbstractionStarter]: For program point L1628(lines 1628 1763) no Hoare annotation was computed. [2019-10-02 01:33:27,686 INFO L443 ceAbstractionStarter]: For program point L1752(lines 1752 1763) no Hoare annotation was computed. [2019-10-02 01:33:27,686 INFO L443 ceAbstractionStarter]: For program point L1521(lines 1521 1763) no Hoare annotation was computed. [2019-10-02 01:33:27,686 INFO L443 ceAbstractionStarter]: For program point L1645(lines 1645 1763) no Hoare annotation was computed. [2019-10-02 01:33:27,686 INFO L443 ceAbstractionStarter]: For program point L1579(lines 1579 1763) no Hoare annotation was computed. [2019-10-02 01:33:27,687 INFO L443 ceAbstractionStarter]: For program point L1546(lines 1546 1763) no Hoare annotation was computed. [2019-10-02 01:33:27,687 INFO L443 ceAbstractionStarter]: For program point L894(lines 894 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,687 INFO L443 ceAbstractionStarter]: For program point L828(lines 828 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,687 INFO L443 ceAbstractionStarter]: For program point L696(lines 696 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,687 INFO L443 ceAbstractionStarter]: For program point L1291(lines 1291 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,687 INFO L443 ceAbstractionStarter]: For program point L168-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:33:27,687 INFO L443 ceAbstractionStarter]: For program point L102-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:33:27,687 INFO L443 ceAbstractionStarter]: For program point L36-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:33:27,687 INFO L443 ceAbstractionStarter]: For program point L961(lines 961 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,688 INFO L443 ceAbstractionStarter]: For program point L763(lines 763 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,688 INFO L443 ceAbstractionStarter]: For program point L631(lines 631 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,688 INFO L443 ceAbstractionStarter]: For program point L367(lines 367 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,688 INFO L443 ceAbstractionStarter]: For program point L1358(lines 1358 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,688 INFO L443 ceAbstractionStarter]: For program point L235(lines 235 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,688 INFO L443 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2019-10-02 01:33:27,688 INFO L443 ceAbstractionStarter]: For program point L1160(lines 1160 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,688 INFO L443 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2019-10-02 01:33:27,689 INFO L443 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2019-10-02 01:33:27,689 INFO L439 ceAbstractionStarter]: At program point L1491(line 1491) the Hoare annotation is: (let ((.cse17 (= 7 |old(~a12~0)|))) (let ((.cse24 (= 8 |old(~a16~0)|)) (.cse34 (= ~a12~0 8)) (.cse28 (not .cse17)) (.cse16 (= 6 |old(~a12~0)|)) (.cse23 (= 12 |old(~a16~0)|)) (.cse10 (= 4 |old(~a15~0)|)) (.cse14 (= 8 |old(~a12~0)|)) (.cse32 (= ~a12~0 7)) (.cse19 (= ~a12~0 |old(~a12~0)|)) (.cse22 (= ~a15~0 |old(~a15~0)|)) (.cse25 (= ~a16~0 |old(~a16~0)|)) (.cse20 (= ~a18~0 |old(~a18~0)|))) (let ((.cse12 (and .cse19 .cse22 .cse25 .cse20)) (.cse11 (not (<= |old(~a12~0)| 5))) (.cse6 (and .cse22 .cse32 .cse25 .cse20)) (.cse13 (and .cse19 .cse25 .cse20 .cse22)) (.cse8 (or .cse17 (or .cse16 .cse23 .cse10 .cse14))) (.cse27 (not .cse16)) (.cse21 (= ~a16~0 12)) (.cse18 (not .cse23)) (.cse4 (or .cse23 .cse10 .cse28)) (.cse31 (and .cse32 .cse25 .cse22)) (.cse2 (and .cse22 .cse25 .cse34 .cse20)) (.cse29 (not (= 3 |old(~a15~0)|))) (.cse3 (not .cse14)) (.cse0 (not .cse10)) (.cse1 (not .cse24)) (.cse30 (not (= 10 |old(~a16~0)|))) (.cse7 (and .cse19 .cse25 .cse22)) (.cse33 (or .cse16 .cse23 .cse17 .cse10 .cse24)) (.cse15 (not (<= 6 |old(~a12~0)|))) (.cse26 (= ~a12~0 6)) (.cse5 (not (< 0 (+ |old(~a18~0)| 156)))) (.cse9 (not (= 9 |old(~a16~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3) (or .cse4 .cse5 .cse6) (or .cse7 .cse8 .cse9) (or (or .cse10 .cse11) .cse5 .cse12) (or .cse0 .cse13 .cse14 .cse9) (or .cse0 .cse1 .cse12 .cse15 .cse5) (or .cse15 (or .cse16 .cse17 .cse10 .cse18) (and .cse19 .cse20 .cse21 .cse22)) (or .cse0 .cse23 .cse11 .cse13 .cse24) (or .cse23 (and .cse25 .cse20 .cse22 .cse26) .cse27) (or .cse0 .cse1 .cse6 .cse28) (or .cse15 .cse13 .cse8) (or .cse29 .cse18 .cse27 .cse5 (and .cse22 .cse20 .cse21 .cse26)) (or .cse4 .cse30 .cse31) (or .cse1 (or .cse10 (not (<= |old(~a12~0)| 7))) .cse7) (or (and .cse22 .cse32 .cse20 .cse21) (or .cse10 .cse18 .cse28) .cse5) (or .cse4 .cse31 .cse9) (or .cse2 .cse3 .cse33) (or .cse1 .cse29 .cse3 .cse5 (and (<= 135 |old(~a18~0)|) .cse22 .cse25 .cse34 .cse20)) (or .cse0 .cse1 (not (= 5 |old(~a12~0)|)) (and (or (<= ~a18~0 134) (not (= 3 calculate_output_~input))) (= ~a12~0 5) .cse22 (or (not (= 5 calculate_output_~input)) (< 0 (+ ~a18~0 156))) .cse25 .cse20)) (or .cse30 .cse7 .cse33) (or .cse16 .cse17 .cse15 (not (<= |old(~a12~0)| 8)) (and (not .cse26) (<= ~a12~0 8) (not (= 7 ~a12~0)) .cse22 .cse25 .cse20 (<= 6 ~a12~0)) .cse5 .cse9))))) [2019-10-02 01:33:27,689 INFO L443 ceAbstractionStarter]: For program point L434(lines 434 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,690 INFO L443 ceAbstractionStarter]: For program point L1491-1(line 1491) no Hoare annotation was computed. [2019-10-02 01:33:27,690 INFO L443 ceAbstractionStarter]: For program point L1227(lines 1227 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,690 INFO L443 ceAbstractionStarter]: For program point L567(lines 567 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,690 INFO L443 ceAbstractionStarter]: For program point L501(lines 501 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,690 INFO L443 ceAbstractionStarter]: For program point L303(lines 303 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,690 INFO L443 ceAbstractionStarter]: For program point L171-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:33:27,690 INFO L443 ceAbstractionStarter]: For program point L105-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:33:27,690 INFO L443 ceAbstractionStarter]: For program point L39-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:33:27,691 INFO L443 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2019-10-02 01:33:27,691 INFO L443 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2019-10-02 01:33:27,691 INFO L443 ceAbstractionStarter]: For program point L1097(lines 1097 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,691 INFO L443 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2019-10-02 01:33:27,691 INFO L443 ceAbstractionStarter]: For program point L1031(lines 1031 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,691 INFO L443 ceAbstractionStarter]: For program point L899(lines 899 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,691 INFO L443 ceAbstractionStarter]: For program point L1428(lines 1428 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,691 INFO L443 ceAbstractionStarter]: For program point L834(lines 834 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,691 INFO L443 ceAbstractionStarter]: For program point L636(lines 636 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,692 INFO L443 ceAbstractionStarter]: For program point L1297(lines 1297 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,692 INFO L443 ceAbstractionStarter]: For program point L240(lines 240 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,692 INFO L443 ceAbstractionStarter]: For program point L174-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:33:27,692 INFO L443 ceAbstractionStarter]: For program point L108-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:33:27,692 INFO L443 ceAbstractionStarter]: For program point L42-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:33:27,692 INFO L443 ceAbstractionStarter]: For program point L967(lines 967 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,692 INFO L443 ceAbstractionStarter]: For program point L769(lines 769 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,692 INFO L443 ceAbstractionStarter]: For program point L703(lines 703 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,693 INFO L443 ceAbstractionStarter]: For program point L373(lines 373 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,693 INFO L443 ceAbstractionStarter]: For program point L1364(lines 1364 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,693 INFO L443 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2019-10-02 01:33:27,693 INFO L443 ceAbstractionStarter]: For program point L1166(lines 1166 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,693 INFO L443 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2019-10-02 01:33:27,693 INFO L443 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2019-10-02 01:33:27,693 INFO L443 ceAbstractionStarter]: For program point L440(lines 440 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,693 INFO L443 ceAbstractionStarter]: For program point L573(lines 573 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,694 INFO L443 ceAbstractionStarter]: For program point L309(lines 309 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,694 INFO L443 ceAbstractionStarter]: For program point L1234(lines 1234 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,694 INFO L443 ceAbstractionStarter]: For program point L177-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:33:27,694 INFO L443 ceAbstractionStarter]: For program point L111-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:33:27,694 INFO L443 ceAbstractionStarter]: For program point L45-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:33:27,694 INFO L443 ceAbstractionStarter]: For program point L1036(lines 1036 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,694 INFO L443 ceAbstractionStarter]: For program point L706(lines 706 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,694 INFO L443 ceAbstractionStarter]: For program point L508(lines 508 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,694 INFO L443 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2019-10-02 01:33:27,694 INFO L443 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2019-10-02 01:33:27,695 INFO L443 ceAbstractionStarter]: For program point L1103(lines 1103 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,695 INFO L443 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2019-10-02 01:33:27,695 INFO L443 ceAbstractionStarter]: For program point L905(lines 905 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,695 INFO L443 ceAbstractionStarter]: For program point L641(lines 641 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,695 INFO L443 ceAbstractionStarter]: For program point L443(lines 443 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,695 INFO L443 ceAbstractionStarter]: For program point L1434(lines 1434 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,695 INFO L443 ceAbstractionStarter]: For program point L840(lines 840 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,695 INFO L443 ceAbstractionStarter]: For program point L1303(lines 1303 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,695 INFO L443 ceAbstractionStarter]: For program point L246(lines 246 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,696 INFO L443 ceAbstractionStarter]: For program point L180-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:33:27,696 INFO L443 ceAbstractionStarter]: For program point L114-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:33:27,696 INFO L443 ceAbstractionStarter]: For program point L48-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:33:27,696 INFO L443 ceAbstractionStarter]: For program point L775(lines 775 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,696 INFO L443 ceAbstractionStarter]: For program point L1370(lines 1370 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,696 INFO L443 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2019-10-02 01:33:27,696 INFO L443 ceAbstractionStarter]: For program point L1172(lines 1172 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,696 INFO L443 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2019-10-02 01:33:27,696 INFO L443 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2019-10-02 01:33:27,697 INFO L443 ceAbstractionStarter]: For program point L974(lines 974 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,697 INFO L443 ceAbstractionStarter]: For program point L578(lines 578 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,697 INFO L443 ceAbstractionStarter]: For program point L380(lines 380 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,697 INFO L443 ceAbstractionStarter]: For program point L315(lines 315 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,697 INFO L443 ceAbstractionStarter]: For program point L183-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:33:27,697 INFO L443 ceAbstractionStarter]: For program point L117-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:33:27,697 INFO L443 ceAbstractionStarter]: For program point L51-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:33:27,697 INFO L443 ceAbstractionStarter]: For program point L1042(lines 1042 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,697 INFO L443 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:33:27,698 INFO L443 ceAbstractionStarter]: For program point L778(lines 778 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,698 INFO L443 ceAbstractionStarter]: For program point L712(lines 712 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,698 INFO L443 ceAbstractionStarter]: For program point L1241(lines 1241 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,698 INFO L443 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2019-10-02 01:33:27,698 INFO L443 ceAbstractionStarter]: For program point L1175(lines 1175 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,698 INFO L443 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2019-10-02 01:33:27,698 INFO L443 ceAbstractionStarter]: For program point L1109(lines 1109 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,698 INFO L443 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2019-10-02 01:33:27,698 INFO L443 ceAbstractionStarter]: For program point L515(lines 515 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,699 INFO L443 ceAbstractionStarter]: For program point L449(lines 449 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,699 INFO L443 ceAbstractionStarter]: For program point L1440(lines 1440 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,699 INFO L443 ceAbstractionStarter]: For program point L912(lines 912 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,699 INFO L443 ceAbstractionStarter]: For program point L846(lines 846 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,699 INFO L443 ceAbstractionStarter]: For program point L648(lines 648 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,699 INFO L443 ceAbstractionStarter]: For program point L1375(lines 1375 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,699 INFO L443 ceAbstractionStarter]: For program point L1309(lines 1309 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,699 INFO L443 ceAbstractionStarter]: For program point L252(lines 252 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,699 INFO L443 ceAbstractionStarter]: For program point L186-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:33:27,700 INFO L443 ceAbstractionStarter]: For program point L120-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:33:27,700 INFO L443 ceAbstractionStarter]: For program point L54-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:33:27,700 INFO L443 ceAbstractionStarter]: For program point L979(lines 979 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,700 INFO L443 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2019-10-02 01:33:27,700 INFO L443 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2019-10-02 01:33:27,700 INFO L443 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2019-10-02 01:33:27,700 INFO L443 ceAbstractionStarter]: For program point L584(lines 584 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,700 INFO L443 ceAbstractionStarter]: For program point L386(lines 386 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,700 INFO L443 ceAbstractionStarter]: For program point L717(lines 717 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,701 INFO L443 ceAbstractionStarter]: For program point L321(lines 321 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,701 INFO L443 ceAbstractionStarter]: For program point L189-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:33:27,701 INFO L443 ceAbstractionStarter]: For program point L123-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:33:27,701 INFO L443 ceAbstractionStarter]: For program point L1114(lines 1114 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,701 INFO L443 ceAbstractionStarter]: For program point L57-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:33:27,701 INFO L443 ceAbstractionStarter]: For program point L1048(lines 1048 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,701 INFO L443 ceAbstractionStarter]: For program point L784(lines 784 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,701 INFO L443 ceAbstractionStarter]: For program point L454(lines 454 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,702 INFO L443 ceAbstractionStarter]: For program point L1247(lines 1247 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,702 INFO L443 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2019-10-02 01:33:27,702 INFO L443 ceAbstractionStarter]: For program point L1181(lines 1181 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,702 INFO L443 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2019-10-02 01:33:27,702 INFO L443 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2019-10-02 01:33:27,702 INFO L443 ceAbstractionStarter]: For program point L917(lines 917 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,702 INFO L443 ceAbstractionStarter]: For program point L851(lines 851 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,702 INFO L443 ceAbstractionStarter]: For program point L521(lines 521 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,702 INFO L443 ceAbstractionStarter]: For program point L1446(lines 1446 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,703 INFO L443 ceAbstractionStarter]: For program point L1314(lines 1314 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,703 INFO L443 ceAbstractionStarter]: For program point L257(lines 257 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,703 INFO L439 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 23 1492) the Hoare annotation is: (let ((.cse30 (= 7 |old(~a12~0)|))) (let ((.cse17 (= 8 |old(~a16~0)|)) (.cse23 (not .cse30)) (.cse22 (= ~a12~0 7)) (.cse29 (= 6 |old(~a12~0)|)) (.cse15 (= 12 |old(~a16~0)|)) (.cse18 (= 4 |old(~a15~0)|)) (.cse8 (= 8 |old(~a12~0)|)) (.cse9 (= ~a12~0 |old(~a12~0)|)) (.cse11 (= ~a16~0 |old(~a16~0)|)) (.cse12 (= ~a18~0 |old(~a18~0)|)) (.cse10 (= ~a15~0 |old(~a15~0)|))) (let ((.cse16 (not (<= |old(~a12~0)| 5))) (.cse14 (and .cse9 .cse11 .cse12 .cse10)) (.cse5 (or .cse30 (or .cse29 .cse15 .cse18 .cse8))) (.cse21 (not (= 3 |old(~a15~0)|))) (.cse20 (not .cse29)) (.cse25 (= ~a16~0 12)) (.cse24 (not .cse15)) (.cse28 (and .cse22 .cse11 .cse10)) (.cse2 (and .cse10 .cse11 (= ~a12~0 8) .cse12)) (.cse3 (not .cse8)) (.cse26 (or .cse15 .cse18 .cse23)) (.cse0 (not .cse18)) (.cse1 (not .cse17)) (.cse27 (not (= 10 |old(~a16~0)|))) (.cse4 (and .cse9 .cse11 .cse10)) (.cse31 (or .cse29 .cse15 .cse30 .cse18 .cse17)) (.cse7 (not (<= 6 |old(~a12~0)|))) (.cse19 (= ~a12~0 6)) (.cse13 (not (< 0 (+ |old(~a18~0)| 156)))) (.cse6 (not (= 9 |old(~a16~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3) (or .cse4 .cse5 .cse6) (or .cse1 .cse7 .cse8 (and .cse9 .cse10 .cse11 .cse12) .cse13) (or .cse0 .cse14 .cse8 .cse6) (or .cse0 .cse15 .cse16 .cse14 .cse17) (or .cse14 (or .cse18 .cse16) .cse13) (or .cse15 (and .cse11 .cse12 .cse10 .cse19) .cse20) (or .cse21 .cse2 .cse3 .cse13) (or .cse0 .cse1 (and .cse10 .cse22 .cse11 .cse12) .cse23) (or .cse7 .cse14 .cse5) (or (or .cse18 .cse24 .cse23) .cse13 (and .cse22 .cse12 .cse25 .cse10)) (or .cse21 .cse24 (and .cse10 .cse12 .cse25 .cse19) .cse20 .cse13) (or .cse26 .cse27 .cse28) (or (and .cse9 .cse12 .cse25 .cse10) .cse7 (or .cse29 .cse30 .cse18 .cse24)) (or .cse1 (or .cse18 (not (<= |old(~a12~0)| 7))) .cse4) (or .cse26 .cse28 .cse6) (or .cse2 .cse3 .cse31) (or .cse26 .cse13 (and .cse22 .cse11 .cse12 .cse10)) (or .cse0 .cse1 (not (= 5 |old(~a12~0)|)) (and (= ~a12~0 5) .cse10 .cse11 .cse12)) (or .cse27 .cse4 .cse31) (or .cse29 .cse30 .cse7 (not (<= |old(~a12~0)| 8)) (and (not .cse19) (<= ~a12~0 8) (not (= 7 ~a12~0)) .cse10 .cse11 .cse12 (<= 6 ~a12~0)) .cse13 .cse6))))) [2019-10-02 01:33:27,703 INFO L443 ceAbstractionStarter]: For program point L1381(lines 1381 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,704 INFO L443 ceAbstractionStarter]: For program point L192-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:33:27,704 INFO L443 ceAbstractionStarter]: For program point L126-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:33:27,704 INFO L443 ceAbstractionStarter]: For program point L60-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:33:27,704 INFO L443 ceAbstractionStarter]: For program point L655(lines 655 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,704 INFO L443 ceAbstractionStarter]: For program point L589(lines 589 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,704 INFO L443 ceAbstractionStarter]: For program point L457(lines 457 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,704 INFO L443 ceAbstractionStarter]: For program point L391(lines 391 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,704 INFO L443 ceAbstractionStarter]: For program point L1250(lines 1250 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,704 INFO L443 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2019-10-02 01:33:27,705 INFO L443 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2019-10-02 01:33:27,705 INFO L443 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2019-10-02 01:33:27,705 INFO L443 ceAbstractionStarter]: For program point L986(lines 986 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,705 INFO L443 ceAbstractionStarter]: For program point L1449(lines 1449 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,705 INFO L443 ceAbstractionStarter]: For program point L789(lines 789 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,705 INFO L443 ceAbstractionStarter]: For program point L723(lines 723 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,705 INFO L443 ceAbstractionStarter]: For program point L327(lines 327 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,705 INFO L443 ceAbstractionStarter]: For program point L195-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:33:27,706 INFO L443 ceAbstractionStarter]: For program point L129-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:33:27,706 INFO L443 ceAbstractionStarter]: For program point L1120(lines 1120 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,706 INFO L443 ceAbstractionStarter]: For program point L63-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:33:27,706 INFO L443 ceAbstractionStarter]: For program point L922(lines 922 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,706 INFO L443 ceAbstractionStarter]: For program point L262(lines 262 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,706 INFO L443 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2019-10-02 01:33:27,706 INFO L443 ceAbstractionStarter]: For program point L1187(lines 1187 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,706 INFO L443 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2019-10-02 01:33:27,706 INFO L443 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2019-10-02 01:33:27,706 INFO L443 ceAbstractionStarter]: For program point L1055(lines 1055 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,707 INFO L443 ceAbstractionStarter]: For program point L857(lines 857 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,707 INFO L443 ceAbstractionStarter]: For program point L527(lines 527 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,707 INFO L443 ceAbstractionStarter]: For program point L1386(lines 1386 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,707 INFO L443 ceAbstractionStarter]: For program point L594(lines 594 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,707 INFO L443 ceAbstractionStarter]: For program point L1321(lines 1321 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,707 INFO L443 ceAbstractionStarter]: For program point L198-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:33:27,707 INFO L443 ceAbstractionStarter]: For program point L132-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:33:27,707 INFO L443 ceAbstractionStarter]: For program point L66-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:33:27,707 INFO L443 ceAbstractionStarter]: For program point L661(lines 661 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,707 INFO L443 ceAbstractionStarter]: For program point L463(lines 463 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,708 INFO L443 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 172) no Hoare annotation was computed. [2019-10-02 01:33:27,708 INFO L443 ceAbstractionStarter]: For program point L1256(lines 1256 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,708 INFO L443 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2019-10-02 01:33:27,708 INFO L443 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2019-10-02 01:33:27,708 INFO L443 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2019-10-02 01:33:27,708 INFO L443 ceAbstractionStarter]: For program point L728(lines 728 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,708 INFO L443 ceAbstractionStarter]: For program point L398(lines 398 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,708 INFO L443 ceAbstractionStarter]: For program point L1125(lines 1125 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,709 INFO L443 ceAbstractionStarter]: For program point L993(lines 993 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,709 INFO L443 ceAbstractionStarter]: For program point L1456(lines 1456 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,709 INFO L443 ceAbstractionStarter]: For program point L333(lines 333 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,709 INFO L443 ceAbstractionStarter]: For program point L201-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:33:27,709 INFO L443 ceAbstractionStarter]: For program point L135-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:33:27,709 INFO L443 ceAbstractionStarter]: For program point L69-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:33:27,709 INFO L443 ceAbstractionStarter]: For program point L796(lines 796 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,709 INFO L443 ceAbstractionStarter]: For program point L664(lines 664 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,709 INFO L443 ceAbstractionStarter]: For program point L268(lines 268 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,710 INFO L443 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2019-10-02 01:33:27,710 INFO L443 ceAbstractionStarter]: For program point L1193(lines 1193 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,710 INFO L443 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2019-10-02 01:33:27,710 INFO L443 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2019-10-02 01:33:27,710 INFO L443 ceAbstractionStarter]: For program point L1061(lines 1061 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,710 INFO L443 ceAbstractionStarter]: For program point L929(lines 929 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,710 INFO L443 ceAbstractionStarter]: For program point L863(lines 863 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,710 INFO L443 ceAbstractionStarter]: For program point L533(lines 533 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,710 INFO L443 ceAbstractionStarter]: For program point L1392(lines 1392 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,710 INFO L443 ceAbstractionStarter]: For program point L600(lines 600 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,711 INFO L443 ceAbstractionStarter]: For program point L1327(lines 1327 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,711 INFO L443 ceAbstractionStarter]: For program point L204-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:33:27,711 INFO L443 ceAbstractionStarter]: For program point L138-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:33:27,711 INFO L443 ceAbstractionStarter]: For program point L72-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:33:27,711 INFO L443 ceAbstractionStarter]: For program point L469(lines 469 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,711 INFO L443 ceAbstractionStarter]: For program point L1262(lines 1262 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,711 INFO L443 ceAbstractionStarter]: For program point L205(line 205) no Hoare annotation was computed. [2019-10-02 01:33:27,711 INFO L443 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2019-10-02 01:33:27,711 INFO L443 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2019-10-02 01:33:27,711 INFO L443 ceAbstractionStarter]: For program point L734(lines 734 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,712 INFO L443 ceAbstractionStarter]: For program point L1461(lines 1461 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,712 INFO L443 ceAbstractionStarter]: For program point L404(lines 404 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,712 INFO L443 ceAbstractionStarter]: For program point L338(lines 338 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,712 INFO L443 ceAbstractionStarter]: For program point L1131(lines 1131 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,712 INFO L443 ceAbstractionStarter]: For program point L999(lines 999 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,712 INFO L443 ceAbstractionStarter]: For program point L141-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:33:27,712 INFO L443 ceAbstractionStarter]: For program point L75-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:33:27,712 INFO L443 ceAbstractionStarter]: For program point L802(lines 802 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,712 INFO L443 ceAbstractionStarter]: For program point L670(lines 670 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,713 INFO L443 ceAbstractionStarter]: For program point L538(lines 538 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,713 INFO L443 ceAbstractionStarter]: For program point L1397(lines 1397 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,713 INFO L443 ceAbstractionStarter]: For program point L274(lines 274 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,713 INFO L443 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2019-10-02 01:33:27,713 INFO L443 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2019-10-02 01:33:27,713 INFO L443 ceAbstractionStarter]: For program point L1067(lines 1067 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,713 INFO L443 ceAbstractionStarter]: For program point L935(lines 935 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,713 INFO L443 ceAbstractionStarter]: For program point L869(lines 869 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,713 INFO L443 ceAbstractionStarter]: For program point L1200(lines 1200 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,714 INFO L443 ceAbstractionStarter]: For program point L606(lines 606 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,714 INFO L443 ceAbstractionStarter]: For program point L1267(lines 1267 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,714 INFO L443 ceAbstractionStarter]: For program point L144-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:33:27,714 INFO L443 ceAbstractionStarter]: For program point L78-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:33:27,714 INFO L443 ceAbstractionStarter]: For program point L1466(lines 1466 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,714 INFO L443 ceAbstractionStarter]: For program point L1334(lines 1334 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,714 INFO L443 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2019-10-02 01:33:27,714 INFO L443 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2019-10-02 01:33:27,714 INFO L443 ceAbstractionStarter]: For program point L476(lines 476 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,715 INFO L443 ceAbstractionStarter]: For program point L1137(lines 1137 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,715 INFO L443 ceAbstractionStarter]: For program point L1005(lines 1005 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,715 INFO L443 ceAbstractionStarter]: For program point L741(lines 741 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,715 INFO L443 ceAbstractionStarter]: For program point L543(lines 543 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,715 INFO L443 ceAbstractionStarter]: For program point L411(lines 411 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,715 INFO L443 ceAbstractionStarter]: For program point L345(lines 345 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,715 INFO L443 ceAbstractionStarter]: For program point L279(lines 279 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,715 INFO L443 ceAbstractionStarter]: For program point L213(lines 213 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,715 INFO L443 ceAbstractionStarter]: For program point L147-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:33:27,716 INFO L443 ceAbstractionStarter]: For program point L81-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:33:27,716 INFO L443 ceAbstractionStarter]: For program point L808(lines 808 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,716 INFO L443 ceAbstractionStarter]: For program point L1403(lines 1403 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,716 INFO L443 ceAbstractionStarter]: For program point L1205(lines 1205 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,716 INFO L443 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2019-10-02 01:33:27,716 INFO L443 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2019-10-02 01:33:27,716 INFO L443 ceAbstractionStarter]: For program point L1073(lines 1073 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,716 INFO L443 ceAbstractionStarter]: For program point L875(lines 875 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,716 INFO L443 ceAbstractionStarter]: For program point L677(lines 677 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,716 INFO L443 ceAbstractionStarter]: For program point L942(lines 942 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,717 INFO L443 ceAbstractionStarter]: For program point L612(lines 612 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,717 INFO L443 ceAbstractionStarter]: For program point L150-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:33:27,717 INFO L443 ceAbstractionStarter]: For program point L84-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:33:27,717 INFO L443 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:33:27,717 INFO L443 ceAbstractionStarter]: For program point L1472(lines 1472 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,717 INFO L443 ceAbstractionStarter]: For program point L1274(lines 1274 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,717 INFO L443 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2019-10-02 01:33:27,717 INFO L443 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2019-10-02 01:33:27,717 INFO L443 ceAbstractionStarter]: For program point L746(lines 746 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,718 INFO L443 ceAbstractionStarter]: For program point L680(lines 680 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,718 INFO L443 ceAbstractionStarter]: For program point L548(lines 548 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,718 INFO L443 ceAbstractionStarter]: For program point L350(lines 350 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,718 INFO L443 ceAbstractionStarter]: For program point L1341(lines 1341 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,718 INFO L443 ceAbstractionStarter]: For program point L218(lines 218 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,718 INFO L443 ceAbstractionStarter]: For program point L1143(lines 1143 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,718 INFO L443 ceAbstractionStarter]: For program point L1011(lines 1011 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,718 INFO L443 ceAbstractionStarter]: For program point L483(lines 483 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,718 INFO L443 ceAbstractionStarter]: For program point L417(lines 417 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,718 INFO L443 ceAbstractionStarter]: For program point L285(lines 285 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,719 INFO L443 ceAbstractionStarter]: For program point L153-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:33:27,719 INFO L443 ceAbstractionStarter]: For program point L87-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:33:27,719 INFO L443 ceAbstractionStarter]: For program point L1409(lines 1409 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,719 INFO L443 ceAbstractionStarter]: For program point L1211(lines 1211 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,719 INFO L443 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2019-10-02 01:33:27,719 INFO L443 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2019-10-02 01:33:27,719 INFO L443 ceAbstractionStarter]: For program point L1079(lines 1079 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,719 INFO L443 ceAbstractionStarter]: For program point L815(lines 815 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,719 INFO L443 ceAbstractionStarter]: For program point L948(lines 948 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,719 INFO L443 ceAbstractionStarter]: For program point L882(lines 882 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,720 INFO L443 ceAbstractionStarter]: For program point L618(lines 618 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,720 INFO L443 ceAbstractionStarter]: For program point L1477(lines 1477 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,720 INFO L443 ceAbstractionStarter]: For program point L156-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:33:27,720 INFO L443 ceAbstractionStarter]: For program point L90-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:33:27,720 INFO L443 ceAbstractionStarter]: For program point L24(lines 24 26) no Hoare annotation was computed. [2019-10-02 01:33:27,720 INFO L443 ceAbstractionStarter]: For program point L24-2(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:33:27,720 INFO L443 ceAbstractionStarter]: For program point L1280(lines 1280 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,720 INFO L443 ceAbstractionStarter]: For program point L223(lines 223 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,720 INFO L443 ceAbstractionStarter]: For program point L1214(lines 1214 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,720 INFO L443 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2019-10-02 01:33:27,720 INFO L443 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2019-10-02 01:33:27,721 INFO L443 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2019-10-02 01:33:27,721 INFO L443 ceAbstractionStarter]: For program point L752(lines 752 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,721 INFO L443 ceAbstractionStarter]: For program point L686(lines 686 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,721 INFO L443 ceAbstractionStarter]: For program point L554(lines 554 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,721 INFO L443 ceAbstractionStarter]: For program point L356(lines 356 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,721 INFO L443 ceAbstractionStarter]: For program point L1347(lines 1347 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,721 INFO L443 ceAbstractionStarter]: For program point L290(lines 290 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,721 INFO L443 ceAbstractionStarter]: For program point L1149(lines 1149 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,721 INFO L443 ceAbstractionStarter]: For program point L489(lines 489 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,721 INFO L443 ceAbstractionStarter]: For program point L159-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:33:27,722 INFO L443 ceAbstractionStarter]: For program point L93-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:33:27,722 INFO L443 ceAbstractionStarter]: For program point L27-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:33:27,722 INFO L443 ceAbstractionStarter]: For program point L1018(lines 1018 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,722 INFO L443 ceAbstractionStarter]: For program point L424(lines 424 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,722 INFO L443 ceAbstractionStarter]: For program point L1415(lines 1415 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,722 INFO L443 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2019-10-02 01:33:27,722 INFO L443 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2019-10-02 01:33:27,722 INFO L443 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2019-10-02 01:33:27,722 INFO L443 ceAbstractionStarter]: For program point L1086(lines 1086 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,722 INFO L443 ceAbstractionStarter]: For program point L954(lines 954 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,723 INFO L443 ceAbstractionStarter]: For program point L888(lines 888 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,723 INFO L443 ceAbstractionStarter]: For program point L822(lines 822 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,723 INFO L443 ceAbstractionStarter]: For program point L624(lines 624 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,723 INFO L443 ceAbstractionStarter]: For program point L162-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:33:27,723 INFO L443 ceAbstractionStarter]: For program point L96-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:33:27,723 INFO L443 ceAbstractionStarter]: For program point L30-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:33:27,723 INFO L443 ceAbstractionStarter]: For program point L691(lines 691 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,723 INFO L443 ceAbstractionStarter]: For program point L1484(lines 1484 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,723 INFO L443 ceAbstractionStarter]: For program point L427(lines 427 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,723 INFO L443 ceAbstractionStarter]: For program point L361(lines 361 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,724 INFO L443 ceAbstractionStarter]: For program point L1286(lines 1286 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,724 INFO L443 ceAbstractionStarter]: For program point L229(lines 229 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,724 INFO L443 ceAbstractionStarter]: For program point L1220(lines 1220 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,724 INFO L443 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2019-10-02 01:33:27,724 INFO L443 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2019-10-02 01:33:27,724 INFO L443 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2019-10-02 01:33:27,724 INFO L443 ceAbstractionStarter]: For program point L758(lines 758 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,724 INFO L443 ceAbstractionStarter]: For program point L560(lines 560 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,724 INFO L443 ceAbstractionStarter]: For program point L1353(lines 1353 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,725 INFO L443 ceAbstractionStarter]: For program point L1155(lines 1155 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,725 INFO L443 ceAbstractionStarter]: For program point L495(lines 495 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,725 INFO L443 ceAbstractionStarter]: For program point L297(lines 297 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,725 INFO L443 ceAbstractionStarter]: For program point L165-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:33:27,725 INFO L443 ceAbstractionStarter]: For program point L99-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:33:27,725 INFO L443 ceAbstractionStarter]: For program point L33-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:33:27,725 INFO L443 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2019-10-02 01:33:27,725 INFO L443 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2019-10-02 01:33:27,725 INFO L443 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2019-10-02 01:33:27,726 INFO L443 ceAbstractionStarter]: For program point L1025(lines 1025 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,726 INFO L443 ceAbstractionStarter]: For program point L1422(lines 1422 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,726 INFO L443 ceAbstractionStarter]: For program point L1092(lines 1092 1490) no Hoare annotation was computed. [2019-10-02 01:33:27,726 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-02 01:33:27,726 INFO L439 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (not (= ~a16~0 8)) (not (= 12 ~a16~0)) (<= ~a12~0 5) (= (+ ~a18~0 87) 0) (not (= 4 ~a15~0))) [2019-10-02 01:33:27,726 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-02 01:33:27,726 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-02 01:33:27,726 INFO L439 ceAbstractionStarter]: At program point mainENTRY(lines 1767 1783) the Hoare annotation is: (or (= 12 |old(~a16~0)|) (and (= ~a12~0 |old(~a12~0)|) (= ~a15~0 |old(~a15~0)|) (= ~a16~0 |old(~a16~0)|) (= ~a18~0 |old(~a18~0)|)) (= 4 |old(~a15~0)|) (not (= (+ |old(~a18~0)| 87) 0)) (not (<= |old(~a12~0)| 5)) (= 8 |old(~a16~0)|)) [2019-10-02 01:33:27,727 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 1767 1783) no Hoare annotation was computed. [2019-10-02 01:33:27,727 INFO L439 ceAbstractionStarter]: At program point L1781(line 1781) the Hoare annotation is: (let ((.cse25 (= ~a12~0 6))) (let ((.cse17 (not .cse25)) (.cse24 (not (= 12 ~a16~0))) (.cse16 (= ~a12~0 8))) (let ((.cse8 (and .cse17 .cse24 (not .cse16))) (.cse19 (not (= 4 ~a15~0))) (.cse0 (= ~a16~0 8))) (let ((.cse23 (= ~a12~0 7)) (.cse7 (not .cse0)) (.cse12 (= ~a15~0 |old(~a15~0)|)) (.cse21 (and .cse8 .cse19)) (.cse9 (<= ~a12~0 5)) (.cse2 (<= 10 |old(~a16~0)|)) (.cse3 (= 3 |old(~a15~0)|)) (.cse18 (not (= 7 ~a12~0)))) (let ((.cse10 (and .cse3 (<= ~a12~0 7) .cse18 (and .cse24 .cse19))) (.cse1 (= ~a15~0 4)) (.cse6 (<= 6 ~a12~0)) (.cse20 (and (or (and (and (and .cse7 .cse21) .cse9) .cse12) (and (and .cse21 .cse9) .cse3)) .cse2)) (.cse11 (= ~a16~0 |old(~a16~0)|)) (.cse13 (= 10 |old(~a16~0)|)) (.cse22 (and .cse3 (and .cse23 .cse21))) (.cse14 (and .cse3 (and .cse17 .cse7 .cse24 .cse19) .cse18)) (.cse15 (= ~a16~0 9)) (.cse4 (= 5 |old(~a12~0)|)) (.cse5 (< 0 (+ ~a18~0 156)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (not (= (+ |old(~a18~0)| 87) 0)) (and (and (and .cse1 (and .cse7 .cse8) .cse3 .cse9) .cse2) .cse4) (and .cse0 .cse10 .cse2) (and (= ~a12~0 |old(~a12~0)|) .cse11 (= (+ ~a18~0 87) 0) .cse12) (and .cse11 .cse13 .cse10) (and .cse11 .cse13 .cse14) (not (<= |old(~a12~0)| 5)) (and (and .cse15 (and .cse3 .cse8) .cse2) .cse4) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse16) (and (and (and .cse0 .cse3) .cse2) (= ~a15~0 3) .cse5) (= 4 |old(~a15~0)|) (and .cse4 .cse2 .cse14 .cse6) (and .cse1 .cse3 .cse4 (= ~a12~0 5) .cse2 .cse8) (and .cse3 .cse4 .cse17 .cse2 .cse18 (= ~a16~0 12) .cse19 .cse6) (and .cse15 .cse20) (and .cse4 .cse20 .cse5) (= 8 |old(~a16~0)|) (and .cse0 (and .cse3 .cse21) .cse2) (and .cse22 .cse11 .cse13) (= 12 |old(~a16~0)|) (and (and .cse4 (and .cse3 .cse9 .cse2 .cse19)) .cse5) (and .cse2 .cse12 .cse3 .cse4 .cse5) (and .cse3 .cse4 .cse23 .cse2 .cse5 .cse19) (and .cse15 .cse22 .cse2) (and .cse3 .cse4 .cse24 .cse2 .cse25) (and .cse0 .cse2 .cse3 .cse4 .cse23) (and .cse15 .cse2 .cse14) (and .cse15 (and .cse3 .cse4 .cse2) .cse5))))))) [2019-10-02 01:33:27,727 INFO L443 ceAbstractionStarter]: For program point L1781-1(line 1781) no Hoare annotation was computed. [2019-10-02 01:33:27,727 INFO L443 ceAbstractionStarter]: For program point L1778(line 1778) no Hoare annotation was computed. [2019-10-02 01:33:27,728 INFO L439 ceAbstractionStarter]: At program point L1773-2(lines 1773 1782) the Hoare annotation is: (let ((.cse25 (= ~a12~0 6))) (let ((.cse17 (not .cse25)) (.cse24 (not (= 12 ~a16~0))) (.cse16 (= ~a12~0 8))) (let ((.cse8 (and .cse17 .cse24 (not .cse16))) (.cse19 (not (= 4 ~a15~0))) (.cse0 (= ~a16~0 8))) (let ((.cse23 (= ~a12~0 7)) (.cse7 (not .cse0)) (.cse12 (= ~a15~0 |old(~a15~0)|)) (.cse21 (and .cse8 .cse19)) (.cse9 (<= ~a12~0 5)) (.cse2 (<= 10 |old(~a16~0)|)) (.cse3 (= 3 |old(~a15~0)|)) (.cse18 (not (= 7 ~a12~0)))) (let ((.cse10 (and .cse3 (<= ~a12~0 7) .cse18 (and .cse24 .cse19))) (.cse1 (= ~a15~0 4)) (.cse6 (<= 6 ~a12~0)) (.cse20 (and (or (and (and (and .cse7 .cse21) .cse9) .cse12) (and (and .cse21 .cse9) .cse3)) .cse2)) (.cse11 (= ~a16~0 |old(~a16~0)|)) (.cse13 (= 10 |old(~a16~0)|)) (.cse22 (and .cse3 (and .cse23 .cse21))) (.cse14 (and .cse3 (and .cse17 .cse7 .cse24 .cse19) .cse18)) (.cse15 (= ~a16~0 9)) (.cse4 (= 5 |old(~a12~0)|)) (.cse5 (< 0 (+ ~a18~0 156)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (not (= (+ |old(~a18~0)| 87) 0)) (and (and (and .cse1 (and .cse7 .cse8) .cse3 .cse9) .cse2) .cse4) (and .cse0 .cse10 .cse2) (and (= ~a12~0 |old(~a12~0)|) .cse11 (= (+ ~a18~0 87) 0) .cse12) (and .cse11 .cse13 .cse10) (and .cse11 .cse13 .cse14) (not (<= |old(~a12~0)| 5)) (and (and .cse15 (and .cse3 .cse8) .cse2) .cse4) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse16) (and (and (and .cse0 .cse3) .cse2) (= ~a15~0 3) .cse5) (= 4 |old(~a15~0)|) (and .cse4 .cse2 .cse14 .cse6) (and .cse1 .cse3 .cse4 (= ~a12~0 5) .cse2 .cse8) (and .cse3 .cse4 .cse17 .cse2 .cse18 (= ~a16~0 12) .cse19 .cse6) (and .cse15 .cse20) (and .cse4 .cse20 .cse5) (= 8 |old(~a16~0)|) (and .cse0 (and .cse3 .cse21) .cse2) (and .cse22 .cse11 .cse13) (= 12 |old(~a16~0)|) (and (and .cse4 (and .cse3 .cse9 .cse2 .cse19)) .cse5) (and .cse2 .cse12 .cse3 .cse4 .cse5) (and .cse3 .cse4 .cse23 .cse2 .cse5 .cse19) (and .cse15 .cse22 .cse2) (and .cse3 .cse4 .cse24 .cse2 .cse25) (and .cse0 .cse2 .cse3 .cse4 .cse23) (and .cse15 .cse2 .cse14) (and .cse15 (and .cse3 .cse4 .cse2) .cse5))))))) [2019-10-02 01:33:27,728 INFO L443 ceAbstractionStarter]: For program point L1773-3(lines 1767 1783) no Hoare annotation was computed. [2019-10-02 01:33:27,762 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,762 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-02 01:33:27,764 INFO L168 Benchmark]: Toolchain (without parser) took 124090.29 ms. Allocated memory was 133.2 MB in the beginning and 2.7 GB in the end (delta: 2.5 GB). Free memory was 84.6 MB in the beginning and 1.1 GB in the end (delta: -1.0 GB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. [2019-10-02 01:33:27,765 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 133.2 MB. Free memory was 107.5 MB in the beginning and 107.2 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:27,766 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1535.83 ms. Allocated memory was 133.2 MB in the beginning and 201.9 MB in the end (delta: 68.7 MB). Free memory was 84.4 MB in the beginning and 120.2 MB in the end (delta: -35.8 MB). Peak memory consumption was 38.1 MB. Max. memory is 7.1 GB. [2019-10-02 01:33:27,766 INFO L168 Benchmark]: Boogie Preprocessor took 164.82 ms. Allocated memory is still 201.9 MB. Free memory was 120.2 MB in the beginning and 109.8 MB in the end (delta: 10.4 MB). Peak memory consumption was 10.4 MB. Max. memory is 7.1 GB. [2019-10-02 01:33:27,767 INFO L168 Benchmark]: RCFGBuilder took 2497.39 ms. Allocated memory was 201.9 MB in the beginning and 268.4 MB in the end (delta: 66.6 MB). Free memory was 109.8 MB in the beginning and 135.1 MB in the end (delta: -25.3 MB). Peak memory consumption was 74.7 MB. Max. memory is 7.1 GB. [2019-10-02 01:33:27,768 INFO L168 Benchmark]: TraceAbstraction took 119886.29 ms. Allocated memory was 268.4 MB in the beginning and 2.7 GB in the end (delta: 2.4 GB). Free memory was 135.1 MB in the beginning and 1.1 GB in the end (delta: -974.8 MB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. [2019-10-02 01:33:27,772 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.25 ms. Allocated memory is still 133.2 MB. Free memory was 107.5 MB in the beginning and 107.2 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1535.83 ms. Allocated memory was 133.2 MB in the beginning and 201.9 MB in the end (delta: 68.7 MB). Free memory was 84.4 MB in the beginning and 120.2 MB in the end (delta: -35.8 MB). Peak memory consumption was 38.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 164.82 ms. Allocated memory is still 201.9 MB. Free memory was 120.2 MB in the beginning and 109.8 MB in the end (delta: 10.4 MB). Peak memory consumption was 10.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2497.39 ms. Allocated memory was 201.9 MB in the beginning and 268.4 MB in the end (delta: 66.6 MB). Free memory was 109.8 MB in the beginning and 135.1 MB in the end (delta: -25.3 MB). Peak memory consumption was 74.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 119886.29 ms. Allocated memory was 268.4 MB in the beginning and 2.7 GB in the end (delta: 2.4 GB). Free memory was 135.1 MB in the beginning and 1.1 GB in the end (delta: -974.8 MB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 172]: 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: 1773]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((a16 == 8 && a15 == 4) && 10 <= \old(a16)) && 3 == \old(a15)) && 5 == \old(a12)) && 0 < a18 + 156) && 6 <= a12) || !(\old(a18) + 87 == 0)) || (((((a15 == 4 && !(a16 == 8) && (!(a12 == 6) && !(12 == a16)) && !(a12 == 8)) && 3 == \old(a15)) && a12 <= 5) && 10 <= \old(a16)) && 5 == \old(a12))) || ((a16 == 8 && ((3 == \old(a15) && a12 <= 7) && !(7 == a12)) && !(12 == a16) && !(4 == a15)) && 10 <= \old(a16))) || (((a12 == \old(a12) && a16 == \old(a16)) && a18 + 87 == 0) && a15 == \old(a15))) || ((a16 == \old(a16) && 10 == \old(a16)) && ((3 == \old(a15) && a12 <= 7) && !(7 == a12)) && !(12 == a16) && !(4 == a15))) || ((a16 == \old(a16) && 10 == \old(a16)) && (3 == \old(a15) && ((!(a12 == 6) && !(a16 == 8)) && !(12 == a16)) && !(4 == a15)) && !(7 == a12))) || !(\old(a12) <= 5)) || (((a16 == 9 && 3 == \old(a15) && (!(a12 == 6) && !(12 == a16)) && !(a12 == 8)) && 10 <= \old(a16)) && 5 == \old(a12))) || (((((a16 == 8 && a15 == 4) && 10 <= \old(a16)) && 3 == \old(a15)) && 5 == \old(a12)) && a12 == 8)) || ((((a16 == 8 && 3 == \old(a15)) && 10 <= \old(a16)) && a15 == 3) && 0 < a18 + 156)) || 4 == \old(a15)) || (((5 == \old(a12) && 10 <= \old(a16)) && (3 == \old(a15) && ((!(a12 == 6) && !(a16 == 8)) && !(12 == a16)) && !(4 == a15)) && !(7 == a12)) && 6 <= a12)) || (((((a15 == 4 && 3 == \old(a15)) && 5 == \old(a12)) && a12 == 5) && 10 <= \old(a16)) && (!(a12 == 6) && !(12 == a16)) && !(a12 == 8))) || (((((((3 == \old(a15) && 5 == \old(a12)) && !(a12 == 6)) && 10 <= \old(a16)) && !(7 == a12)) && a16 == 12) && !(4 == a15)) && 6 <= a12)) || (a16 == 9 && ((((!(a16 == 8) && ((!(a12 == 6) && !(12 == a16)) && !(a12 == 8)) && !(4 == a15)) && a12 <= 5) && a15 == \old(a15)) || (((((!(a12 == 6) && !(12 == a16)) && !(a12 == 8)) && !(4 == a15)) && a12 <= 5) && 3 == \old(a15))) && 10 <= \old(a16))) || ((5 == \old(a12) && ((((!(a16 == 8) && ((!(a12 == 6) && !(12 == a16)) && !(a12 == 8)) && !(4 == a15)) && a12 <= 5) && a15 == \old(a15)) || (((((!(a12 == 6) && !(12 == a16)) && !(a12 == 8)) && !(4 == a15)) && a12 <= 5) && 3 == \old(a15))) && 10 <= \old(a16)) && 0 < a18 + 156)) || 8 == \old(a16)) || ((a16 == 8 && 3 == \old(a15) && ((!(a12 == 6) && !(12 == a16)) && !(a12 == 8)) && !(4 == a15)) && 10 <= \old(a16))) || (((3 == \old(a15) && a12 == 7 && ((!(a12 == 6) && !(12 == a16)) && !(a12 == 8)) && !(4 == a15)) && a16 == \old(a16)) && 10 == \old(a16))) || 12 == \old(a16)) || ((5 == \old(a12) && ((3 == \old(a15) && a12 <= 5) && 10 <= \old(a16)) && !(4 == a15)) && 0 < a18 + 156)) || ((((10 <= \old(a16) && a15 == \old(a15)) && 3 == \old(a15)) && 5 == \old(a12)) && 0 < a18 + 156)) || (((((3 == \old(a15) && 5 == \old(a12)) && a12 == 7) && 10 <= \old(a16)) && 0 < a18 + 156) && !(4 == a15))) || ((a16 == 9 && 3 == \old(a15) && a12 == 7 && ((!(a12 == 6) && !(12 == a16)) && !(a12 == 8)) && !(4 == a15)) && 10 <= \old(a16))) || ((((3 == \old(a15) && 5 == \old(a12)) && !(12 == a16)) && 10 <= \old(a16)) && a12 == 6)) || ((((a16 == 8 && 10 <= \old(a16)) && 3 == \old(a15)) && 5 == \old(a12)) && a12 == 7)) || ((a16 == 9 && 10 <= \old(a16)) && (3 == \old(a15) && ((!(a12 == 6) && !(a16 == 8)) && !(12 == a16)) && !(4 == a15)) && !(7 == a12))) || ((a16 == 9 && (3 == \old(a15) && 5 == \old(a12)) && 10 <= \old(a16)) && 0 < a18 + 156) - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 409 locations, 1 error locations. SAFE Result, 119.7s OverallTime, 13 OverallIterations, 9 TraceHistogramMax, 68.4s AutomataDifference, 0.0s DeadEndRemovalTime, 21.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 705 SDtfs, 26263 SDslu, 1872 SDs, 0 SdLazy, 55862 SolverSat, 7940 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 48.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 8298 GetRequests, 8044 SyntacticMatches, 5 SemanticMatches, 249 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2091 ImplicationChecksByTransitivity, 6.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12317occurred in iteration=11, 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: 2.3s AutomataMinimizationTime, 13 MinimizatonAttempts, 5411 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 1636 PreInvPairs, 2056 NumberOfFragments, 3401 HoareAnnotationTreeSize, 1636 FomulaSimplifications, 248933 FormulaSimplificationTreeSizeReduction, 3.4s HoareSimplificationTime, 9 FomulaSimplificationsInter, 236456 FormulaSimplificationTreeSizeReductionInter, 18.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.6s SsaConstructionTime, 2.5s SatisfiabilityAnalysisTime, 11.4s InterpolantComputationTime, 16345 NumberOfCodeBlocks, 16345 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 16323 ConstructedInterpolants, 0 QuantifiedInterpolants, 54922405 SizeOfPredicates, 6 NumberOfNonLiveVariables, 10619 ConjunctsInSsa, 45 ConjunctsInUnsatCore, 22 InterpolantComputations, 8 PerfectInterpolantSequences, 29847/32118 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...