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_label53.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-07 21:19:51,571 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-07 21:19:51,574 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-07 21:19:51,589 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-07 21:19:51,590 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-07 21:19:51,591 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-07 21:19:51,592 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-07 21:19:51,602 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-07 21:19:51,604 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-07 21:19:51,605 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-07 21:19:51,608 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-07 21:19:51,609 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-07 21:19:51,609 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-07 21:19:51,613 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-07 21:19:51,614 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-07 21:19:51,615 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-07 21:19:51,616 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-07 21:19:51,618 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-07 21:19:51,622 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-07 21:19:51,625 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-07 21:19:51,628 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-07 21:19:51,630 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-07 21:19:51,632 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-07 21:19:51,632 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-07 21:19:51,634 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-07 21:19:51,635 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-07 21:19:51,635 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-07 21:19:51,636 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-07 21:19:51,636 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-07 21:19:51,637 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-07 21:19:51,637 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-07 21:19:51,638 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-07 21:19:51,639 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-07 21:19:51,639 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-07 21:19:51,640 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-07 21:19:51,640 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-07 21:19:51,641 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-07 21:19:51,641 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-07 21:19:51,641 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-07 21:19:51,642 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-07 21:19:51,643 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-07 21:19:51,644 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-09-07 21:19:51,662 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-07 21:19:51,663 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-07 21:19:51,664 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-07 21:19:51,664 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-07 21:19:51,664 INFO L138 SettingsManager]: * Use SBE=true [2019-09-07 21:19:51,665 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-07 21:19:51,665 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-07 21:19:51,665 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-07 21:19:51,665 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-07 21:19:51,665 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-07 21:19:51,666 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-07 21:19:51,666 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-07 21:19:51,666 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-07 21:19:51,666 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-07 21:19:51,666 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-07 21:19:51,667 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-07 21:19:51,667 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-07 21:19:51,667 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-07 21:19:51,667 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-07 21:19:51,667 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-07 21:19:51,668 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-07 21:19:51,668 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 21:19:51,668 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-07 21:19:51,668 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-07 21:19:51,668 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-07 21:19:51,669 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-07 21:19:51,669 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-07 21:19:51,669 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-07 21:19:51,669 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-07 21:19:51,700 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-07 21:19:51,715 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-07 21:19:51,720 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-07 21:19:51,722 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-07 21:19:51,723 INFO L275 PluginConnector]: CDTParser initialized [2019-09-07 21:19:51,723 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem16_label53.c [2019-09-07 21:19:51,797 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f7fd3fd51/08c70d0452ca460fbe54c0637d909288/FLAG7a700cc08 [2019-09-07 21:19:52,524 INFO L306 CDTParser]: Found 1 translation units. [2019-09-07 21:19:52,525 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem16_label53.c [2019-09-07 21:19:52,548 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f7fd3fd51/08c70d0452ca460fbe54c0637d909288/FLAG7a700cc08 [2019-09-07 21:19:52,660 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f7fd3fd51/08c70d0452ca460fbe54c0637d909288 [2019-09-07 21:19:52,672 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-07 21:19:52,674 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-07 21:19:52,675 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-07 21:19:52,675 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-07 21:19:52,679 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-07 21:19:52,681 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 09:19:52" (1/1) ... [2019-09-07 21:19:52,684 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@270b417c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:19:52, skipping insertion in model container [2019-09-07 21:19:52,684 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 09:19:52" (1/1) ... [2019-09-07 21:19:52,693 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-07 21:19:52,774 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-07 21:19:53,754 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 21:19:53,772 INFO L188 MainTranslator]: Completed pre-run [2019-09-07 21:19:54,060 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 21:19:54,079 INFO L192 MainTranslator]: Completed translation [2019-09-07 21:19:54,080 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:19:54 WrapperNode [2019-09-07 21:19:54,080 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-07 21:19:54,081 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-07 21:19:54,082 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-07 21:19:54,082 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-07 21:19:54,096 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:19:54" (1/1) ... [2019-09-07 21:19:54,096 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:19:54" (1/1) ... [2019-09-07 21:19:54,143 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:19:54" (1/1) ... [2019-09-07 21:19:54,148 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:19:54" (1/1) ... [2019-09-07 21:19:54,213 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:19:54" (1/1) ... [2019-09-07 21:19:54,229 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:19:54" (1/1) ... [2019-09-07 21:19:54,252 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:19:54" (1/1) ... [2019-09-07 21:19:54,271 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-07 21:19:54,271 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-07 21:19:54,272 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-07 21:19:54,272 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-07 21:19:54,273 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:19:54" (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-09-07 21:19:54,343 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-07 21:19:54,344 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-07 21:19:54,344 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-09-07 21:19:54,344 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2019-09-07 21:19:54,345 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-07 21:19:54,345 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-09-07 21:19:54,345 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2019-09-07 21:19:54,346 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-07 21:19:54,346 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-07 21:19:54,346 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-07 21:19:54,346 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-07 21:19:54,347 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-07 21:19:54,347 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-07 21:19:56,709 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-07 21:19:56,710 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-07 21:19:56,714 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 09:19:56 BoogieIcfgContainer [2019-09-07 21:19:56,714 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-07 21:19:56,716 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-07 21:19:56,716 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-07 21:19:56,719 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-07 21:19:56,719 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.09 09:19:52" (1/3) ... [2019-09-07 21:19:56,721 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32b96c90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 09:19:56, skipping insertion in model container [2019-09-07 21:19:56,721 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:19:54" (2/3) ... [2019-09-07 21:19:56,721 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32b96c90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 09:19:56, skipping insertion in model container [2019-09-07 21:19:56,722 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 09:19:56" (3/3) ... [2019-09-07 21:19:56,728 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem16_label53.c [2019-09-07 21:19:56,741 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-07 21:19:56,751 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-07 21:19:56,770 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-07 21:19:56,827 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-07 21:19:56,828 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-07 21:19:56,828 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-07 21:19:56,828 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-07 21:19:56,828 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-07 21:19:56,829 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-07 21:19:56,829 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-07 21:19:56,829 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-07 21:19:56,829 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-07 21:19:56,873 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states. [2019-09-07 21:19:56,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-09-07 21:19:56,883 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:19:56,884 INFO L399 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] [2019-09-07 21:19:56,887 INFO L418 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:19:56,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:19:56,893 INFO L82 PathProgramCache]: Analyzing trace with hash -302324190, now seen corresponding path program 1 times [2019-09-07 21:19:56,895 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:19:56,896 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:19:56,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:19:56,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:19:56,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:19:57,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:19:57,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 21:19:57,246 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 21:19:57,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 21:19:57,251 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 21:19:57,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 21:19:57,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 21:19:57,267 INFO L87 Difference]: Start difference. First operand 409 states. Second operand 3 states. [2019-09-07 21:19:59,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:19:59,638 INFO L93 Difference]: Finished difference Result 1153 states and 2141 transitions. [2019-09-07 21:19:59,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 21:19:59,639 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2019-09-07 21:19:59,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:19:59,662 INFO L225 Difference]: With dead ends: 1153 [2019-09-07 21:19:59,662 INFO L226 Difference]: Without dead ends: 682 [2019-09-07 21:19:59,672 INFO L628 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-09-07 21:19:59,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 682 states. [2019-09-07 21:19:59,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 682 to 682. [2019-09-07 21:19:59,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 682 states. [2019-09-07 21:19:59,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 682 states and 1184 transitions. [2019-09-07 21:19:59,778 INFO L78 Accepts]: Start accepts. Automaton has 682 states and 1184 transitions. Word has length 43 [2019-09-07 21:19:59,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:19:59,779 INFO L475 AbstractCegarLoop]: Abstraction has 682 states and 1184 transitions. [2019-09-07 21:19:59,779 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 21:19:59,780 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 1184 transitions. [2019-09-07 21:19:59,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-07 21:19:59,786 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:19:59,786 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-07 21:19:59,786 INFO L418 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:19:59,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:19:59,787 INFO L82 PathProgramCache]: Analyzing trace with hash 204114703, now seen corresponding path program 1 times [2019-09-07 21:19:59,787 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:19:59,787 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:19:59,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:19:59,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:19:59,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:19:59,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:20:00,030 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 21:20:00,030 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 21:20:00,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 21:20:00,033 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 21:20:00,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 21:20:00,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 21:20:00,034 INFO L87 Difference]: Start difference. First operand 682 states and 1184 transitions. Second operand 5 states. [2019-09-07 21:20:03,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:20:03,001 INFO L93 Difference]: Finished difference Result 2066 states and 3624 transitions. [2019-09-07 21:20:03,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 21:20:03,002 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 112 [2019-09-07 21:20:03,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:20:03,022 INFO L225 Difference]: With dead ends: 2066 [2019-09-07 21:20:03,022 INFO L226 Difference]: Without dead ends: 1390 [2019-09-07 21:20:03,027 INFO L628 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-09-07 21:20:03,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1390 states. [2019-09-07 21:20:03,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1390 to 1372. [2019-09-07 21:20:03,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1372 states. [2019-09-07 21:20:03,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1372 states to 1372 states and 2268 transitions. [2019-09-07 21:20:03,119 INFO L78 Accepts]: Start accepts. Automaton has 1372 states and 2268 transitions. Word has length 112 [2019-09-07 21:20:03,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:20:03,121 INFO L475 AbstractCegarLoop]: Abstraction has 1372 states and 2268 transitions. [2019-09-07 21:20:03,121 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 21:20:03,121 INFO L276 IsEmpty]: Start isEmpty. Operand 1372 states and 2268 transitions. [2019-09-07 21:20:03,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-09-07 21:20:03,135 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:20:03,135 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-07 21:20:03,136 INFO L418 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:20:03,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:20:03,136 INFO L82 PathProgramCache]: Analyzing trace with hash -1530346758, now seen corresponding path program 1 times [2019-09-07 21:20:03,138 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:20:03,139 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:20:03,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:20:03,140 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:20:03,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:20:03,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:20:03,384 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 21:20:03,387 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 21:20:03,388 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-07 21:20:03,390 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 21:20:03,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 21:20:03,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-07 21:20:03,391 INFO L87 Difference]: Start difference. First operand 1372 states and 2268 transitions. Second operand 6 states. [2019-09-07 21:20:05,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:20:06,000 INFO L93 Difference]: Finished difference Result 3472 states and 5791 transitions. [2019-09-07 21:20:06,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 21:20:06,001 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 141 [2019-09-07 21:20:06,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:20:06,021 INFO L225 Difference]: With dead ends: 3472 [2019-09-07 21:20:06,021 INFO L226 Difference]: Without dead ends: 2106 [2019-09-07 21:20:06,026 INFO L628 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-09-07 21:20:06,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2106 states. [2019-09-07 21:20:06,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2106 to 2081. [2019-09-07 21:20:06,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2081 states. [2019-09-07 21:20:06,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2081 states to 2081 states and 3263 transitions. [2019-09-07 21:20:06,153 INFO L78 Accepts]: Start accepts. Automaton has 2081 states and 3263 transitions. Word has length 141 [2019-09-07 21:20:06,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:20:06,161 INFO L475 AbstractCegarLoop]: Abstraction has 2081 states and 3263 transitions. [2019-09-07 21:20:06,162 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 21:20:06,162 INFO L276 IsEmpty]: Start isEmpty. Operand 2081 states and 3263 transitions. [2019-09-07 21:20:06,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-09-07 21:20:06,167 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:20:06,167 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-07 21:20:06,168 INFO L418 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:20:06,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:20:06,169 INFO L82 PathProgramCache]: Analyzing trace with hash 225402430, now seen corresponding path program 1 times [2019-09-07 21:20:06,169 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:20:06,170 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:20:06,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:20:06,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:20:06,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:20:06,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:20:06,364 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 21:20:06,364 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 21:20:06,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-07 21:20:06,365 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 21:20:06,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 21:20:06,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-07 21:20:06,366 INFO L87 Difference]: Start difference. First operand 2081 states and 3263 transitions. Second operand 6 states. [2019-09-07 21:20:08,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:20:08,579 INFO L93 Difference]: Finished difference Result 5241 states and 8253 transitions. [2019-09-07 21:20:08,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 21:20:08,579 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 159 [2019-09-07 21:20:08,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:20:08,601 INFO L225 Difference]: With dead ends: 5241 [2019-09-07 21:20:08,601 INFO L226 Difference]: Without dead ends: 3166 [2019-09-07 21:20:08,607 INFO L628 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-09-07 21:20:08,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3166 states. [2019-09-07 21:20:08,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3166 to 3140. [2019-09-07 21:20:08,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3140 states. [2019-09-07 21:20:08,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3140 states to 3140 states and 4128 transitions. [2019-09-07 21:20:08,696 INFO L78 Accepts]: Start accepts. Automaton has 3140 states and 4128 transitions. Word has length 159 [2019-09-07 21:20:08,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:20:08,697 INFO L475 AbstractCegarLoop]: Abstraction has 3140 states and 4128 transitions. [2019-09-07 21:20:08,698 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 21:20:08,698 INFO L276 IsEmpty]: Start isEmpty. Operand 3140 states and 4128 transitions. [2019-09-07 21:20:08,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2019-09-07 21:20:08,701 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:20:08,701 INFO L399 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 21:20:08,701 INFO L418 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:20:08,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:20:08,702 INFO L82 PathProgramCache]: Analyzing trace with hash -786182774, now seen corresponding path program 1 times [2019-09-07 21:20:08,703 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:20:08,703 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:20:08,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:20:08,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:20:08,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:20:08,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:20:08,856 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 102 proven. 35 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-07 21:20:08,856 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 21:20:08,856 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 21:20:08,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:20:08,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:20:08,958 INFO L256 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 21:20:08,982 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 21:20:09,112 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-09-07 21:20:09,126 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 21:20:09,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2019-09-07 21:20:09,128 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 21:20:09,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 21:20:09,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-07 21:20:09,129 INFO L87 Difference]: Start difference. First operand 3140 states and 4128 transitions. Second operand 6 states. [2019-09-07 21:20:12,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:20:12,282 INFO L93 Difference]: Finished difference Result 8017 states and 10600 transitions. [2019-09-07 21:20:12,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 21:20:12,291 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 241 [2019-09-07 21:20:12,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:20:12,317 INFO L225 Difference]: With dead ends: 8017 [2019-09-07 21:20:12,317 INFO L226 Difference]: Without dead ends: 4883 [2019-09-07 21:20:12,326 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 245 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-09-07 21:20:12,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4883 states. [2019-09-07 21:20:12,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4883 to 4518. [2019-09-07 21:20:12,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4518 states. [2019-09-07 21:20:12,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4518 states to 4518 states and 5824 transitions. [2019-09-07 21:20:12,475 INFO L78 Accepts]: Start accepts. Automaton has 4518 states and 5824 transitions. Word has length 241 [2019-09-07 21:20:12,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:20:12,475 INFO L475 AbstractCegarLoop]: Abstraction has 4518 states and 5824 transitions. [2019-09-07 21:20:12,476 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 21:20:12,476 INFO L276 IsEmpty]: Start isEmpty. Operand 4518 states and 5824 transitions. [2019-09-07 21:20:12,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 404 [2019-09-07 21:20:12,484 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:20:12,485 INFO L399 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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-09-07 21:20:12,485 INFO L418 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:20:12,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:20:12,486 INFO L82 PathProgramCache]: Analyzing trace with hash -555703454, now seen corresponding path program 1 times [2019-09-07 21:20:12,486 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:20:12,486 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:20:12,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:20:12,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:20:12,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:20:12,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:20:12,894 INFO L134 CoverageAnalysis]: Checked inductivity of 454 backedges. 225 proven. 115 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2019-09-07 21:20:12,894 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 21:20:12,894 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 21:20:12,904 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:20:13,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:20:13,009 INFO L256 TraceCheckSpWp]: Trace formula consists of 634 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 21:20:13,017 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 21:20:13,144 INFO L134 CoverageAnalysis]: Checked inductivity of 454 backedges. 415 proven. 2 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (3)] Exception during sending of exit command (exit): Stream closed [2019-09-07 21:20:13,152 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 21:20:13,153 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-09-07 21:20:13,154 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 21:20:13,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 21:20:13,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-07 21:20:13,154 INFO L87 Difference]: Start difference. First operand 4518 states and 5824 transitions. Second operand 9 states. [2019-09-07 21:20:18,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:20:18,837 INFO L93 Difference]: Finished difference Result 11940 states and 15954 transitions. [2019-09-07 21:20:18,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-07 21:20:18,837 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 403 [2019-09-07 21:20:18,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:20:18,884 INFO L225 Difference]: With dead ends: 11940 [2019-09-07 21:20:18,884 INFO L226 Difference]: Without dead ends: 7428 [2019-09-07 21:20:18,900 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 424 GetRequests, 409 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-09-07 21:20:18,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7428 states. [2019-09-07 21:20:19,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7428 to 7386. [2019-09-07 21:20:19,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7386 states. [2019-09-07 21:20:19,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7386 states to 7386 states and 9380 transitions. [2019-09-07 21:20:19,108 INFO L78 Accepts]: Start accepts. Automaton has 7386 states and 9380 transitions. Word has length 403 [2019-09-07 21:20:19,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:20:19,108 INFO L475 AbstractCegarLoop]: Abstraction has 7386 states and 9380 transitions. [2019-09-07 21:20:19,109 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 21:20:19,109 INFO L276 IsEmpty]: Start isEmpty. Operand 7386 states and 9380 transitions. [2019-09-07 21:20:19,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 734 [2019-09-07 21:20:19,145 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:20:19,147 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 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] [2019-09-07 21:20:19,149 INFO L418 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:20:19,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:20:19,150 INFO L82 PathProgramCache]: Analyzing trace with hash 2066888342, now seen corresponding path program 1 times [2019-09-07 21:20:19,150 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:20:19,150 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:20:19,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:20:19,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:20:19,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:20:19,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:20:20,166 INFO L134 CoverageAnalysis]: Checked inductivity of 1232 backedges. 180 proven. 455 refuted. 0 times theorem prover too weak. 597 trivial. 0 not checked. [2019-09-07 21:20:20,166 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 21:20:20,166 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 21:20:20,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:20:20,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:20:20,362 INFO L256 TraceCheckSpWp]: Trace formula consists of 1041 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-07 21:20:20,372 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 21:20:20,702 INFO L134 CoverageAnalysis]: Checked inductivity of 1232 backedges. 503 proven. 0 refuted. 0 times theorem prover too weak. 729 trivial. 0 not checked. [2019-09-07 21:20:20,707 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 21:20:20,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2019-09-07 21:20:20,708 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 21:20:20,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 21:20:20,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-07 21:20:20,709 INFO L87 Difference]: Start difference. First operand 7386 states and 9380 transitions. Second operand 9 states. [2019-09-07 21:20:25,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:20:25,059 INFO L93 Difference]: Finished difference Result 14829 states and 18979 transitions. [2019-09-07 21:20:25,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-07 21:20:25,060 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 733 [2019-09-07 21:20:25,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:20:25,112 INFO L225 Difference]: With dead ends: 14829 [2019-09-07 21:20:25,112 INFO L226 Difference]: Without dead ends: 7449 [2019-09-07 21:20:25,143 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 759 GetRequests, 741 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-09-07 21:20:25,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7449 states. [2019-09-07 21:20:25,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7449 to 7426. [2019-09-07 21:20:25,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7426 states. [2019-09-07 21:20:25,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7426 states to 7426 states and 9114 transitions. [2019-09-07 21:20:25,334 INFO L78 Accepts]: Start accepts. Automaton has 7426 states and 9114 transitions. Word has length 733 [2019-09-07 21:20:25,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:20:25,335 INFO L475 AbstractCegarLoop]: Abstraction has 7426 states and 9114 transitions. [2019-09-07 21:20:25,335 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 21:20:25,336 INFO L276 IsEmpty]: Start isEmpty. Operand 7426 states and 9114 transitions. [2019-09-07 21:20:25,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 764 [2019-09-07 21:20:25,383 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:20:25,384 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 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, 1] [2019-09-07 21:20:25,385 INFO L418 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:20:25,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:20:25,386 INFO L82 PathProgramCache]: Analyzing trace with hash 946828090, now seen corresponding path program 1 times [2019-09-07 21:20:25,386 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:20:25,386 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:20:25,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:20:25,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:20:25,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:20:25,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:20:26,129 INFO L134 CoverageAnalysis]: Checked inductivity of 1232 backedges. 604 proven. 2 refuted. 0 times theorem prover too weak. 626 trivial. 0 not checked. [2019-09-07 21:20:26,129 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 21:20:26,129 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 21:20:26,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:20:26,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:20:26,326 INFO L256 TraceCheckSpWp]: Trace formula consists of 1067 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 21:20:26,337 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 21:20:26,932 INFO L134 CoverageAnalysis]: Checked inductivity of 1232 backedges. 604 proven. 2 refuted. 0 times theorem prover too weak. 626 trivial. 0 not checked. [2019-09-07 21:20:26,946 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 21:20:26,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-09-07 21:20:26,947 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 21:20:26,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 21:20:26,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-07 21:20:26,948 INFO L87 Difference]: Start difference. First operand 7426 states and 9114 transitions. Second operand 9 states. [2019-09-07 21:20:31,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:20:31,141 INFO L93 Difference]: Finished difference Result 14095 states and 17128 transitions. [2019-09-07 21:20:31,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-07 21:20:31,141 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 763 [2019-09-07 21:20:31,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:20:31,165 INFO L225 Difference]: With dead ends: 14095 [2019-09-07 21:20:31,166 INFO L226 Difference]: Without dead ends: 6675 [2019-09-07 21:20:31,192 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 780 GetRequests, 767 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2019-09-07 21:20:31,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6675 states. [2019-09-07 21:20:31,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6675 to 6650. [2019-09-07 21:20:31,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6650 states. [2019-09-07 21:20:31,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6650 states to 6650 states and 7694 transitions. [2019-09-07 21:20:31,310 INFO L78 Accepts]: Start accepts. Automaton has 6650 states and 7694 transitions. Word has length 763 [2019-09-07 21:20:31,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:20:31,311 INFO L475 AbstractCegarLoop]: Abstraction has 6650 states and 7694 transitions. [2019-09-07 21:20:31,312 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 21:20:31,312 INFO L276 IsEmpty]: Start isEmpty. Operand 6650 states and 7694 transitions. [2019-09-07 21:20:31,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 776 [2019-09-07 21:20:31,330 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:20:31,331 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 21:20:31,331 INFO L418 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:20:31,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:20:31,332 INFO L82 PathProgramCache]: Analyzing trace with hash -804913646, now seen corresponding path program 1 times [2019-09-07 21:20:31,332 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:20:31,332 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:20:31,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:20:31,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:20:31,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:20:31,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:20:32,503 INFO L134 CoverageAnalysis]: Checked inductivity of 1268 backedges. 860 proven. 124 refuted. 0 times theorem prover too weak. 284 trivial. 0 not checked. [2019-09-07 21:20:32,504 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 21:20:32,504 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 21:20:32,530 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-09-07 21:20:32,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:20:32,710 INFO L256 TraceCheckSpWp]: Trace formula consists of 1077 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 21:20:32,719 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 21:20:33,034 INFO L134 CoverageAnalysis]: Checked inductivity of 1268 backedges. 640 proven. 2 refuted. 0 times theorem prover too weak. 626 trivial. 0 not checked. [2019-09-07 21:20:33,038 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 21:20:33,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-09-07 21:20:33,039 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 21:20:33,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 21:20:33,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-07 21:20:33,040 INFO L87 Difference]: Start difference. First operand 6650 states and 7694 transitions. Second operand 9 states. [2019-09-07 21:20:37,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:20:37,785 INFO L93 Difference]: Finished difference Result 18481 states and 21604 transitions. [2019-09-07 21:20:37,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-07 21:20:37,785 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 775 [2019-09-07 21:20:37,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:20:37,819 INFO L225 Difference]: With dead ends: 18481 [2019-09-07 21:20:37,819 INFO L226 Difference]: Without dead ends: 10037 [2019-09-07 21:20:37,840 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 798 GetRequests, 783 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2019-09-07 21:20:37,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10037 states. [2019-09-07 21:20:38,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10037 to 9630. [2019-09-07 21:20:38,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9630 states. [2019-09-07 21:20:38,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9630 states to 9630 states and 10195 transitions. [2019-09-07 21:20:38,062 INFO L78 Accepts]: Start accepts. Automaton has 9630 states and 10195 transitions. Word has length 775 [2019-09-07 21:20:38,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:20:38,064 INFO L475 AbstractCegarLoop]: Abstraction has 9630 states and 10195 transitions. [2019-09-07 21:20:38,064 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 21:20:38,064 INFO L276 IsEmpty]: Start isEmpty. Operand 9630 states and 10195 transitions. [2019-09-07 21:20:38,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1053 [2019-09-07 21:20:38,154 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:20:38,155 INFO L399 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, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 21:20:38,156 INFO L418 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:20:38,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:20:38,157 INFO L82 PathProgramCache]: Analyzing trace with hash 1985540487, now seen corresponding path program 1 times [2019-09-07 21:20:38,157 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:20:38,157 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:20:38,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:20:38,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:20:38,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:20:38,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:20:39,261 INFO L134 CoverageAnalysis]: Checked inductivity of 1964 backedges. 454 proven. 392 refuted. 0 times theorem prover too weak. 1118 trivial. 0 not checked. [2019-09-07 21:20:39,261 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 21:20:39,261 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 21:20:39,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:20:39,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:20:39,503 INFO L256 TraceCheckSpWp]: Trace formula consists of 1413 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-07 21:20:39,514 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 21:20:40,084 INFO L134 CoverageAnalysis]: Checked inductivity of 1964 backedges. 745 proven. 0 refuted. 0 times theorem prover too weak. 1219 trivial. 0 not checked. [2019-09-07 21:20:40,088 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 21:20:40,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 8 [2019-09-07 21:20:40,091 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-07 21:20:40,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-07 21:20:40,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-07 21:20:40,091 INFO L87 Difference]: Start difference. First operand 9630 states and 10195 transitions. Second operand 8 states. [2019-09-07 21:20:43,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:20:43,723 INFO L93 Difference]: Finished difference Result 26019 states and 28593 transitions. [2019-09-07 21:20:43,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-07 21:20:43,724 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 1052 [2019-09-07 21:20:43,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:20:43,802 INFO L225 Difference]: With dead ends: 26019 [2019-09-07 21:20:43,802 INFO L226 Difference]: Without dead ends: 16399 [2019-09-07 21:20:43,829 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1071 GetRequests, 1058 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2019-09-07 21:20:43,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16399 states. [2019-09-07 21:20:44,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16399 to 13427. [2019-09-07 21:20:44,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13427 states. [2019-09-07 21:20:44,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13427 states to 13427 states and 14229 transitions. [2019-09-07 21:20:44,173 INFO L78 Accepts]: Start accepts. Automaton has 13427 states and 14229 transitions. Word has length 1052 [2019-09-07 21:20:44,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:20:44,174 INFO L475 AbstractCegarLoop]: Abstraction has 13427 states and 14229 transitions. [2019-09-07 21:20:44,174 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-07 21:20:44,174 INFO L276 IsEmpty]: Start isEmpty. Operand 13427 states and 14229 transitions. [2019-09-07 21:20:44,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1303 [2019-09-07 21:20:44,216 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:20:44,218 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-07 21:20:44,219 INFO L418 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:20:44,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:20:44,219 INFO L82 PathProgramCache]: Analyzing trace with hash -1404363565, now seen corresponding path program 1 times [2019-09-07 21:20:44,220 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:20:44,220 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:20:44,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:20:44,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:20:44,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:20:44,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:20:48,811 INFO L134 CoverageAnalysis]: Checked inductivity of 2472 backedges. 887 proven. 273 refuted. 0 times theorem prover too weak. 1312 trivial. 0 not checked. [2019-09-07 21:20:48,811 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 21:20:48,811 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 21:20:48,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:20:49,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:20:49,114 INFO L256 TraceCheckSpWp]: Trace formula consists of 1625 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-07 21:20:49,128 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 21:20:49,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 21:20:50,316 INFO L134 CoverageAnalysis]: Checked inductivity of 2472 backedges. 1693 proven. 5 refuted. 0 times theorem prover too weak. 774 trivial. 0 not checked. [2019-09-07 21:20:50,321 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 21:20:50,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 17 [2019-09-07 21:20:50,323 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-07 21:20:50,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-07 21:20:50,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2019-09-07 21:20:50,324 INFO L87 Difference]: Start difference. First operand 13427 states and 14229 transitions. Second operand 17 states. [2019-09-07 21:20:53,763 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2019-09-07 21:20:54,194 WARN L188 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 45 [2019-09-07 21:20:54,772 WARN L188 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2019-09-07 21:20:57,660 WARN L188 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2019-09-07 21:20:57,829 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 50 [2019-09-07 21:20:59,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:20:59,937 INFO L93 Difference]: Finished difference Result 26885 states and 28529 transitions. [2019-09-07 21:20:59,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-09-07 21:20:59,938 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 1302 [2019-09-07 21:20:59,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:20:59,968 INFO L225 Difference]: With dead ends: 26885 [2019-09-07 21:20:59,968 INFO L226 Difference]: Without dead ends: 14140 [2019-09-07 21:20:59,987 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1374 GetRequests, 1322 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 685 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=575, Invalid=2181, Unknown=0, NotChecked=0, Total=2756 [2019-09-07 21:20:59,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14140 states. [2019-09-07 21:21:00,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14140 to 13766. [2019-09-07 21:21:00,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13766 states. [2019-09-07 21:21:00,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13766 states to 13766 states and 14562 transitions. [2019-09-07 21:21:00,179 INFO L78 Accepts]: Start accepts. Automaton has 13766 states and 14562 transitions. Word has length 1302 [2019-09-07 21:21:00,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:21:00,180 INFO L475 AbstractCegarLoop]: Abstraction has 13766 states and 14562 transitions. [2019-09-07 21:21:00,180 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-07 21:21:00,180 INFO L276 IsEmpty]: Start isEmpty. Operand 13766 states and 14562 transitions. [2019-09-07 21:21:00,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1360 [2019-09-07 21:21:00,223 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:21:00,225 INFO L399 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, 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, 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 21:21:00,226 INFO L418 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:21:00,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:21:00,227 INFO L82 PathProgramCache]: Analyzing trace with hash -64094102, now seen corresponding path program 1 times [2019-09-07 21:21:00,227 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:21:00,227 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:21:00,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:21:00,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:21:00,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:21:00,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:21:02,167 INFO L134 CoverageAnalysis]: Checked inductivity of 3821 backedges. 1292 proven. 35 refuted. 0 times theorem prover too weak. 2494 trivial. 0 not checked. [2019-09-07 21:21:02,167 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 21:21:02,168 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 21:21:02,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:21:02,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:21:02,482 INFO L256 TraceCheckSpWp]: Trace formula consists of 1797 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-07 21:21:02,496 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 21:21:02,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 21:21:03,625 INFO L134 CoverageAnalysis]: Checked inductivity of 3821 backedges. 1867 proven. 2 refuted. 0 times theorem prover too weak. 1952 trivial. 0 not checked. [2019-09-07 21:21:03,631 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 21:21:03,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 16 [2019-09-07 21:21:03,633 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-07 21:21:03,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-07 21:21:03,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2019-09-07 21:21:03,634 INFO L87 Difference]: Start difference. First operand 13766 states and 14562 transitions. Second operand 16 states. [2019-09-07 21:21:16,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:21:16,934 INFO L93 Difference]: Finished difference Result 31988 states and 33877 transitions. [2019-09-07 21:21:16,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-09-07 21:21:16,935 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 1359 [2019-09-07 21:21:16,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:21:16,982 INFO L225 Difference]: With dead ends: 31988 [2019-09-07 21:21:16,983 INFO L226 Difference]: Without dead ends: 17171 [2019-09-07 21:21:17,004 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1445 GetRequests, 1392 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 832 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=429, Invalid=2433, Unknown=0, NotChecked=0, Total=2862 [2019-09-07 21:21:17,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17171 states. [2019-09-07 21:21:17,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17171 to 16465. [2019-09-07 21:21:17,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16465 states. [2019-09-07 21:21:17,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16465 states to 16465 states and 17109 transitions. [2019-09-07 21:21:17,339 INFO L78 Accepts]: Start accepts. Automaton has 16465 states and 17109 transitions. Word has length 1359 [2019-09-07 21:21:17,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:21:17,344 INFO L475 AbstractCegarLoop]: Abstraction has 16465 states and 17109 transitions. [2019-09-07 21:21:17,344 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-07 21:21:17,344 INFO L276 IsEmpty]: Start isEmpty. Operand 16465 states and 17109 transitions. [2019-09-07 21:21:17,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1772 [2019-09-07 21:21:17,452 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:21:17,453 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-07 21:21:17,453 INFO L418 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:21:17,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:21:17,454 INFO L82 PathProgramCache]: Analyzing trace with hash 1818445458, now seen corresponding path program 1 times [2019-09-07 21:21:17,454 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:21:17,454 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:21:17,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:21:17,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:21:17,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:21:17,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:21:18,639 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2019-09-07 21:21:22,602 INFO L134 CoverageAnalysis]: Checked inductivity of 6028 backedges. 1314 proven. 531 refuted. 0 times theorem prover too weak. 4183 trivial. 0 not checked. [2019-09-07 21:21:22,603 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 21:21:22,603 INFO L223 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-09-07 21:21:22,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:21:22,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:21:22,981 INFO L256 TraceCheckSpWp]: Trace formula consists of 2234 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-07 21:21:23,000 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 21:21:23,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:21:24,630 INFO L134 CoverageAnalysis]: Checked inductivity of 6028 backedges. 3962 proven. 2 refuted. 0 times theorem prover too weak. 2064 trivial. 0 not checked. [2019-09-07 21:21:24,635 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 21:21:24,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 5] total 13 [2019-09-07 21:21:24,637 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-07 21:21:24,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-07 21:21:24,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2019-09-07 21:21:24,637 INFO L87 Difference]: Start difference. First operand 16465 states and 17109 transitions. Second operand 13 states. [2019-09-07 21:21:26,169 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 47 [2019-09-07 21:21:33,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:21:33,220 INFO L93 Difference]: Finished difference Result 32619 states and 33915 transitions. [2019-09-07 21:21:33,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-09-07 21:21:33,221 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 1771 [2019-09-07 21:21:33,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:21:33,255 INFO L225 Difference]: With dead ends: 32619 [2019-09-07 21:21:33,255 INFO L226 Difference]: Without dead ends: 17175 [2019-09-07 21:21:33,274 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1846 GetRequests, 1797 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 675 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=463, Invalid=1987, Unknown=0, NotChecked=0, Total=2450 [2019-09-07 21:21:33,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17175 states. [2019-09-07 21:21:33,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17175 to 16471. [2019-09-07 21:21:33,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16471 states. [2019-09-07 21:21:33,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16471 states to 16471 states and 17078 transitions. [2019-09-07 21:21:33,491 INFO L78 Accepts]: Start accepts. Automaton has 16471 states and 17078 transitions. Word has length 1771 [2019-09-07 21:21:33,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:21:33,493 INFO L475 AbstractCegarLoop]: Abstraction has 16471 states and 17078 transitions. [2019-09-07 21:21:33,493 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-07 21:21:33,493 INFO L276 IsEmpty]: Start isEmpty. Operand 16471 states and 17078 transitions. [2019-09-07 21:21:33,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1878 [2019-09-07 21:21:33,541 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:21:33,544 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-09-07 21:21:33,545 INFO L418 AbstractCegarLoop]: === Iteration 14 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:21:33,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:21:33,546 INFO L82 PathProgramCache]: Analyzing trace with hash -953580414, now seen corresponding path program 1 times [2019-09-07 21:21:33,546 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:21:33,546 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:21:33,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:21:33,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:21:33,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:21:33,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:21:38,680 INFO L134 CoverageAnalysis]: Checked inductivity of 6684 backedges. 2764 proven. 1321 refuted. 0 times theorem prover too weak. 2599 trivial. 0 not checked. [2019-09-07 21:21:38,680 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 21:21:38,681 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 21:21:38,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:21:39,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:21:39,110 INFO L256 TraceCheckSpWp]: Trace formula consists of 2375 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 21:21:39,123 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 21:21:39,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 21:21:40,492 INFO L134 CoverageAnalysis]: Checked inductivity of 6684 backedges. 3602 proven. 2 refuted. 0 times theorem prover too weak. 3080 trivial. 0 not checked. [2019-09-07 21:21:40,497 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 21:21:40,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 5] total 18 [2019-09-07 21:21:40,499 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-07 21:21:40,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-07 21:21:40,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2019-09-07 21:21:40,500 INFO L87 Difference]: Start difference. First operand 16471 states and 17078 transitions. Second operand 18 states. [2019-09-07 21:21:52,360 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 44 [2019-09-07 21:21:52,488 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 48 [2019-09-07 21:21:52,799 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 49 [2019-09-07 21:21:53,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:21:53,441 INFO L93 Difference]: Finished difference Result 32355 states and 33705 transitions. [2019-09-07 21:21:53,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-09-07 21:21:53,443 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 1877 [2019-09-07 21:21:53,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:21:53,478 INFO L225 Difference]: With dead ends: 32355 [2019-09-07 21:21:53,479 INFO L226 Difference]: Without dead ends: 16905 [2019-09-07 21:21:53,495 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1992 GetRequests, 1917 SyntacticMatches, 2 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1747 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=974, Invalid=4576, Unknown=0, NotChecked=0, Total=5550 [2019-09-07 21:21:53,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16905 states. [2019-09-07 21:21:53,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16905 to 16462. [2019-09-07 21:21:53,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16462 states. [2019-09-07 21:21:53,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16462 states to 16462 states and 16987 transitions. [2019-09-07 21:21:53,696 INFO L78 Accepts]: Start accepts. Automaton has 16462 states and 16987 transitions. Word has length 1877 [2019-09-07 21:21:53,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:21:53,697 INFO L475 AbstractCegarLoop]: Abstraction has 16462 states and 16987 transitions. [2019-09-07 21:21:53,697 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-07 21:21:53,698 INFO L276 IsEmpty]: Start isEmpty. Operand 16462 states and 16987 transitions. [2019-09-07 21:21:53,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1949 [2019-09-07 21:21:53,739 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:21:53,740 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-09-07 21:21:53,740 INFO L418 AbstractCegarLoop]: === Iteration 15 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:21:53,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:21:53,741 INFO L82 PathProgramCache]: Analyzing trace with hash 716142179, now seen corresponding path program 1 times [2019-09-07 21:21:53,741 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:21:53,741 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:21:53,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:21:53,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:21:53,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:21:53,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:22:00,800 INFO L134 CoverageAnalysis]: Checked inductivity of 7429 backedges. 2058 proven. 1432 refuted. 0 times theorem prover too weak. 3939 trivial. 0 not checked. [2019-09-07 21:22:00,801 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 21:22:00,801 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 21:22:00,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:22:01,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:22:01,246 INFO L256 TraceCheckSpWp]: Trace formula consists of 2483 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-07 21:22:01,257 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 21:22:01,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:22:01,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:22:01,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:22:01,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:22:01,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:22:01,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:22:01,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:22:01,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:22:01,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:22:01,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:22:01,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:22:01,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:22:01,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:22:01,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:22:01,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:22:01,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:22:01,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:22:01,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:22:01,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:22:01,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:22:01,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:22:01,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:22:01,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:22:01,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:22:01,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:22:01,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:22:01,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:22:02,901 INFO L134 CoverageAnalysis]: Checked inductivity of 7429 backedges. 4455 proven. 2 refuted. 0 times theorem prover too weak. 2972 trivial. 0 not checked. [2019-09-07 21:22:02,906 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 21:22:02,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 5] total 17 [2019-09-07 21:22:02,909 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-07 21:22:02,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-07 21:22:02,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2019-09-07 21:22:02,910 INFO L87 Difference]: Start difference. First operand 16462 states and 16987 transitions. Second operand 17 states. [2019-09-07 21:22:10,865 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 33 [2019-09-07 21:22:17,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:22:17,934 INFO L93 Difference]: Finished difference Result 37324 states and 38616 transitions. [2019-09-07 21:22:17,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-09-07 21:22:17,934 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 1948 [2019-09-07 21:22:17,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:22:17,973 INFO L225 Difference]: With dead ends: 37324 [2019-09-07 21:22:17,973 INFO L226 Difference]: Without dead ends: 21883 [2019-09-07 21:22:17,989 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2031 GetRequests, 1978 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 757 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=586, Invalid=2384, Unknown=0, NotChecked=0, Total=2970 [2019-09-07 21:22:18,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21883 states. [2019-09-07 21:22:18,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21883 to 20184. [2019-09-07 21:22:18,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20184 states. [2019-09-07 21:22:18,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20184 states to 20184 states and 20777 transitions. [2019-09-07 21:22:18,201 INFO L78 Accepts]: Start accepts. Automaton has 20184 states and 20777 transitions. Word has length 1948 [2019-09-07 21:22:18,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:22:18,202 INFO L475 AbstractCegarLoop]: Abstraction has 20184 states and 20777 transitions. [2019-09-07 21:22:18,202 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-07 21:22:18,202 INFO L276 IsEmpty]: Start isEmpty. Operand 20184 states and 20777 transitions. [2019-09-07 21:22:18,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2095 [2019-09-07 21:22:18,241 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:22:18,242 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-07 21:22:18,242 INFO L418 AbstractCegarLoop]: === Iteration 16 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:22:18,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:22:18,243 INFO L82 PathProgramCache]: Analyzing trace with hash 1001152179, now seen corresponding path program 1 times [2019-09-07 21:22:18,243 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:22:18,243 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:22:18,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:22:18,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:22:18,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:22:18,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:22:25,664 INFO L134 CoverageAnalysis]: Checked inductivity of 9269 backedges. 2748 proven. 1680 refuted. 0 times theorem prover too weak. 4841 trivial. 0 not checked. [2019-09-07 21:22:25,665 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 21:22:25,665 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 21:22:25,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:22:26,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:22:26,158 INFO L256 TraceCheckSpWp]: Trace formula consists of 2670 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-07 21:22:26,168 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 21:22:26,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 21:22:28,061 INFO L134 CoverageAnalysis]: Checked inductivity of 9269 backedges. 6306 proven. 6 refuted. 0 times theorem prover too weak. 2957 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (13)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 21:22:28,071 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 21:22:28,072 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 8] total 21 [2019-09-07 21:22:28,074 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-07 21:22:28,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-07 21:22:28,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=353, Unknown=0, NotChecked=0, Total=420 [2019-09-07 21:22:28,075 INFO L87 Difference]: Start difference. First operand 20184 states and 20777 transitions. Second operand 21 states. [2019-09-07 21:22:33,519 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 47 [2019-09-07 21:22:38,072 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 33 [2019-09-07 21:22:40,785 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 46 [2019-09-07 21:22:42,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:22:42,201 INFO L93 Difference]: Finished difference Result 39092 states and 40358 transitions. [2019-09-07 21:22:42,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-09-07 21:22:42,202 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 2094 [2019-09-07 21:22:42,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:22:42,245 INFO L225 Difference]: With dead ends: 39092 [2019-09-07 21:22:42,246 INFO L226 Difference]: Without dead ends: 20944 [2019-09-07 21:22:42,265 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2201 GetRequests, 2133 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1388 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=857, Invalid=3973, Unknown=0, NotChecked=0, Total=4830 [2019-09-07 21:22:42,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20944 states. [2019-09-07 21:22:42,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20944 to 20860. [2019-09-07 21:22:42,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20860 states. [2019-09-07 21:22:42,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20860 states to 20860 states and 21458 transitions. [2019-09-07 21:22:42,564 INFO L78 Accepts]: Start accepts. Automaton has 20860 states and 21458 transitions. Word has length 2094 [2019-09-07 21:22:42,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:22:42,566 INFO L475 AbstractCegarLoop]: Abstraction has 20860 states and 21458 transitions. [2019-09-07 21:22:42,566 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-07 21:22:42,566 INFO L276 IsEmpty]: Start isEmpty. Operand 20860 states and 21458 transitions. [2019-09-07 21:22:42,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2108 [2019-09-07 21:22:42,623 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:22:42,624 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 8, 8, 8, 8, 8, 8, 8, 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, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 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, 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] [2019-09-07 21:22:42,624 INFO L418 AbstractCegarLoop]: === Iteration 17 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:22:42,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:22:42,625 INFO L82 PathProgramCache]: Analyzing trace with hash -1685150130, now seen corresponding path program 1 times [2019-09-07 21:22:42,625 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:22:42,625 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:22:42,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:22:42,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:22:42,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:22:42,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:22:45,989 INFO L134 CoverageAnalysis]: Checked inductivity of 8330 backedges. 1535 proven. 2 refuted. 0 times theorem prover too weak. 6793 trivial. 0 not checked. [2019-09-07 21:22:45,989 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 21:22:45,989 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 21:22:46,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:22:46,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:22:46,500 INFO L256 TraceCheckSpWp]: Trace formula consists of 2666 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-07 21:22:46,512 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 21:22:46,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 21:22:48,912 INFO L134 CoverageAnalysis]: Checked inductivity of 8330 backedges. 4302 proven. 2 refuted. 0 times theorem prover too weak. 4026 trivial. 0 not checked. [2019-09-07 21:22:48,917 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 21:22:48,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-09-07 21:22:48,919 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 21:22:48,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 21:22:48,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-07 21:22:48,920 INFO L87 Difference]: Start difference. First operand 20860 states and 21458 transitions. Second operand 9 states. [2019-09-07 21:22:53,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:22:53,392 INFO L93 Difference]: Finished difference Result 41412 states and 42674 transitions. [2019-09-07 21:22:53,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-07 21:22:53,393 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 2107 [2019-09-07 21:22:53,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:22:53,424 INFO L225 Difference]: With dead ends: 41412 [2019-09-07 21:22:53,425 INFO L226 Difference]: Without dead ends: 22588 [2019-09-07 21:22:53,437 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2144 GetRequests, 2120 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=138, Invalid=512, Unknown=0, NotChecked=0, Total=650 [2019-09-07 21:22:53,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22588 states. [2019-09-07 21:22:53,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22588 to 21559. [2019-09-07 21:22:53,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21559 states. [2019-09-07 21:22:53,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21559 states to 21559 states and 22212 transitions. [2019-09-07 21:22:53,664 INFO L78 Accepts]: Start accepts. Automaton has 21559 states and 22212 transitions. Word has length 2107 [2019-09-07 21:22:53,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:22:53,665 INFO L475 AbstractCegarLoop]: Abstraction has 21559 states and 22212 transitions. [2019-09-07 21:22:53,665 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 21:22:53,665 INFO L276 IsEmpty]: Start isEmpty. Operand 21559 states and 22212 transitions. [2019-09-07 21:22:53,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2297 [2019-09-07 21:22:53,716 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:22:53,717 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 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, 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, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-09-07 21:22:53,718 INFO L418 AbstractCegarLoop]: === Iteration 18 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:22:53,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:22:53,719 INFO L82 PathProgramCache]: Analyzing trace with hash 1393354035, now seen corresponding path program 1 times [2019-09-07 21:22:53,719 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:22:53,719 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:22:53,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:22:53,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:22:53,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:22:53,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:22:56,695 INFO L134 CoverageAnalysis]: Checked inductivity of 9562 backedges. 1615 proven. 35 refuted. 0 times theorem prover too weak. 7912 trivial. 0 not checked. [2019-09-07 21:22:56,696 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 21:22:56,696 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 21:22:56,707 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:22:57,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:22:57,194 INFO L256 TraceCheckSpWp]: Trace formula consists of 2892 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-07 21:22:57,205 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 21:22:57,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:22:58,025 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((v_prenex_1 Int)) (let ((.cse0 (mod v_prenex_1 299922))) (and (<= .cse0 (+ c_~a18~0 300079)) (= 0 .cse0)))) (exists ((v_prenex_1 Int)) (and (<= (mod v_prenex_1 299922) (+ c_~a18~0 300079)) (<= 0 v_prenex_1))) (exists ((v_~a18~0_917 Int)) (let ((.cse1 (mod v_~a18~0_917 299922))) (and (<= .cse1 (+ c_~a18~0 600001)) (< v_~a18~0_917 0) (not (= 0 .cse1)))))) is different from true [2019-09-07 21:22:58,843 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((v_prenex_1 Int)) (let ((.cse0 (mod v_prenex_1 299922))) (and (<= .cse0 (+ c_~a18~0 300079)) (= 0 .cse0)))) (exists ((v_~a18~0_917 Int)) (let ((.cse1 (mod v_~a18~0_917 299922))) (and (<= .cse1 (+ c_~a18~0 600001)) (< v_~a18~0_917 0) (not (= 0 .cse1))))) (exists ((v_prenex_2 Int)) (and (<= (mod v_prenex_2 299922) (+ c_~a18~0 300079)) (<= 0 v_prenex_2)))) is different from true [2019-09-07 21:22:58,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 21:23:00,897 INFO L134 CoverageAnalysis]: Checked inductivity of 9562 backedges. 1611 proven. 33 refuted. 0 times theorem prover too weak. 7912 trivial. 6 not checked. [2019-09-07 21:23:00,902 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 21:23:00,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2019-09-07 21:23:00,904 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-07 21:23:00,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-07 21:23:00,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=51, Unknown=2, NotChecked=30, Total=110 [2019-09-07 21:23:00,905 INFO L87 Difference]: Start difference. First operand 21559 states and 22212 transitions. Second operand 11 states. [2019-09-07 21:23:10,874 WARN L188 SmtUtils]: Spent 4.20 s on a formula simplification. DAG size of input: 27 DAG size of output: 13 [2019-09-07 21:23:16,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:23:16,193 INFO L93 Difference]: Finished difference Result 44135 states and 45584 transitions. [2019-09-07 21:23:16,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-07 21:23:16,194 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 2296 [2019-09-07 21:23:16,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:23:16,234 INFO L225 Difference]: With dead ends: 44135 [2019-09-07 21:23:16,234 INFO L226 Difference]: Without dead ends: 24612 [2019-09-07 21:23:16,254 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2321 GetRequests, 2302 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 11.2s TimeCoverageRelationStatistics Valid=106, Invalid=203, Unknown=5, NotChecked=66, Total=380 [2019-09-07 21:23:16,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24612 states. [2019-09-07 21:23:16,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24612 to 22237. [2019-09-07 21:23:16,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22237 states. [2019-09-07 21:23:16,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22237 states to 22237 states and 22873 transitions. [2019-09-07 21:23:16,545 INFO L78 Accepts]: Start accepts. Automaton has 22237 states and 22873 transitions. Word has length 2296 [2019-09-07 21:23:16,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:23:16,547 INFO L475 AbstractCegarLoop]: Abstraction has 22237 states and 22873 transitions. [2019-09-07 21:23:16,547 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-07 21:23:16,547 INFO L276 IsEmpty]: Start isEmpty. Operand 22237 states and 22873 transitions. [2019-09-07 21:23:16,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2732 [2019-09-07 21:23:16,628 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:23:16,630 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 21:23:16,630 INFO L418 AbstractCegarLoop]: === Iteration 19 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:23:16,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:23:16,632 INFO L82 PathProgramCache]: Analyzing trace with hash 129748663, now seen corresponding path program 1 times [2019-09-07 21:23:16,632 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:23:16,632 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:23:16,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:23:16,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:23:16,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:23:17,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:23:21,707 INFO L134 CoverageAnalysis]: Checked inductivity of 12452 backedges. 4889 proven. 9 refuted. 0 times theorem prover too weak. 7554 trivial. 0 not checked. [2019-09-07 21:23:21,708 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 21:23:21,708 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 21:23:21,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:23:22,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:23:22,314 INFO L256 TraceCheckSpWp]: Trace formula consists of 3409 conjuncts, 29 conjunts are in the unsatisfiable core [2019-09-07 21:23:22,328 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 21:23:22,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-07 21:23:22,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:23:27,111 INFO L134 CoverageAnalysis]: Checked inductivity of 12452 backedges. 2831 proven. 5 refuted. 0 times theorem prover too weak. 9616 trivial. 0 not checked. [2019-09-07 21:23:27,118 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 21:23:27,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2019-09-07 21:23:27,121 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-07 21:23:27,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-07 21:23:27,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2019-09-07 21:23:27,122 INFO L87 Difference]: Start difference. First operand 22237 states and 22873 transitions. Second operand 14 states. [2019-09-07 21:23:33,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:23:33,022 INFO L93 Difference]: Finished difference Result 42795 states and 44011 transitions. [2019-09-07 21:23:33,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-07 21:23:33,022 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 2731 [2019-09-07 21:23:33,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:23:33,052 INFO L225 Difference]: With dead ends: 42795 [2019-09-07 21:23:33,053 INFO L226 Difference]: Without dead ends: 22594 [2019-09-07 21:23:33,071 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2787 GetRequests, 2748 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 357 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=290, Invalid=1270, Unknown=0, NotChecked=0, Total=1560 [2019-09-07 21:23:33,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22594 states. [2019-09-07 21:23:33,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22594 to 21896. [2019-09-07 21:23:33,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21896 states. [2019-09-07 21:23:33,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21896 states to 21896 states and 22481 transitions. [2019-09-07 21:23:33,303 INFO L78 Accepts]: Start accepts. Automaton has 21896 states and 22481 transitions. Word has length 2731 [2019-09-07 21:23:33,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:23:33,305 INFO L475 AbstractCegarLoop]: Abstraction has 21896 states and 22481 transitions. [2019-09-07 21:23:33,305 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-07 21:23:33,306 INFO L276 IsEmpty]: Start isEmpty. Operand 21896 states and 22481 transitions. [2019-09-07 21:23:33,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2849 [2019-09-07 21:23:33,361 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:23:33,362 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 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, 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] [2019-09-07 21:23:33,363 INFO L418 AbstractCegarLoop]: === Iteration 20 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:23:33,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:23:33,364 INFO L82 PathProgramCache]: Analyzing trace with hash -1469620953, now seen corresponding path program 1 times [2019-09-07 21:23:33,364 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:23:33,364 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:23:33,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:23:33,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:23:33,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:23:33,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:23:42,111 INFO L134 CoverageAnalysis]: Checked inductivity of 14457 backedges. 4557 proven. 3210 refuted. 0 times theorem prover too weak. 6690 trivial. 0 not checked. [2019-09-07 21:23:42,111 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 21:23:42,111 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 21:23:42,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:23:42,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:23:42,731 INFO L256 TraceCheckSpWp]: Trace formula consists of 3538 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-07 21:23:42,750 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 21:23:45,334 INFO L134 CoverageAnalysis]: Checked inductivity of 14457 backedges. 3016 proven. 2 refuted. 0 times theorem prover too weak. 11439 trivial. 0 not checked. [2019-09-07 21:23:45,340 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 21:23:45,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 5] total 15 [2019-09-07 21:23:45,343 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-07 21:23:45,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-07 21:23:45,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2019-09-07 21:23:45,343 INFO L87 Difference]: Start difference. First operand 21896 states and 22481 transitions. Second operand 15 states. [2019-09-07 21:23:57,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:23:57,401 INFO L93 Difference]: Finished difference Result 43122 states and 44296 transitions. [2019-09-07 21:23:57,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-09-07 21:23:57,401 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 2848 [2019-09-07 21:23:57,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:23:57,408 INFO L225 Difference]: With dead ends: 43122 [2019-09-07 21:23:57,408 INFO L226 Difference]: Without dead ends: 0 [2019-09-07 21:23:57,443 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2946 GetRequests, 2887 SyntacticMatches, 8 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 743 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=490, Invalid=2266, Unknown=0, NotChecked=0, Total=2756 [2019-09-07 21:23:57,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-07 21:23:57,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-07 21:23:57,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-07 21:23:57,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-07 21:23:57,444 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 2848 [2019-09-07 21:23:57,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:23:57,445 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-07 21:23:57,445 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-07 21:23:57,445 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-07 21:23:57,445 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-07 21:23:57,450 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-09-07 21:23:59,328 WARN L188 SmtUtils]: Spent 1.85 s on a formula simplification. DAG size of input: 719 DAG size of output: 658 [2019-09-07 21:24:02,425 WARN L188 SmtUtils]: Spent 1.63 s on a formula simplification. DAG size of input: 719 DAG size of output: 658 [2019-09-07 21:24:11,614 WARN L188 SmtUtils]: Spent 9.16 s on a formula simplification. DAG size of input: 658 DAG size of output: 145 [2019-09-07 21:24:16,327 WARN L188 SmtUtils]: Spent 4.62 s on a formula simplification. DAG size of input: 483 DAG size of output: 148 [2019-09-07 21:24:21,100 WARN L188 SmtUtils]: Spent 4.75 s on a formula simplification. DAG size of input: 490 DAG size of output: 148 [2019-09-07 21:24:26,919 WARN L188 SmtUtils]: Spent 5.80 s on a formula simplification. DAG size of input: 525 DAG size of output: 180 [2019-09-07 21:24:35,813 WARN L188 SmtUtils]: Spent 8.87 s on a formula simplification. DAG size of input: 658 DAG size of output: 145 [2019-09-07 21:24:35,815 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2019-09-07 21:24:35,815 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-09-07 21:24:35,815 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-09-07 21:24:35,816 INFO L443 ceAbstractionStarter]: For program point L1497(lines 1497 1763) no Hoare annotation was computed. [2019-09-07 21:24:35,816 INFO L443 ceAbstractionStarter]: For program point calculate_output2EXIT(lines 1494 1765) no Hoare annotation was computed. [2019-09-07 21:24:35,816 INFO L443 ceAbstractionStarter]: For program point L1687(lines 1687 1763) no Hoare annotation was computed. [2019-09-07 21:24:35,816 INFO L443 ceAbstractionStarter]: For program point L1704(lines 1704 1763) no Hoare annotation was computed. [2019-09-07 21:24:35,816 INFO L443 ceAbstractionStarter]: For program point L1638(lines 1638 1763) no Hoare annotation was computed. [2019-09-07 21:24:35,816 INFO L443 ceAbstractionStarter]: For program point L1663(lines 1663 1763) no Hoare annotation was computed. [2019-09-07 21:24:35,816 INFO L443 ceAbstractionStarter]: For program point L1597(lines 1597 1763) no Hoare annotation was computed. [2019-09-07 21:24:35,816 INFO L443 ceAbstractionStarter]: For program point L1721(lines 1721 1763) no Hoare annotation was computed. [2019-09-07 21:24:35,816 INFO L443 ceAbstractionStarter]: For program point L1622(lines 1622 1763) no Hoare annotation was computed. [2019-09-07 21:24:35,817 INFO L443 ceAbstractionStarter]: For program point L1746(lines 1746 1763) no Hoare annotation was computed. [2019-09-07 21:24:35,817 INFO L443 ceAbstractionStarter]: For program point L1515(lines 1515 1763) no Hoare annotation was computed. [2019-09-07 21:24:35,817 INFO L443 ceAbstractionStarter]: For program point L1573(lines 1573 1763) no Hoare annotation was computed. [2019-09-07 21:24:35,817 INFO L443 ceAbstractionStarter]: For program point L1540(lines 1540 1763) no Hoare annotation was computed. [2019-09-07 21:24:35,817 INFO L443 ceAbstractionStarter]: For program point L1656(lines 1656 1763) no Hoare annotation was computed. [2019-09-07 21:24:35,817 INFO L443 ceAbstractionStarter]: For program point L1739(lines 1739 1763) no Hoare annotation was computed. [2019-09-07 21:24:35,817 INFO L443 ceAbstractionStarter]: For program point L1566(lines 1566 1763) no Hoare annotation was computed. [2019-09-07 21:24:35,817 INFO L443 ceAbstractionStarter]: For program point L1591(lines 1591 1763) no Hoare annotation was computed. [2019-09-07 21:24:35,817 INFO L443 ceAbstractionStarter]: For program point L1715(lines 1715 1763) no Hoare annotation was computed. [2019-09-07 21:24:35,818 INFO L443 ceAbstractionStarter]: For program point L1682(lines 1682 1763) no Hoare annotation was computed. [2019-09-07 21:24:35,818 INFO L443 ceAbstractionStarter]: For program point L1616(lines 1616 1763) no Hoare annotation was computed. [2019-09-07 21:24:35,818 INFO L443 ceAbstractionStarter]: For program point L1699(lines 1699 1763) no Hoare annotation was computed. [2019-09-07 21:24:35,818 INFO L443 ceAbstractionStarter]: For program point L1633(lines 1633 1763) no Hoare annotation was computed. [2019-09-07 21:24:35,818 INFO L443 ceAbstractionStarter]: For program point L1534(lines 1534 1763) no Hoare annotation was computed. [2019-09-07 21:24:35,818 INFO L443 ceAbstractionStarter]: For program point L1757(lines 1757 1763) no Hoare annotation was computed. [2019-09-07 21:24:35,818 INFO L443 ceAbstractionStarter]: For program point L1559(lines 1559 1763) no Hoare annotation was computed. [2019-09-07 21:24:35,818 INFO L443 ceAbstractionStarter]: For program point L1675(lines 1675 1763) no Hoare annotation was computed. [2019-09-07 21:24:35,818 INFO L443 ceAbstractionStarter]: For program point L1609(lines 1609 1763) no Hoare annotation was computed. [2019-09-07 21:24:35,819 INFO L443 ceAbstractionStarter]: For program point L1510(lines 1510 1763) no Hoare annotation was computed. [2019-09-07 21:24:35,819 INFO L443 ceAbstractionStarter]: For program point L1733(lines 1733 1763) no Hoare annotation was computed. [2019-09-07 21:24:35,819 INFO L439 ceAbstractionStarter]: At program point calculate_output2ENTRY(lines 1494 1765) the Hoare annotation is: (let ((.cse30 (= 8 |old(~a12~0)|))) (let ((.cse32 (= ~a12~0 5)) (.cse12 (= 12 |old(~a16~0)|)) (.cse13 (not (<= |old(~a12~0)| 5))) (.cse31 (= ~a12~0 7)) (.cse19 (= 7 |old(~a12~0)|)) (.cse4 (= 4 |old(~a15~0)|)) (.cse23 (= ~a12~0 8)) (.cse0 (= ~a12~0 |old(~a12~0)|)) (.cse16 (not (= 3 |old(~a15~0)|))) (.cse17 (not .cse30)) (.cse2 (= ~a15~0 |old(~a15~0)|)) (.cse1 (= ~a16~0 |old(~a16~0)|)) (.cse22 (= ~a18~0 |old(~a18~0)|))) (let ((.cse26 (and .cse2 .cse1 .cse22 (= ~a12~0 9))) (.cse27 (not (= 9 |old(~a12~0)|))) (.cse14 (not (<= (+ |old(~a18~0)| 156) 0))) (.cse20 (and (or .cse16 (not (< 134 |old(~a18~0)|)) .cse17) (not (<= (+ |old(~a18~0)| 79) 0)))) (.cse8 (and .cse0 .cse2 .cse1 .cse22)) (.cse18 (and .cse2 .cse1 .cse23 .cse22)) (.cse10 (not (<= 0 (+ |old(~a18~0)| 155)))) (.cse21 (= 6 |old(~a12~0)|)) (.cse11 (not .cse4)) (.cse3 (not (= 8 |old(~a16~0)|))) (.cse6 (not .cse19)) (.cse5 (and .cse2 .cse31 .cse1 .cse22)) (.cse15 (not (<= 0 (+ |old(~a18~0)| 600001)))) (.cse9 (= 10 |old(~a16~0)|)) (.cse28 (not (= 5 |old(~a12~0)|))) (.cse24 (or .cse12 .cse4 .cse13)) (.cse29 (and .cse32 .cse2 .cse1 .cse22)) (.cse7 (not (= 9 |old(~a16~0)|)))) (and (or (and .cse0 .cse1 .cse2) .cse3 .cse4) (or .cse5 (or .cse4 .cse6) .cse7) (or .cse8 (or .cse4 .cse9) .cse10) (or .cse11 (or .cse12 .cse13 .cse14) .cse8 .cse15) (or .cse16 .cse17 .cse18 .cse7) (or (or .cse12 .cse19 .cse4 .cse9) .cse8 .cse15) (or .cse18 .cse4 .cse20 .cse17 .cse15) (or .cse21 .cse19 .cse4 (not .cse12) .cse15 (and .cse0 .cse2 .cse22 (= ~a16~0 12))) (or (or .cse4 (not (<= 150 |old(~a18~0)|)) .cse17) (and .cse1 .cse23 .cse22 .cse2)) (or .cse8 .cse24 .cse10) (or .cse3 (forall ((v_~a18~0_911 Int)) (let ((.cse25 (* 5 (div (* 10 v_~a18~0_911) (- 5))))) (or (not (<= (+ v_~a18~0_911 79) 0)) (not (<= 0 .cse25)) (not (<= (div .cse25 5) |old(~a18~0)|)) (not (<= 5 .cse25))))) .cse26 .cse27) (or .cse8 .cse20 .cse10 .cse7) (or .cse3 .cse26 .cse10 (not (<= |old(~a18~0)| 134)) .cse27) (or .cse17 .cse3 .cse18 .cse15) (or .cse3 .cse28 .cse29 .cse15) (or .cse30 .cse8 .cse15 .cse7 .cse14) (or (or (or .cse11 (or .cse6 .cse7)) .cse15) (and (= ~a15~0 4) .cse31 .cse1 .cse22)) (or .cse12 .cse20 .cse13 .cse10 .cse8) (or (or .cse17 .cse7) .cse18 .cse10) (or .cse12 (and .cse2 .cse1 .cse22 (= ~a12~0 6)) .cse15 (not .cse21)) (or .cse11 .cse3 .cse6 .cse5 .cse15) (or .cse28 (and .cse32 .cse2 .cse22 (= ~a16~0 10)) (not (<= 0 (+ (div (+ |old(~a18~0)| (- 599175)) 3) 155))) (not .cse9)) (or .cse28 .cse24 .cse29 .cse7))))) [2019-09-07 21:24:35,819 INFO L443 ceAbstractionStarter]: For program point L1527(lines 1527 1763) no Hoare annotation was computed. [2019-09-07 21:24:35,820 INFO L443 ceAbstractionStarter]: For program point L1651(lines 1651 1763) no Hoare annotation was computed. [2019-09-07 21:24:35,820 INFO L443 ceAbstractionStarter]: For program point L1585(lines 1585 1763) no Hoare annotation was computed. [2019-09-07 21:24:35,820 INFO L443 ceAbstractionStarter]: For program point L1709(lines 1709 1763) no Hoare annotation was computed. [2019-09-07 21:24:35,820 INFO L443 ceAbstractionStarter]: For program point L1503(lines 1503 1763) no Hoare annotation was computed. [2019-09-07 21:24:35,820 INFO L443 ceAbstractionStarter]: For program point L1693(lines 1693 1763) no Hoare annotation was computed. [2019-09-07 21:24:35,820 INFO L443 ceAbstractionStarter]: For program point L1553(lines 1553 1763) no Hoare annotation was computed. [2019-09-07 21:24:35,820 INFO L443 ceAbstractionStarter]: For program point calculate_output2FINAL(lines 1494 1765) no Hoare annotation was computed. [2019-09-07 21:24:35,820 INFO L443 ceAbstractionStarter]: For program point L1669(lines 1669 1763) no Hoare annotation was computed. [2019-09-07 21:24:35,820 INFO L443 ceAbstractionStarter]: For program point L1603(lines 1603 1763) no Hoare annotation was computed. [2019-09-07 21:24:35,821 INFO L443 ceAbstractionStarter]: For program point L1727(lines 1727 1763) no Hoare annotation was computed. [2019-09-07 21:24:35,821 INFO L443 ceAbstractionStarter]: For program point L1628(lines 1628 1763) no Hoare annotation was computed. [2019-09-07 21:24:35,821 INFO L443 ceAbstractionStarter]: For program point L1752(lines 1752 1763) no Hoare annotation was computed. [2019-09-07 21:24:35,821 INFO L443 ceAbstractionStarter]: For program point L1521(lines 1521 1763) no Hoare annotation was computed. [2019-09-07 21:24:35,821 INFO L443 ceAbstractionStarter]: For program point L1645(lines 1645 1763) no Hoare annotation was computed. [2019-09-07 21:24:35,821 INFO L443 ceAbstractionStarter]: For program point L1579(lines 1579 1763) no Hoare annotation was computed. [2019-09-07 21:24:35,821 INFO L443 ceAbstractionStarter]: For program point L1546(lines 1546 1763) no Hoare annotation was computed. [2019-09-07 21:24:35,821 INFO L443 ceAbstractionStarter]: For program point L894(lines 894 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,821 INFO L443 ceAbstractionStarter]: For program point L828(lines 828 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,822 INFO L443 ceAbstractionStarter]: For program point L696(lines 696 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,822 INFO L443 ceAbstractionStarter]: For program point L1291(lines 1291 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,822 INFO L443 ceAbstractionStarter]: For program point L168-1(lines 23 1492) no Hoare annotation was computed. [2019-09-07 21:24:35,822 INFO L443 ceAbstractionStarter]: For program point L102-1(lines 23 1492) no Hoare annotation was computed. [2019-09-07 21:24:35,822 INFO L443 ceAbstractionStarter]: For program point L36-1(lines 23 1492) no Hoare annotation was computed. [2019-09-07 21:24:35,822 INFO L443 ceAbstractionStarter]: For program point L961(lines 961 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,822 INFO L443 ceAbstractionStarter]: For program point L763(lines 763 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,822 INFO L443 ceAbstractionStarter]: For program point L631(lines 631 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,822 INFO L443 ceAbstractionStarter]: For program point L367(lines 367 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,823 INFO L443 ceAbstractionStarter]: For program point L1358(lines 1358 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,823 INFO L443 ceAbstractionStarter]: For program point L235(lines 235 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,823 INFO L443 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2019-09-07 21:24:35,823 INFO L443 ceAbstractionStarter]: For program point L1160(lines 1160 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,823 INFO L443 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2019-09-07 21:24:35,823 INFO L443 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2019-09-07 21:24:35,824 INFO L439 ceAbstractionStarter]: At program point L1491(line 1491) the Hoare annotation is: (let ((.cse38 (= 8 |old(~a12~0)|))) (let ((.cse17 (not (<= |old(~a12~0)| 5))) (.cse20 (= 7 |old(~a12~0)|)) (.cse12 (= ~a12~0 |old(~a12~0)|)) (.cse36 (= 6 |old(~a12~0)|)) (.cse16 (= 12 |old(~a16~0)|)) (.cse0 (= 4 |old(~a15~0)|)) (.cse39 (not (<= (+ |old(~a18~0)| 156) 0))) (.cse8 (= ~a12~0 8)) (.cse10 (= ~a15~0 |old(~a15~0)|)) (.cse40 (= ~a12~0 7)) (.cse7 (= ~a16~0 |old(~a16~0)|)) (.cse9 (= ~a18~0 |old(~a18~0)|)) (.cse33 (not (= 3 |old(~a15~0)|))) (.cse35 (< 134 |old(~a18~0)|)) (.cse2 (not .cse38)) (.cse34 (<= (+ |old(~a18~0)| 79) 0))) (let ((.cse14 (not (= ~a16~0 9))) (.cse19 (= 10 |old(~a16~0)|)) (.cse1 (and (or .cse33 (not .cse35) .cse2) (not .cse34))) (.cse28 (and .cse10 .cse40 .cse7 .cse9)) (.cse29 (= ~a12~0 9)) (.cse30 (not (= 9 |old(~a12~0)|))) (.cse24 (and .cse7 .cse8 .cse9)) (.cse5 (or .cse16 .cse0 .cse2 .cse39)) (.cse3 (not (<= 0 (+ |old(~a18~0)| 155)))) (.cse4 (and .cse10 .cse7 .cse8 .cse9)) (.cse32 (or .cse16 .cse0)) (.cse22 (= ~a12~0 6)) (.cse23 (not .cse36)) (.cse26 (not (= 8 |old(~a16~0)|))) (.cse15 (not (= 3 calculate_output_~input))) (.cse11 (not .cse0)) (.cse21 (and .cse12 .cse10 .cse7 .cse9)) (.cse27 (not .cse20)) (.cse6 (not (<= 0 (+ |old(~a18~0)| 600001)))) (.cse18 (not (= 5 |old(~a12~0)|))) (.cse37 (or .cse16 .cse0 .cse17)) (.cse13 (= ~a12~0 5)) (.cse25 (not (= 9 |old(~a16~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4) (or .cse5 .cse6 (and .cse7 .cse8 .cse9 .cse10)) (or .cse11 (and .cse12 .cse10 .cse7 .cse9 (or (not .cse13) .cse14 .cse15)) .cse16 .cse1 .cse17 .cse3) (or .cse11 .cse18 (not (<= 0 (+ (div (+ |old(~a18~0)| (- 599175)) 3) 155))) (and .cse13 (not (= 2 calculate_output_~input)) .cse10 .cse9 (= ~a16~0 10)) (not .cse19)) (or (or .cse16 .cse20 .cse0 .cse19) .cse21 .cse6) (or .cse11 (and (or .cse14 (not (= 1 calculate_output_~input)) (< 134 ~a18~0)) .cse10 (or (not (= ~a16~0 8)) .cse15) .cse7 .cse9 .cse22) .cse16 .cse6 .cse23) (or (or .cse0 .cse19) .cse3 .cse21) (or (and .cse10 .cse24) (or .cse0 (not (<= 150 |old(~a18~0)|)) .cse2)) (or .cse1 .cse21 .cse3 .cse25) (or .cse11 .cse26 .cse27 .cse28 .cse6) (or .cse0 .cse28 .cse27 .cse25) (or (and .cse10 .cse7 .cse15 .cse9 .cse29) .cse11 .cse26 .cse3 (not (<= |old(~a18~0)| 134)) .cse30) (or (and .cse10 .cse7 .cse9 .cse29) .cse26 (forall ((v_~a18~0_911 Int)) (let ((.cse31 (* 5 (div (* 10 v_~a18~0_911) (- 5))))) (or (not (<= (+ v_~a18~0_911 79) 0)) (not (<= 0 .cse31)) (not (<= (div .cse31 5) |old(~a18~0)|)) (not (<= 5 .cse31))))) .cse30) (or (and .cse12 .cse7 .cse10) .cse26 .cse32) (or .cse33 .cse24 .cse5 .cse25) (or .cse33 (and (or .cse34 .cse35) .cse10) .cse2 .cse25) (or (or .cse2 .cse25) .cse3 .cse4) (or .cse36 .cse20 .cse0 (not .cse16) .cse6 (and .cse12 .cse10 .cse9 (= ~a16~0 12))) (or .cse21 .cse37 .cse3) (or .cse2 .cse4 .cse26 .cse6) (or .cse38 .cse21 .cse6 .cse25 .cse39) (or .cse32 (and .cse10 .cse7 .cse9 .cse22) .cse6 .cse23) (or .cse11 .cse26 .cse18 (and (or (<= ~a18~0 134) .cse15) .cse13 .cse10 .cse7 .cse9) .cse6) (or .cse11 (or .cse16 .cse17 .cse39) .cse6 .cse21) (or (or (or .cse27 .cse25) .cse6) (and (and (and .cse40 .cse7) .cse10) .cse9)) (or .cse18 .cse37 (and .cse13 .cse10 .cse7 .cse9) .cse25))))) [2019-09-07 21:24:35,824 INFO L443 ceAbstractionStarter]: For program point L434(lines 434 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,824 INFO L443 ceAbstractionStarter]: For program point L1491-1(line 1491) no Hoare annotation was computed. [2019-09-07 21:24:35,824 INFO L443 ceAbstractionStarter]: For program point L1227(lines 1227 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,824 INFO L443 ceAbstractionStarter]: For program point L567(lines 567 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,825 INFO L443 ceAbstractionStarter]: For program point L501(lines 501 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,825 INFO L443 ceAbstractionStarter]: For program point L303(lines 303 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,825 INFO L443 ceAbstractionStarter]: For program point L171-1(lines 23 1492) no Hoare annotation was computed. [2019-09-07 21:24:35,825 INFO L443 ceAbstractionStarter]: For program point L105-1(lines 23 1492) no Hoare annotation was computed. [2019-09-07 21:24:35,825 INFO L443 ceAbstractionStarter]: For program point L39-1(lines 23 1492) no Hoare annotation was computed. [2019-09-07 21:24:35,825 INFO L443 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2019-09-07 21:24:35,825 INFO L443 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2019-09-07 21:24:35,825 INFO L443 ceAbstractionStarter]: For program point L1097(lines 1097 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,825 INFO L443 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2019-09-07 21:24:35,826 INFO L443 ceAbstractionStarter]: For program point L1031(lines 1031 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,826 INFO L443 ceAbstractionStarter]: For program point L899(lines 899 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,826 INFO L443 ceAbstractionStarter]: For program point L1428(lines 1428 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,826 INFO L443 ceAbstractionStarter]: For program point L834(lines 834 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,826 INFO L443 ceAbstractionStarter]: For program point L636(lines 636 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,826 INFO L443 ceAbstractionStarter]: For program point L1297(lines 1297 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,826 INFO L443 ceAbstractionStarter]: For program point L240(lines 240 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,826 INFO L443 ceAbstractionStarter]: For program point L174-1(lines 23 1492) no Hoare annotation was computed. [2019-09-07 21:24:35,826 INFO L443 ceAbstractionStarter]: For program point L108-1(lines 23 1492) no Hoare annotation was computed. [2019-09-07 21:24:35,826 INFO L443 ceAbstractionStarter]: For program point L42-1(lines 23 1492) no Hoare annotation was computed. [2019-09-07 21:24:35,827 INFO L443 ceAbstractionStarter]: For program point L967(lines 967 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,827 INFO L443 ceAbstractionStarter]: For program point L769(lines 769 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,827 INFO L443 ceAbstractionStarter]: For program point L703(lines 703 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,827 INFO L443 ceAbstractionStarter]: For program point L373(lines 373 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,827 INFO L443 ceAbstractionStarter]: For program point L1364(lines 1364 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,827 INFO L443 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2019-09-07 21:24:35,827 INFO L443 ceAbstractionStarter]: For program point L1166(lines 1166 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,827 INFO L443 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2019-09-07 21:24:35,827 INFO L443 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2019-09-07 21:24:35,828 INFO L443 ceAbstractionStarter]: For program point L440(lines 440 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,828 INFO L443 ceAbstractionStarter]: For program point L573(lines 573 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,828 INFO L443 ceAbstractionStarter]: For program point L309(lines 309 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,828 INFO L443 ceAbstractionStarter]: For program point L1234(lines 1234 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,828 INFO L443 ceAbstractionStarter]: For program point L177-1(lines 23 1492) no Hoare annotation was computed. [2019-09-07 21:24:35,828 INFO L443 ceAbstractionStarter]: For program point L111-1(lines 23 1492) no Hoare annotation was computed. [2019-09-07 21:24:35,828 INFO L443 ceAbstractionStarter]: For program point L45-1(lines 23 1492) no Hoare annotation was computed. [2019-09-07 21:24:35,828 INFO L443 ceAbstractionStarter]: For program point L1036(lines 1036 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,828 INFO L443 ceAbstractionStarter]: For program point L706(lines 706 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,829 INFO L443 ceAbstractionStarter]: For program point L508(lines 508 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,829 INFO L443 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2019-09-07 21:24:35,829 INFO L443 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2019-09-07 21:24:35,829 INFO L443 ceAbstractionStarter]: For program point L1103(lines 1103 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,829 INFO L443 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2019-09-07 21:24:35,829 INFO L443 ceAbstractionStarter]: For program point L905(lines 905 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,829 INFO L443 ceAbstractionStarter]: For program point L641(lines 641 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,829 INFO L443 ceAbstractionStarter]: For program point L443(lines 443 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,829 INFO L443 ceAbstractionStarter]: For program point L1434(lines 1434 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,829 INFO L443 ceAbstractionStarter]: For program point L840(lines 840 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,830 INFO L443 ceAbstractionStarter]: For program point L1303(lines 1303 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,830 INFO L443 ceAbstractionStarter]: For program point L246(lines 246 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,830 INFO L443 ceAbstractionStarter]: For program point L180-1(lines 23 1492) no Hoare annotation was computed. [2019-09-07 21:24:35,830 INFO L443 ceAbstractionStarter]: For program point L114-1(lines 23 1492) no Hoare annotation was computed. [2019-09-07 21:24:35,830 INFO L443 ceAbstractionStarter]: For program point L48-1(lines 23 1492) no Hoare annotation was computed. [2019-09-07 21:24:35,830 INFO L443 ceAbstractionStarter]: For program point L775(lines 775 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,830 INFO L443 ceAbstractionStarter]: For program point L1370(lines 1370 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,830 INFO L443 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2019-09-07 21:24:35,830 INFO L443 ceAbstractionStarter]: For program point L1172(lines 1172 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,830 INFO L443 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2019-09-07 21:24:35,831 INFO L443 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2019-09-07 21:24:35,831 INFO L443 ceAbstractionStarter]: For program point L974(lines 974 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,831 INFO L443 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 118) no Hoare annotation was computed. [2019-09-07 21:24:35,831 INFO L443 ceAbstractionStarter]: For program point L578(lines 578 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,831 INFO L443 ceAbstractionStarter]: For program point L380(lines 380 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,831 INFO L443 ceAbstractionStarter]: For program point L315(lines 315 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,831 INFO L443 ceAbstractionStarter]: For program point L183-1(lines 23 1492) no Hoare annotation was computed. [2019-09-07 21:24:35,831 INFO L443 ceAbstractionStarter]: For program point L117-1(lines 23 1492) no Hoare annotation was computed. [2019-09-07 21:24:35,831 INFO L443 ceAbstractionStarter]: For program point L51-1(lines 23 1492) no Hoare annotation was computed. [2019-09-07 21:24:35,831 INFO L443 ceAbstractionStarter]: For program point L1042(lines 1042 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,832 INFO L443 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 23 1492) no Hoare annotation was computed. [2019-09-07 21:24:35,832 INFO L443 ceAbstractionStarter]: For program point L778(lines 778 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,832 INFO L443 ceAbstractionStarter]: For program point L712(lines 712 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,832 INFO L443 ceAbstractionStarter]: For program point L1241(lines 1241 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,832 INFO L443 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2019-09-07 21:24:35,832 INFO L443 ceAbstractionStarter]: For program point L1175(lines 1175 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,832 INFO L443 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2019-09-07 21:24:35,832 INFO L443 ceAbstractionStarter]: For program point L1109(lines 1109 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,832 INFO L443 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2019-09-07 21:24:35,832 INFO L443 ceAbstractionStarter]: For program point L515(lines 515 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,833 INFO L443 ceAbstractionStarter]: For program point L449(lines 449 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,833 INFO L443 ceAbstractionStarter]: For program point L1440(lines 1440 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,833 INFO L443 ceAbstractionStarter]: For program point L912(lines 912 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,833 INFO L443 ceAbstractionStarter]: For program point L846(lines 846 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,833 INFO L443 ceAbstractionStarter]: For program point L648(lines 648 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,833 INFO L443 ceAbstractionStarter]: For program point L1375(lines 1375 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,833 INFO L443 ceAbstractionStarter]: For program point L1309(lines 1309 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,833 INFO L443 ceAbstractionStarter]: For program point L252(lines 252 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,833 INFO L443 ceAbstractionStarter]: For program point L186-1(lines 23 1492) no Hoare annotation was computed. [2019-09-07 21:24:35,833 INFO L443 ceAbstractionStarter]: For program point L120-1(lines 23 1492) no Hoare annotation was computed. [2019-09-07 21:24:35,833 INFO L443 ceAbstractionStarter]: For program point L54-1(lines 23 1492) no Hoare annotation was computed. [2019-09-07 21:24:35,834 INFO L443 ceAbstractionStarter]: For program point L979(lines 979 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,834 INFO L443 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2019-09-07 21:24:35,834 INFO L443 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2019-09-07 21:24:35,834 INFO L443 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2019-09-07 21:24:35,834 INFO L443 ceAbstractionStarter]: For program point L584(lines 584 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,834 INFO L443 ceAbstractionStarter]: For program point L386(lines 386 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,834 INFO L443 ceAbstractionStarter]: For program point L717(lines 717 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,834 INFO L443 ceAbstractionStarter]: For program point L321(lines 321 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,834 INFO L443 ceAbstractionStarter]: For program point L189-1(lines 23 1492) no Hoare annotation was computed. [2019-09-07 21:24:35,834 INFO L443 ceAbstractionStarter]: For program point L123-1(lines 23 1492) no Hoare annotation was computed. [2019-09-07 21:24:35,835 INFO L443 ceAbstractionStarter]: For program point L1114(lines 1114 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,835 INFO L443 ceAbstractionStarter]: For program point L57-1(lines 23 1492) no Hoare annotation was computed. [2019-09-07 21:24:35,835 INFO L443 ceAbstractionStarter]: For program point L1048(lines 1048 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,835 INFO L443 ceAbstractionStarter]: For program point L784(lines 784 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,835 INFO L443 ceAbstractionStarter]: For program point L454(lines 454 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,835 INFO L443 ceAbstractionStarter]: For program point L1247(lines 1247 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,835 INFO L443 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2019-09-07 21:24:35,835 INFO L443 ceAbstractionStarter]: For program point L1181(lines 1181 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,835 INFO L443 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2019-09-07 21:24:35,835 INFO L443 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2019-09-07 21:24:35,836 INFO L443 ceAbstractionStarter]: For program point L917(lines 917 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,836 INFO L443 ceAbstractionStarter]: For program point L851(lines 851 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,836 INFO L443 ceAbstractionStarter]: For program point L521(lines 521 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,836 INFO L443 ceAbstractionStarter]: For program point L1446(lines 1446 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,836 INFO L443 ceAbstractionStarter]: For program point L1314(lines 1314 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,836 INFO L443 ceAbstractionStarter]: For program point L257(lines 257 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,837 INFO L439 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 23 1492) the Hoare annotation is: (let ((.cse29 (= 8 |old(~a12~0)|))) (let ((.cse32 (= ~a12~0 5)) (.cse12 (= 12 |old(~a16~0)|)) (.cse13 (not (<= |old(~a12~0)| 5))) (.cse31 (= ~a12~0 7)) (.cse16 (= 7 |old(~a12~0)|)) (.cse4 (= 4 |old(~a15~0)|)) (.cse0 (= ~a12~0 |old(~a12~0)|)) (.cse30 (not (= 3 |old(~a15~0)|))) (.cse19 (not .cse29)) (.cse33 (= ~a12~0 8)) (.cse2 (= ~a15~0 |old(~a15~0)|)) (.cse1 (= ~a16~0 |old(~a16~0)|)) (.cse21 (= ~a18~0 |old(~a18~0)|))) (let ((.cse25 (and .cse2 .cse1 .cse21 (= ~a12~0 9))) (.cse26 (not (= 9 |old(~a12~0)|))) (.cse14 (not (<= (+ |old(~a18~0)| 156) 0))) (.cse22 (and .cse1 .cse33 .cse21 .cse2)) (.cse18 (and (or .cse30 (not (< 134 |old(~a18~0)|)) .cse19) (not (<= (+ |old(~a18~0)| 79) 0)))) (.cse8 (and .cse0 .cse2 .cse1 .cse21)) (.cse17 (and .cse2 .cse1 .cse33 .cse21)) (.cse10 (not (<= 0 (+ |old(~a18~0)| 155)))) (.cse20 (= 6 |old(~a12~0)|)) (.cse11 (not .cse4)) (.cse3 (not (= 8 |old(~a16~0)|))) (.cse6 (not .cse16)) (.cse5 (and .cse2 .cse31 .cse1 .cse21)) (.cse15 (not (<= 0 (+ |old(~a18~0)| 600001)))) (.cse9 (= 10 |old(~a16~0)|)) (.cse27 (not (= 5 |old(~a12~0)|))) (.cse23 (or .cse12 .cse4 .cse13)) (.cse28 (and .cse32 .cse2 .cse1 .cse21)) (.cse7 (not (= 9 |old(~a16~0)|)))) (and (or (and .cse0 .cse1 .cse2) .cse3 .cse4) (or .cse5 (or .cse4 .cse6) .cse7) (or .cse8 (or .cse4 .cse9) .cse10) (or .cse11 (or .cse12 .cse13 .cse14) .cse8 .cse15) (or (or .cse12 .cse16 .cse4 .cse9) .cse8 .cse15) (or .cse17 .cse4 .cse18 .cse19 .cse15) (or .cse20 .cse16 .cse4 (not .cse12) .cse15 (and .cse0 .cse2 .cse21 (= ~a16~0 12))) (or (or .cse4 (not (<= 150 |old(~a18~0)|)) .cse19) .cse22) (or .cse8 .cse23 .cse10) (or .cse3 (forall ((v_~a18~0_911 Int)) (let ((.cse24 (* 5 (div (* 10 v_~a18~0_911) (- 5))))) (or (not (<= (+ v_~a18~0_911 79) 0)) (not (<= 0 .cse24)) (not (<= (div .cse24 5) |old(~a18~0)|)) (not (<= 5 .cse24))))) .cse25 .cse26) (or .cse8 .cse18 .cse10 .cse7) (or .cse3 .cse25 .cse10 (not (<= |old(~a18~0)| 134)) .cse26) (or .cse19 .cse3 .cse17 .cse15) (or .cse3 .cse27 .cse28 .cse15) (or .cse29 .cse8 .cse15 .cse7 .cse14) (or .cse30 .cse19 .cse22 .cse7) (or (or (or .cse11 (or .cse6 .cse7)) .cse15) (and (= ~a15~0 4) .cse31 .cse1 .cse21)) (or .cse12 .cse18 .cse13 .cse10 .cse8) (or (or .cse19 .cse7) .cse17 .cse10) (or .cse12 (and .cse2 .cse1 .cse21 (= ~a12~0 6)) .cse15 (not .cse20)) (or .cse11 .cse3 .cse6 .cse5 .cse15) (or .cse27 (and .cse32 .cse2 .cse21 (= ~a16~0 10)) (not (<= 0 (+ (div (+ |old(~a18~0)| (- 599175)) 3) 155))) (not .cse9)) (or .cse27 .cse23 .cse28 .cse7))))) [2019-09-07 21:24:35,837 INFO L443 ceAbstractionStarter]: For program point L1381(lines 1381 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,837 INFO L443 ceAbstractionStarter]: For program point L192-1(lines 23 1492) no Hoare annotation was computed. [2019-09-07 21:24:35,837 INFO L443 ceAbstractionStarter]: For program point L126-1(lines 23 1492) no Hoare annotation was computed. [2019-09-07 21:24:35,837 INFO L443 ceAbstractionStarter]: For program point L60-1(lines 23 1492) no Hoare annotation was computed. [2019-09-07 21:24:35,837 INFO L443 ceAbstractionStarter]: For program point L655(lines 655 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,837 INFO L443 ceAbstractionStarter]: For program point L589(lines 589 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,837 INFO L443 ceAbstractionStarter]: For program point L457(lines 457 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,837 INFO L443 ceAbstractionStarter]: For program point L391(lines 391 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,838 INFO L443 ceAbstractionStarter]: For program point L1250(lines 1250 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,838 INFO L443 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2019-09-07 21:24:35,838 INFO L443 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2019-09-07 21:24:35,838 INFO L443 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2019-09-07 21:24:35,838 INFO L443 ceAbstractionStarter]: For program point L986(lines 986 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,838 INFO L443 ceAbstractionStarter]: For program point L1449(lines 1449 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,838 INFO L443 ceAbstractionStarter]: For program point L789(lines 789 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,838 INFO L443 ceAbstractionStarter]: For program point L723(lines 723 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,838 INFO L443 ceAbstractionStarter]: For program point L327(lines 327 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,839 INFO L443 ceAbstractionStarter]: For program point L195-1(lines 23 1492) no Hoare annotation was computed. [2019-09-07 21:24:35,839 INFO L443 ceAbstractionStarter]: For program point L129-1(lines 23 1492) no Hoare annotation was computed. [2019-09-07 21:24:35,839 INFO L443 ceAbstractionStarter]: For program point L1120(lines 1120 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,839 INFO L443 ceAbstractionStarter]: For program point L63-1(lines 23 1492) no Hoare annotation was computed. [2019-09-07 21:24:35,839 INFO L443 ceAbstractionStarter]: For program point L922(lines 922 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,839 INFO L443 ceAbstractionStarter]: For program point L262(lines 262 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,839 INFO L443 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2019-09-07 21:24:35,839 INFO L443 ceAbstractionStarter]: For program point L1187(lines 1187 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,839 INFO L443 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2019-09-07 21:24:35,840 INFO L443 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2019-09-07 21:24:35,840 INFO L443 ceAbstractionStarter]: For program point L1055(lines 1055 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,840 INFO L443 ceAbstractionStarter]: For program point L857(lines 857 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,840 INFO L443 ceAbstractionStarter]: For program point L527(lines 527 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,840 INFO L443 ceAbstractionStarter]: For program point L1386(lines 1386 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,840 INFO L443 ceAbstractionStarter]: For program point L594(lines 594 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,840 INFO L443 ceAbstractionStarter]: For program point L1321(lines 1321 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,840 INFO L443 ceAbstractionStarter]: For program point L198-1(lines 23 1492) no Hoare annotation was computed. [2019-09-07 21:24:35,840 INFO L443 ceAbstractionStarter]: For program point L132-1(lines 23 1492) no Hoare annotation was computed. [2019-09-07 21:24:35,840 INFO L443 ceAbstractionStarter]: For program point L66-1(lines 23 1492) no Hoare annotation was computed. [2019-09-07 21:24:35,840 INFO L443 ceAbstractionStarter]: For program point L661(lines 661 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,841 INFO L443 ceAbstractionStarter]: For program point L463(lines 463 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,841 INFO L443 ceAbstractionStarter]: For program point L1256(lines 1256 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,841 INFO L443 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2019-09-07 21:24:35,841 INFO L443 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2019-09-07 21:24:35,841 INFO L443 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2019-09-07 21:24:35,841 INFO L443 ceAbstractionStarter]: For program point L728(lines 728 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,841 INFO L443 ceAbstractionStarter]: For program point L398(lines 398 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,841 INFO L443 ceAbstractionStarter]: For program point L1125(lines 1125 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,841 INFO L443 ceAbstractionStarter]: For program point L993(lines 993 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,841 INFO L443 ceAbstractionStarter]: For program point L1456(lines 1456 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,842 INFO L443 ceAbstractionStarter]: For program point L333(lines 333 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,842 INFO L443 ceAbstractionStarter]: For program point L201-1(lines 23 1492) no Hoare annotation was computed. [2019-09-07 21:24:35,842 INFO L443 ceAbstractionStarter]: For program point L135-1(lines 23 1492) no Hoare annotation was computed. [2019-09-07 21:24:35,842 INFO L443 ceAbstractionStarter]: For program point L69-1(lines 23 1492) no Hoare annotation was computed. [2019-09-07 21:24:35,842 INFO L443 ceAbstractionStarter]: For program point L796(lines 796 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,842 INFO L443 ceAbstractionStarter]: For program point L664(lines 664 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,842 INFO L443 ceAbstractionStarter]: For program point L268(lines 268 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,842 INFO L443 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2019-09-07 21:24:35,842 INFO L443 ceAbstractionStarter]: For program point L1193(lines 1193 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,842 INFO L443 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2019-09-07 21:24:35,843 INFO L443 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2019-09-07 21:24:35,843 INFO L443 ceAbstractionStarter]: For program point L1061(lines 1061 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,843 INFO L443 ceAbstractionStarter]: For program point L929(lines 929 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,843 INFO L443 ceAbstractionStarter]: For program point L863(lines 863 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,843 INFO L443 ceAbstractionStarter]: For program point L533(lines 533 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,843 INFO L443 ceAbstractionStarter]: For program point L1392(lines 1392 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,843 INFO L443 ceAbstractionStarter]: For program point L600(lines 600 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,843 INFO L443 ceAbstractionStarter]: For program point L1327(lines 1327 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,843 INFO L443 ceAbstractionStarter]: For program point L204-1(lines 23 1492) no Hoare annotation was computed. [2019-09-07 21:24:35,844 INFO L443 ceAbstractionStarter]: For program point L138-1(lines 23 1492) no Hoare annotation was computed. [2019-09-07 21:24:35,844 INFO L443 ceAbstractionStarter]: For program point L72-1(lines 23 1492) no Hoare annotation was computed. [2019-09-07 21:24:35,844 INFO L443 ceAbstractionStarter]: For program point L469(lines 469 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,844 INFO L443 ceAbstractionStarter]: For program point L1262(lines 1262 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,844 INFO L443 ceAbstractionStarter]: For program point L205(line 205) no Hoare annotation was computed. [2019-09-07 21:24:35,844 INFO L443 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2019-09-07 21:24:35,844 INFO L443 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2019-09-07 21:24:35,844 INFO L443 ceAbstractionStarter]: For program point L734(lines 734 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,845 INFO L443 ceAbstractionStarter]: For program point L1461(lines 1461 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,845 INFO L443 ceAbstractionStarter]: For program point L404(lines 404 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,845 INFO L443 ceAbstractionStarter]: For program point L338(lines 338 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,845 INFO L443 ceAbstractionStarter]: For program point L1131(lines 1131 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,845 INFO L443 ceAbstractionStarter]: For program point L999(lines 999 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,845 INFO L443 ceAbstractionStarter]: For program point L141-1(lines 23 1492) no Hoare annotation was computed. [2019-09-07 21:24:35,845 INFO L443 ceAbstractionStarter]: For program point L75-1(lines 23 1492) no Hoare annotation was computed. [2019-09-07 21:24:35,845 INFO L443 ceAbstractionStarter]: For program point L802(lines 802 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,845 INFO L443 ceAbstractionStarter]: For program point L670(lines 670 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,846 INFO L443 ceAbstractionStarter]: For program point L538(lines 538 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,846 INFO L443 ceAbstractionStarter]: For program point L1397(lines 1397 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,846 INFO L443 ceAbstractionStarter]: For program point L274(lines 274 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,846 INFO L443 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2019-09-07 21:24:35,846 INFO L443 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2019-09-07 21:24:35,846 INFO L443 ceAbstractionStarter]: For program point L1067(lines 1067 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,846 INFO L443 ceAbstractionStarter]: For program point L935(lines 935 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,846 INFO L443 ceAbstractionStarter]: For program point L869(lines 869 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,846 INFO L443 ceAbstractionStarter]: For program point L1200(lines 1200 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,847 INFO L443 ceAbstractionStarter]: For program point L606(lines 606 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,847 INFO L443 ceAbstractionStarter]: For program point L1267(lines 1267 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,847 INFO L443 ceAbstractionStarter]: For program point L144-1(lines 23 1492) no Hoare annotation was computed. [2019-09-07 21:24:35,847 INFO L443 ceAbstractionStarter]: For program point L78-1(lines 23 1492) no Hoare annotation was computed. [2019-09-07 21:24:35,847 INFO L443 ceAbstractionStarter]: For program point L1466(lines 1466 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,847 INFO L443 ceAbstractionStarter]: For program point L1334(lines 1334 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,847 INFO L443 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2019-09-07 21:24:35,847 INFO L443 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2019-09-07 21:24:35,847 INFO L443 ceAbstractionStarter]: For program point L476(lines 476 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,848 INFO L443 ceAbstractionStarter]: For program point L1137(lines 1137 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,848 INFO L443 ceAbstractionStarter]: For program point L1005(lines 1005 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,848 INFO L443 ceAbstractionStarter]: For program point L741(lines 741 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,848 INFO L443 ceAbstractionStarter]: For program point L543(lines 543 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,848 INFO L443 ceAbstractionStarter]: For program point L411(lines 411 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,848 INFO L443 ceAbstractionStarter]: For program point L345(lines 345 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,848 INFO L443 ceAbstractionStarter]: For program point L279(lines 279 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,848 INFO L443 ceAbstractionStarter]: For program point L213(lines 213 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,848 INFO L443 ceAbstractionStarter]: For program point L147-1(lines 23 1492) no Hoare annotation was computed. [2019-09-07 21:24:35,848 INFO L443 ceAbstractionStarter]: For program point L81-1(lines 23 1492) no Hoare annotation was computed. [2019-09-07 21:24:35,849 INFO L443 ceAbstractionStarter]: For program point L808(lines 808 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,849 INFO L443 ceAbstractionStarter]: For program point L1403(lines 1403 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,849 INFO L443 ceAbstractionStarter]: For program point L1205(lines 1205 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,849 INFO L443 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2019-09-07 21:24:35,849 INFO L443 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2019-09-07 21:24:35,849 INFO L443 ceAbstractionStarter]: For program point L1073(lines 1073 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,849 INFO L443 ceAbstractionStarter]: For program point L875(lines 875 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,849 INFO L443 ceAbstractionStarter]: For program point L677(lines 677 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,849 INFO L443 ceAbstractionStarter]: For program point L942(lines 942 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,850 INFO L443 ceAbstractionStarter]: For program point L612(lines 612 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,850 INFO L443 ceAbstractionStarter]: For program point L150-1(lines 23 1492) no Hoare annotation was computed. [2019-09-07 21:24:35,850 INFO L443 ceAbstractionStarter]: For program point L84-1(lines 23 1492) no Hoare annotation was computed. [2019-09-07 21:24:35,850 INFO L443 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 23 1492) no Hoare annotation was computed. [2019-09-07 21:24:35,850 INFO L443 ceAbstractionStarter]: For program point L1472(lines 1472 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,850 INFO L443 ceAbstractionStarter]: For program point L1274(lines 1274 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,850 INFO L443 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2019-09-07 21:24:35,850 INFO L443 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2019-09-07 21:24:35,850 INFO L443 ceAbstractionStarter]: For program point L746(lines 746 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,851 INFO L443 ceAbstractionStarter]: For program point L680(lines 680 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,851 INFO L443 ceAbstractionStarter]: For program point L548(lines 548 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,851 INFO L443 ceAbstractionStarter]: For program point L350(lines 350 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,851 INFO L443 ceAbstractionStarter]: For program point L1341(lines 1341 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,851 INFO L443 ceAbstractionStarter]: For program point L218(lines 218 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,851 INFO L443 ceAbstractionStarter]: For program point L1143(lines 1143 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,851 INFO L443 ceAbstractionStarter]: For program point L1011(lines 1011 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,851 INFO L443 ceAbstractionStarter]: For program point L483(lines 483 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,851 INFO L443 ceAbstractionStarter]: For program point L417(lines 417 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,851 INFO L443 ceAbstractionStarter]: For program point L285(lines 285 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,852 INFO L443 ceAbstractionStarter]: For program point L153-1(lines 23 1492) no Hoare annotation was computed. [2019-09-07 21:24:35,852 INFO L443 ceAbstractionStarter]: For program point L87-1(lines 23 1492) no Hoare annotation was computed. [2019-09-07 21:24:35,852 INFO L443 ceAbstractionStarter]: For program point L1409(lines 1409 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,852 INFO L443 ceAbstractionStarter]: For program point L1211(lines 1211 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,852 INFO L443 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2019-09-07 21:24:35,852 INFO L443 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2019-09-07 21:24:35,852 INFO L443 ceAbstractionStarter]: For program point L1079(lines 1079 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,852 INFO L443 ceAbstractionStarter]: For program point L815(lines 815 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,852 INFO L443 ceAbstractionStarter]: For program point L948(lines 948 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,852 INFO L443 ceAbstractionStarter]: For program point L882(lines 882 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,853 INFO L443 ceAbstractionStarter]: For program point L618(lines 618 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,853 INFO L443 ceAbstractionStarter]: For program point L1477(lines 1477 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,853 INFO L443 ceAbstractionStarter]: For program point L156-1(lines 23 1492) no Hoare annotation was computed. [2019-09-07 21:24:35,853 INFO L443 ceAbstractionStarter]: For program point L90-1(lines 23 1492) no Hoare annotation was computed. [2019-09-07 21:24:35,853 INFO L443 ceAbstractionStarter]: For program point L24(lines 24 26) no Hoare annotation was computed. [2019-09-07 21:24:35,853 INFO L443 ceAbstractionStarter]: For program point L24-2(lines 23 1492) no Hoare annotation was computed. [2019-09-07 21:24:35,853 INFO L443 ceAbstractionStarter]: For program point L1280(lines 1280 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,853 INFO L443 ceAbstractionStarter]: For program point L223(lines 223 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,853 INFO L443 ceAbstractionStarter]: For program point L1214(lines 1214 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,853 INFO L443 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2019-09-07 21:24:35,853 INFO L443 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2019-09-07 21:24:35,854 INFO L443 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2019-09-07 21:24:35,854 INFO L443 ceAbstractionStarter]: For program point L752(lines 752 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,854 INFO L443 ceAbstractionStarter]: For program point L686(lines 686 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,854 INFO L443 ceAbstractionStarter]: For program point L554(lines 554 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,854 INFO L443 ceAbstractionStarter]: For program point L356(lines 356 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,854 INFO L443 ceAbstractionStarter]: For program point L1347(lines 1347 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,854 INFO L443 ceAbstractionStarter]: For program point L290(lines 290 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,854 INFO L443 ceAbstractionStarter]: For program point L1149(lines 1149 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,854 INFO L443 ceAbstractionStarter]: For program point L489(lines 489 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,854 INFO L443 ceAbstractionStarter]: For program point L159-1(lines 23 1492) no Hoare annotation was computed. [2019-09-07 21:24:35,854 INFO L443 ceAbstractionStarter]: For program point L93-1(lines 23 1492) no Hoare annotation was computed. [2019-09-07 21:24:35,855 INFO L443 ceAbstractionStarter]: For program point L27-1(lines 23 1492) no Hoare annotation was computed. [2019-09-07 21:24:35,855 INFO L443 ceAbstractionStarter]: For program point L1018(lines 1018 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,855 INFO L443 ceAbstractionStarter]: For program point L424(lines 424 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,855 INFO L443 ceAbstractionStarter]: For program point L1415(lines 1415 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,855 INFO L443 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2019-09-07 21:24:35,855 INFO L443 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2019-09-07 21:24:35,855 INFO L443 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2019-09-07 21:24:35,855 INFO L443 ceAbstractionStarter]: For program point L1086(lines 1086 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,855 INFO L443 ceAbstractionStarter]: For program point L954(lines 954 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,855 INFO L443 ceAbstractionStarter]: For program point L888(lines 888 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,856 INFO L443 ceAbstractionStarter]: For program point L822(lines 822 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,856 INFO L443 ceAbstractionStarter]: For program point L624(lines 624 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,856 INFO L443 ceAbstractionStarter]: For program point L162-1(lines 23 1492) no Hoare annotation was computed. [2019-09-07 21:24:35,856 INFO L443 ceAbstractionStarter]: For program point L96-1(lines 23 1492) no Hoare annotation was computed. [2019-09-07 21:24:35,856 INFO L443 ceAbstractionStarter]: For program point L30-1(lines 23 1492) no Hoare annotation was computed. [2019-09-07 21:24:35,856 INFO L443 ceAbstractionStarter]: For program point L691(lines 691 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,856 INFO L443 ceAbstractionStarter]: For program point L1484(lines 1484 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,856 INFO L443 ceAbstractionStarter]: For program point L427(lines 427 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,856 INFO L443 ceAbstractionStarter]: For program point L361(lines 361 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,856 INFO L443 ceAbstractionStarter]: For program point L1286(lines 1286 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,856 INFO L443 ceAbstractionStarter]: For program point L229(lines 229 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,857 INFO L443 ceAbstractionStarter]: For program point L1220(lines 1220 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,857 INFO L443 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2019-09-07 21:24:35,857 INFO L443 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2019-09-07 21:24:35,857 INFO L443 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2019-09-07 21:24:35,857 INFO L443 ceAbstractionStarter]: For program point L758(lines 758 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,857 INFO L443 ceAbstractionStarter]: For program point L560(lines 560 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,857 INFO L443 ceAbstractionStarter]: For program point L1353(lines 1353 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,857 INFO L443 ceAbstractionStarter]: For program point L1155(lines 1155 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,857 INFO L443 ceAbstractionStarter]: For program point L495(lines 495 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,857 INFO L443 ceAbstractionStarter]: For program point L297(lines 297 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,857 INFO L443 ceAbstractionStarter]: For program point L165-1(lines 23 1492) no Hoare annotation was computed. [2019-09-07 21:24:35,858 INFO L443 ceAbstractionStarter]: For program point L99-1(lines 23 1492) no Hoare annotation was computed. [2019-09-07 21:24:35,858 INFO L443 ceAbstractionStarter]: For program point L33-1(lines 23 1492) no Hoare annotation was computed. [2019-09-07 21:24:35,858 INFO L443 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2019-09-07 21:24:35,858 INFO L443 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2019-09-07 21:24:35,858 INFO L443 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2019-09-07 21:24:35,858 INFO L443 ceAbstractionStarter]: For program point L1025(lines 1025 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,858 INFO L443 ceAbstractionStarter]: For program point L1422(lines 1422 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,858 INFO L443 ceAbstractionStarter]: For program point L1092(lines 1092 1490) no Hoare annotation was computed. [2019-09-07 21:24:35,858 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-09-07 21:24:35,858 INFO L439 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (not (= ~a16~0 10)) (not (= 12 ~a16~0)) (<= ~a12~0 5) (= (+ ~a18~0 87) 0) (not (= 4 ~a15~0))) [2019-09-07 21:24:35,859 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-09-07 21:24:35,859 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-09-07 21:24:35,859 INFO L439 ceAbstractionStarter]: At program point mainENTRY(lines 1767 1783) the Hoare annotation is: (or (= 12 |old(~a16~0)|) (= 4 |old(~a15~0)|) (not (= (+ |old(~a18~0)| 87) 0)) (not (<= |old(~a12~0)| 5)) (= 10 |old(~a16~0)|) (and (= ~a12~0 |old(~a12~0)|) (= ~a15~0 |old(~a15~0)|) (= ~a16~0 |old(~a16~0)|) (= ~a18~0 |old(~a18~0)|))) [2019-09-07 21:24:35,859 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 1767 1783) no Hoare annotation was computed. [2019-09-07 21:24:35,860 INFO L439 ceAbstractionStarter]: At program point L1781(line 1781) the Hoare annotation is: (let ((.cse4 (= ~a12~0 6))) (let ((.cse12 (not .cse4)) (.cse1 (not (= 12 ~a16~0))) (.cse19 (= ~a12~0 8))) (let ((.cse10 (and .cse12 .cse1 (not .cse19))) (.cse14 (not (= 4 ~a15~0))) (.cse17 (= ~a16~0 10))) (let ((.cse31 (not .cse17)) (.cse30 (and .cse10 .cse14))) (let ((.cse27 (and .cse1 .cse14)) (.cse6 (= ~a15~0 3)) (.cse18 (= ~a16~0 8)) (.cse26 (= ~a12~0 7)) (.cse9 (and .cse31 .cse30)) (.cse11 (<= ~a12~0 5)) (.cse2 (<= 9 |old(~a16~0)|))) (let ((.cse8 (not (= 7 ~a12~0))) (.cse7 (and (and .cse31 .cse1 .cse14) .cse19 .cse2)) (.cse22 (and .cse11 .cse30 .cse2)) (.cse16 (and .cse10 .cse2)) (.cse28 (and .cse26 .cse9 .cse2)) (.cse25 (= ~a12~0 9)) (.cse5 (= ~a16~0 9)) (.cse15 (= ~a12~0 5)) (.cse23 (and .cse18 .cse2)) (.cse0 (<= 0 (+ ~a18~0 600001))) (.cse20 (or (and .cse6 .cse19 (< 134 ~a18~0)) (<= (+ ~a18~0 79) 0))) (.cse21 (<= 0 (+ ~a18~0 155))) (.cse13 (= ~a16~0 12)) (.cse29 (and .cse27 .cse19 .cse2)) (.cse3 (or (= 5 |old(~a12~0)|) (= 9 |old(~a12~0)|)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse6 .cse7) (and .cse0 (and .cse8 .cse9 .cse2) .cse3) (and (= ~a15~0 4) .cse0 (and (<= (+ ~a18~0 156) 0) .cse10 .cse11 .cse2) .cse3) (and .cse0 .cse3 (and .cse12 .cse13 .cse8 .cse2 .cse14)) (and (<= 0 (+ (div (+ ~a18~0 (- 599175)) 3) 155)) .cse15 .cse16 .cse3 .cse17) (and (and .cse18 .cse19 .cse2) .cse0 .cse3) (not (= (+ |old(~a18~0)| 87) 0)) (and (and .cse16 .cse5 .cse0 .cse20) .cse3) (and .cse21 .cse3 .cse7) (and .cse21 .cse3 .cse22) (and .cse5 .cse22 .cse15) (and .cse21 .cse16 (<= ~a12~0 6) .cse3 .cse20) (= 12 |old(~a16~0)|) (and .cse23 (exists ((v_~a18~0_911 Int)) (let ((.cse24 (* 5 (div (* 10 v_~a18~0_911) (- 5))))) (and (<= 5 .cse24) (<= 0 .cse24) (<= (+ v_~a18~0_911 79) 0) (<= (div .cse24 5) ~a18~0)))) .cse3 .cse25) (and .cse0 .cse3 (and .cse18 .cse26 .cse2)) (and .cse18 .cse27 .cse2) (and .cse21 .cse3 .cse28) (and .cse21 (and .cse5 (and .cse19 .cse2)) .cse3) (and (= ~a12~0 |old(~a12~0)|) (= ~a16~0 |old(~a16~0)|) (= (+ ~a18~0 87) 0) (= ~a15~0 |old(~a15~0)|)) (and .cse5 .cse28) (and .cse23 (<= ~a18~0 134) .cse21 .cse3 .cse25) (and .cse3 (and .cse0 (and .cse5 (and .cse26 .cse2)))) (not (<= |old(~a12~0)| 5)) (and .cse0 .cse15 .cse23 .cse3) (and .cse0 .cse29 .cse3 .cse20) (and .cse21 (and .cse13 .cse2 .cse14) .cse3) (= 4 |old(~a15~0)|) (= 10 |old(~a16~0)|) (and (and (<= 150 ~a18~0) .cse29) .cse3)))))))) [2019-09-07 21:24:35,860 INFO L443 ceAbstractionStarter]: For program point L1781-1(line 1781) no Hoare annotation was computed. [2019-09-07 21:24:35,860 INFO L443 ceAbstractionStarter]: For program point L1778(line 1778) no Hoare annotation was computed. [2019-09-07 21:24:35,860 INFO L439 ceAbstractionStarter]: At program point L1773-2(lines 1773 1782) the Hoare annotation is: (let ((.cse4 (= ~a12~0 6))) (let ((.cse12 (not .cse4)) (.cse1 (not (= 12 ~a16~0))) (.cse19 (= ~a12~0 8))) (let ((.cse10 (and .cse12 .cse1 (not .cse19))) (.cse14 (not (= 4 ~a15~0))) (.cse17 (= ~a16~0 10))) (let ((.cse31 (not .cse17)) (.cse30 (and .cse10 .cse14))) (let ((.cse27 (and .cse1 .cse14)) (.cse6 (= ~a15~0 3)) (.cse18 (= ~a16~0 8)) (.cse26 (= ~a12~0 7)) (.cse9 (and .cse31 .cse30)) (.cse11 (<= ~a12~0 5)) (.cse2 (<= 9 |old(~a16~0)|))) (let ((.cse8 (not (= 7 ~a12~0))) (.cse7 (and (and .cse31 .cse1 .cse14) .cse19 .cse2)) (.cse22 (and .cse11 .cse30 .cse2)) (.cse16 (and .cse10 .cse2)) (.cse28 (and .cse26 .cse9 .cse2)) (.cse25 (= ~a12~0 9)) (.cse5 (= ~a16~0 9)) (.cse15 (= ~a12~0 5)) (.cse23 (and .cse18 .cse2)) (.cse0 (<= 0 (+ ~a18~0 600001))) (.cse20 (or (and .cse6 .cse19 (< 134 ~a18~0)) (<= (+ ~a18~0 79) 0))) (.cse21 (<= 0 (+ ~a18~0 155))) (.cse13 (= ~a16~0 12)) (.cse29 (and .cse27 .cse19 .cse2)) (.cse3 (or (= 5 |old(~a12~0)|) (= 9 |old(~a12~0)|)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse6 .cse7) (and .cse0 (and .cse8 .cse9 .cse2) .cse3) (and (= ~a15~0 4) .cse0 (and (<= (+ ~a18~0 156) 0) .cse10 .cse11 .cse2) .cse3) (and .cse0 .cse3 (and .cse12 .cse13 .cse8 .cse2 .cse14)) (and (<= 0 (+ (div (+ ~a18~0 (- 599175)) 3) 155)) .cse15 .cse16 .cse3 .cse17) (and (and .cse18 .cse19 .cse2) .cse0 .cse3) (not (= (+ |old(~a18~0)| 87) 0)) (and (and .cse16 .cse5 .cse0 .cse20) .cse3) (and .cse21 .cse3 .cse7) (and .cse21 .cse3 .cse22) (and .cse5 .cse22 .cse15) (and .cse21 .cse16 (<= ~a12~0 6) .cse3 .cse20) (= 12 |old(~a16~0)|) (and .cse23 (exists ((v_~a18~0_911 Int)) (let ((.cse24 (* 5 (div (* 10 v_~a18~0_911) (- 5))))) (and (<= 5 .cse24) (<= 0 .cse24) (<= (+ v_~a18~0_911 79) 0) (<= (div .cse24 5) ~a18~0)))) .cse3 .cse25) (and .cse0 .cse3 (and .cse18 .cse26 .cse2)) (and .cse18 .cse27 .cse2) (and .cse21 .cse3 .cse28) (and .cse21 (and .cse5 (and .cse19 .cse2)) .cse3) (and (= ~a12~0 |old(~a12~0)|) (= ~a16~0 |old(~a16~0)|) (= (+ ~a18~0 87) 0) (= ~a15~0 |old(~a15~0)|)) (and .cse5 .cse28) (and .cse23 (<= ~a18~0 134) .cse21 .cse3 .cse25) (and .cse3 (and .cse0 (and .cse5 (and .cse26 .cse2)))) (not (<= |old(~a12~0)| 5)) (and .cse0 .cse15 .cse23 .cse3) (and .cse0 .cse29 .cse3 .cse20) (and .cse21 (and .cse13 .cse2 .cse14) .cse3) (= 4 |old(~a15~0)|) (= 10 |old(~a16~0)|) (and (and (<= 150 ~a18~0) .cse29) .cse3)))))))) [2019-09-07 21:24:35,860 INFO L443 ceAbstractionStarter]: For program point L1773-3(lines 1767 1783) no Hoare annotation was computed. [2019-09-07 21:24:35,872 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_911,QUANTIFIED] [2019-09-07 21:24:35,873 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_911,QUANTIFIED] [2019-09-07 21:24:35,874 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_911,QUANTIFIED] [2019-09-07 21:24:35,874 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_911,QUANTIFIED] [2019-09-07 21:24:35,889 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_911,QUANTIFIED] [2019-09-07 21:24:35,889 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_911,QUANTIFIED] [2019-09-07 21:24:35,889 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_911,QUANTIFIED] [2019-09-07 21:24:35,890 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_911,QUANTIFIED] [2019-09-07 21:24:35,897 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.09 09:24:35 BoogieIcfgContainer [2019-09-07 21:24:35,897 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-07 21:24:35,899 INFO L168 Benchmark]: Toolchain (without parser) took 283224.91 ms. Allocated memory was 130.5 MB in the beginning and 2.8 GB in the end (delta: 2.7 GB). Free memory was 80.5 MB in the beginning and 346.4 MB in the end (delta: -265.9 MB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. [2019-09-07 21:24:35,899 INFO L168 Benchmark]: CDTParser took 0.45 ms. Allocated memory is still 130.5 MB. Free memory is still 103.2 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-09-07 21:24:35,900 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1405.31 ms. Allocated memory was 130.5 MB in the beginning and 214.4 MB in the end (delta: 83.9 MB). Free memory was 80.5 MB in the beginning and 156.8 MB in the end (delta: -76.3 MB). Peak memory consumption was 37.9 MB. Max. memory is 7.1 GB. [2019-09-07 21:24:35,901 INFO L168 Benchmark]: Boogie Preprocessor took 190.12 ms. Allocated memory is still 214.4 MB. Free memory was 156.8 MB in the beginning and 146.6 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 7.1 GB. [2019-09-07 21:24:35,901 INFO L168 Benchmark]: RCFGBuilder took 2442.72 ms. Allocated memory was 214.4 MB in the beginning and 283.1 MB in the end (delta: 68.7 MB). Free memory was 146.6 MB in the beginning and 83.9 MB in the end (delta: 62.8 MB). Peak memory consumption was 131.5 MB. Max. memory is 7.1 GB. [2019-09-07 21:24:35,902 INFO L168 Benchmark]: TraceAbstraction took 279181.35 ms. Allocated memory was 283.1 MB in the beginning and 2.8 GB in the end (delta: 2.5 GB). Free memory was 83.9 MB in the beginning and 346.4 MB in the end (delta: -262.5 MB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. [2019-09-07 21:24:35,906 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.45 ms. Allocated memory is still 130.5 MB. Free memory is still 103.2 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1405.31 ms. Allocated memory was 130.5 MB in the beginning and 214.4 MB in the end (delta: 83.9 MB). Free memory was 80.5 MB in the beginning and 156.8 MB in the end (delta: -76.3 MB). Peak memory consumption was 37.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 190.12 ms. Allocated memory is still 214.4 MB. Free memory was 156.8 MB in the beginning and 146.6 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2442.72 ms. Allocated memory was 214.4 MB in the beginning and 283.1 MB in the end (delta: 68.7 MB). Free memory was 146.6 MB in the beginning and 83.9 MB in the end (delta: 62.8 MB). Peak memory consumption was 131.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 279181.35 ms. Allocated memory was 283.1 MB in the beginning and 2.8 GB in the end (delta: 2.5 GB). Free memory was 83.9 MB in the beginning and 346.4 MB in the end (delta: -262.5 MB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_911,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_911,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_911,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_911,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_911,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_911,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_911,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_911,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 118]: 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 [2019-09-07 21:24:35,915 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_911,QUANTIFIED] [2019-09-07 21:24:35,915 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_911,QUANTIFIED] [2019-09-07 21:24:35,916 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_911,QUANTIFIED] [2019-09-07 21:24:35,916 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_911,QUANTIFIED] [2019-09-07 21:24:35,919 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_911,QUANTIFIED] [2019-09-07 21:24:35,919 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_911,QUANTIFIED] [2019-09-07 21:24:35,920 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_911,QUANTIFIED] [2019-09-07 21:24:35,920 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_911,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((((((((((((((0 <= a18 + 600001 && !(12 == a16)) && 9 <= \old(a16)) && (5 == \old(a12) || 9 == \old(a12))) && a12 == 6) || ((a16 == 9 && a15 == 3) && (((!(a16 == 10) && !(12 == a16)) && !(4 == a15)) && a12 == 8) && 9 <= \old(a16))) || ((0 <= a18 + 600001 && (!(7 == a12) && !(a16 == 10) && ((!(a12 == 6) && !(12 == a16)) && !(a12 == 8)) && !(4 == a15)) && 9 <= \old(a16)) && (5 == \old(a12) || 9 == \old(a12)))) || (((a15 == 4 && 0 <= a18 + 600001) && ((a18 + 156 <= 0 && (!(a12 == 6) && !(12 == a16)) && !(a12 == 8)) && a12 <= 5) && 9 <= \old(a16)) && (5 == \old(a12) || 9 == \old(a12)))) || ((0 <= a18 + 600001 && (5 == \old(a12) || 9 == \old(a12))) && (((!(a12 == 6) && a16 == 12) && !(7 == a12)) && 9 <= \old(a16)) && !(4 == a15))) || ((((0 <= (a18 + -599175) / 3 + 155 && a12 == 5) && ((!(a12 == 6) && !(12 == a16)) && !(a12 == 8)) && 9 <= \old(a16)) && (5 == \old(a12) || 9 == \old(a12))) && a16 == 10)) || ((((a16 == 8 && a12 == 8) && 9 <= \old(a16)) && 0 <= a18 + 600001) && (5 == \old(a12) || 9 == \old(a12)))) || !(\old(a18) + 87 == 0)) || (((((((!(a12 == 6) && !(12 == a16)) && !(a12 == 8)) && 9 <= \old(a16)) && a16 == 9) && 0 <= a18 + 600001) && (((a15 == 3 && a12 == 8) && 134 < a18) || a18 + 79 <= 0)) && (5 == \old(a12) || 9 == \old(a12)))) || ((0 <= a18 + 155 && (5 == \old(a12) || 9 == \old(a12))) && (((!(a16 == 10) && !(12 == a16)) && !(4 == a15)) && a12 == 8) && 9 <= \old(a16))) || ((0 <= a18 + 155 && (5 == \old(a12) || 9 == \old(a12))) && (a12 <= 5 && ((!(a12 == 6) && !(12 == a16)) && !(a12 == 8)) && !(4 == a15)) && 9 <= \old(a16))) || ((a16 == 9 && (a12 <= 5 && ((!(a12 == 6) && !(12 == a16)) && !(a12 == 8)) && !(4 == a15)) && 9 <= \old(a16)) && a12 == 5)) || ((((0 <= a18 + 155 && ((!(a12 == 6) && !(12 == a16)) && !(a12 == 8)) && 9 <= \old(a16)) && a12 <= 6) && (5 == \old(a12) || 9 == \old(a12))) && (((a15 == 3 && a12 == 8) && 134 < a18) || a18 + 79 <= 0))) || 12 == \old(a16)) || ((((a16 == 8 && 9 <= \old(a16)) && (\exists v_~a18~0_911 : int :: ((5 <= 5 * (10 * v_~a18~0_911 / -5) && 0 <= 5 * (10 * v_~a18~0_911 / -5)) && v_~a18~0_911 + 79 <= 0) && 5 * (10 * v_~a18~0_911 / -5) / 5 <= a18)) && (5 == \old(a12) || 9 == \old(a12))) && a12 == 9)) || ((0 <= a18 + 600001 && (5 == \old(a12) || 9 == \old(a12))) && (a16 == 8 && a12 == 7) && 9 <= \old(a16))) || ((a16 == 8 && !(12 == a16) && !(4 == a15)) && 9 <= \old(a16))) || ((0 <= a18 + 155 && (5 == \old(a12) || 9 == \old(a12))) && (a12 == 7 && !(a16 == 10) && ((!(a12 == 6) && !(12 == a16)) && !(a12 == 8)) && !(4 == a15)) && 9 <= \old(a16))) || ((0 <= a18 + 155 && a16 == 9 && a12 == 8 && 9 <= \old(a16)) && (5 == \old(a12) || 9 == \old(a12)))) || (((a12 == \old(a12) && a16 == \old(a16)) && a18 + 87 == 0) && a15 == \old(a15))) || (a16 == 9 && (a12 == 7 && !(a16 == 10) && ((!(a12 == 6) && !(12 == a16)) && !(a12 == 8)) && !(4 == a15)) && 9 <= \old(a16))) || (((((a16 == 8 && 9 <= \old(a16)) && a18 <= 134) && 0 <= a18 + 155) && (5 == \old(a12) || 9 == \old(a12))) && a12 == 9)) || ((5 == \old(a12) || 9 == \old(a12)) && 0 <= a18 + 600001 && a16 == 9 && a12 == 7 && 9 <= \old(a16))) || !(\old(a12) <= 5)) || (((0 <= a18 + 600001 && a12 == 5) && a16 == 8 && 9 <= \old(a16)) && (5 == \old(a12) || 9 == \old(a12)))) || (((0 <= a18 + 600001 && ((!(12 == a16) && !(4 == a15)) && a12 == 8) && 9 <= \old(a16)) && (5 == \old(a12) || 9 == \old(a12))) && (((a15 == 3 && a12 == 8) && 134 < a18) || a18 + 79 <= 0))) || ((0 <= a18 + 155 && (a16 == 12 && 9 <= \old(a16)) && !(4 == a15)) && (5 == \old(a12) || 9 == \old(a12)))) || 4 == \old(a15)) || 10 == \old(a16)) || ((150 <= a18 && ((!(12 == a16) && !(4 == a15)) && a12 == 8) && 9 <= \old(a16)) && (5 == \old(a12) || 9 == \old(a12))) - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 409 locations, 1 error locations. SAFE Result, 279.0s OverallTime, 20 OverallIterations, 15 TraceHistogramMax, 148.2s AutomataDifference, 0.0s DeadEndRemovalTime, 38.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 1184 SDtfs, 51029 SDslu, 4260 SDs, 0 SdLazy, 113340 SolverSat, 11140 SolverUnsat, 3 SolverUnknown, 0 SolverNotchecked, 97.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 25204 GetRequests, 24610 SyntacticMatches, 18 SemanticMatches, 576 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 7538 ImplicationChecksByTransitivity, 30.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22237occurred in iteration=18, 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: 3.8s AutomataMinimizationTime, 20 MinimizatonAttempts, 12015 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 2178 PreInvPairs, 2409 NumberOfFragments, 4211 HoareAnnotationTreeSize, 2178 FomulaSimplifications, 4745595 FormulaSimplificationTreeSizeReduction, 4.9s HoareSimplificationTime, 9 FomulaSimplificationsInter, 3189508 FormulaSimplificationTreeSizeReductionInter, 33.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 1.4s SsaConstructionTime, 6.7s SatisfiabilityAnalysisTime, 37.6s InterpolantComputationTime, 49055 NumberOfCodeBlocks, 49055 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 49019 ConstructedInterpolants, 49 QuantifiedInterpolants, 282363932 SizeOfPredicates, 14 NumberOfNonLiveVariables, 31344 ConjunctsInSsa, 153 ConjunctsInUnsatCore, 36 InterpolantComputations, 7 PerfectInterpolantSequences, 163974/173698 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...