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/Problem14_label51.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 01:23:22,687 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 01:23:22,690 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 01:23:22,706 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 01:23:22,706 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 01:23:22,707 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 01:23:22,709 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 01:23:22,710 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 01:23:22,714 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 01:23:22,715 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 01:23:22,716 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 01:23:22,722 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 01:23:22,723 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 01:23:22,723 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 01:23:22,724 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 01:23:22,725 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 01:23:22,726 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 01:23:22,727 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 01:23:22,729 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 01:23:22,731 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 01:23:22,732 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 01:23:22,733 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 01:23:22,734 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 01:23:22,735 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 01:23:22,737 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 01:23:22,737 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 01:23:22,737 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 01:23:22,738 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 01:23:22,739 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 01:23:22,740 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 01:23:22,740 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 01:23:22,742 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 01:23:22,743 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 01:23:22,743 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 01:23:22,744 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 01:23:22,745 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 01:23:22,748 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 01:23:22,749 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 01:23:22,749 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 01:23:22,750 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 01:23:22,751 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 01:23:22,751 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-02 01:23:22,780 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 01:23:22,780 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 01:23:22,782 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 01:23:22,783 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 01:23:22,783 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 01:23:22,783 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 01:23:22,783 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 01:23:22,784 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 01:23:22,784 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 01:23:22,784 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 01:23:22,785 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 01:23:22,785 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 01:23:22,786 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 01:23:22,786 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 01:23:22,786 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 01:23:22,787 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 01:23:22,787 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 01:23:22,787 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 01:23:22,787 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 01:23:22,787 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 01:23:22,788 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 01:23:22,788 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 01:23:22,788 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 01:23:22,789 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 01:23:22,789 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 01:23:22,789 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 01:23:22,789 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 01:23:22,789 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 01:23:22,790 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 01:23:22,847 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 01:23:22,864 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 01:23:22,868 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 01:23:22,870 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 01:23:22,870 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 01:23:22,871 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem14_label51.c [2019-10-02 01:23:22,939 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c7c11ba60/37438c1230e1427588ad4fb6676209fe/FLAG0e1a07c35 [2019-10-02 01:23:23,562 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 01:23:23,562 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem14_label51.c [2019-10-02 01:23:23,590 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c7c11ba60/37438c1230e1427588ad4fb6676209fe/FLAG0e1a07c35 [2019-10-02 01:23:23,716 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c7c11ba60/37438c1230e1427588ad4fb6676209fe [2019-10-02 01:23:23,734 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 01:23:23,736 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 01:23:23,737 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 01:23:23,737 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 01:23:23,741 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 01:23:23,742 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 01:23:23" (1/1) ... [2019-10-02 01:23:23,745 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42d0e612 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:23:23, skipping insertion in model container [2019-10-02 01:23:23,746 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 01:23:23" (1/1) ... [2019-10-02 01:23:23,754 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 01:23:23,808 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 01:23:24,391 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 01:23:24,398 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 01:23:24,560 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 01:23:24,576 INFO L192 MainTranslator]: Completed translation [2019-10-02 01:23:24,577 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:23:24 WrapperNode [2019-10-02 01:23:24,577 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 01:23:24,578 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 01:23:24,578 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 01:23:24,578 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 01:23:24,588 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:23:24" (1/1) ... [2019-10-02 01:23:24,589 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:23:24" (1/1) ... [2019-10-02 01:23:24,612 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:23:24" (1/1) ... [2019-10-02 01:23:24,612 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:23:24" (1/1) ... [2019-10-02 01:23:24,659 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:23:24" (1/1) ... [2019-10-02 01:23:24,685 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:23:24" (1/1) ... [2019-10-02 01:23:24,698 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:23:24" (1/1) ... [2019-10-02 01:23:24,712 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 01:23:24,712 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 01:23:24,713 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 01:23:24,713 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 01:23:24,714 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:23:24" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 01:23:24,787 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 01:23:24,787 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 01:23:24,787 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-10-02 01:23:24,787 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 01:23:24,789 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-10-02 01:23:24,789 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 01:23:24,789 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 01:23:24,789 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-02 01:23:24,789 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 01:23:24,790 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 01:23:24,790 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 01:23:26,106 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 01:23:26,106 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-02 01:23:26,108 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 01:23:26 BoogieIcfgContainer [2019-10-02 01:23:26,108 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 01:23:26,110 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 01:23:26,111 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 01:23:26,114 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 01:23:26,115 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 01:23:23" (1/3) ... [2019-10-02 01:23:26,116 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f1db3d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 01:23:26, skipping insertion in model container [2019-10-02 01:23:26,116 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:23:24" (2/3) ... [2019-10-02 01:23:26,116 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f1db3d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 01:23:26, skipping insertion in model container [2019-10-02 01:23:26,116 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 01:23:26" (3/3) ... [2019-10-02 01:23:26,118 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem14_label51.c [2019-10-02 01:23:26,130 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 01:23:26,139 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 01:23:26,158 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 01:23:26,203 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 01:23:26,203 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 01:23:26,204 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 01:23:26,204 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 01:23:26,204 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 01:23:26,204 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 01:23:26,204 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 01:23:26,204 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 01:23:26,205 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 01:23:26,238 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states. [2019-10-02 01:23:26,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-10-02 01:23:26,249 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:23:26,250 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 01:23:26,252 INFO L418 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:23:26,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:23:26,257 INFO L82 PathProgramCache]: Analyzing trace with hash -1352567654, now seen corresponding path program 1 times [2019-10-02 01:23:26,259 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:23:26,259 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:23:26,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:23:26,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:23:26,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:23:26,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:23:26,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 01:23:26,568 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 01:23:26,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 01:23:26,573 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 01:23:26,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 01:23:26,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 01:23:26,591 INFO L87 Difference]: Start difference. First operand 254 states. Second operand 3 states. [2019-10-02 01:23:27,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:23:27,861 INFO L93 Difference]: Finished difference Result 688 states and 1223 transitions. [2019-10-02 01:23:27,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 01:23:27,863 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-10-02 01:23:27,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:23:27,895 INFO L225 Difference]: With dead ends: 688 [2019-10-02 01:23:27,895 INFO L226 Difference]: Without dead ends: 372 [2019-10-02 01:23:27,909 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 01:23:27,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2019-10-02 01:23:28,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 372. [2019-10-02 01:23:28,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2019-10-02 01:23:28,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 596 transitions. [2019-10-02 01:23:28,030 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 596 transitions. Word has length 41 [2019-10-02 01:23:28,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:23:28,031 INFO L475 AbstractCegarLoop]: Abstraction has 372 states and 596 transitions. [2019-10-02 01:23:28,031 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 01:23:28,031 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 596 transitions. [2019-10-02 01:23:28,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-10-02 01:23:28,038 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:23:28,038 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 01:23:28,039 INFO L418 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:23:28,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:23:28,039 INFO L82 PathProgramCache]: Analyzing trace with hash -1876604734, now seen corresponding path program 1 times [2019-10-02 01:23:28,039 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:23:28,040 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:23:28,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:23:28,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:23:28,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:23:28,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:23:28,207 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 01:23:28,208 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 01:23:28,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 01:23:28,210 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 01:23:28,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 01:23:28,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 01:23:28,211 INFO L87 Difference]: Start difference. First operand 372 states and 596 transitions. Second operand 5 states. [2019-10-02 01:23:29,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:23:29,620 INFO L93 Difference]: Finished difference Result 940 states and 1514 transitions. [2019-10-02 01:23:29,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 01:23:29,620 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 117 [2019-10-02 01:23:29,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:23:29,625 INFO L225 Difference]: With dead ends: 940 [2019-10-02 01:23:29,625 INFO L226 Difference]: Without dead ends: 574 [2019-10-02 01:23:29,627 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-10-02 01:23:29,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2019-10-02 01:23:29,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 564. [2019-10-02 01:23:29,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 564 states. [2019-10-02 01:23:29,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 831 transitions. [2019-10-02 01:23:29,689 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 831 transitions. Word has length 117 [2019-10-02 01:23:29,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:23:29,689 INFO L475 AbstractCegarLoop]: Abstraction has 564 states and 831 transitions. [2019-10-02 01:23:29,690 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 01:23:29,690 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 831 transitions. [2019-10-02 01:23:29,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-10-02 01:23:29,696 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:23:29,697 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 01:23:29,697 INFO L418 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:23:29,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:23:29,701 INFO L82 PathProgramCache]: Analyzing trace with hash 1520330050, now seen corresponding path program 1 times [2019-10-02 01:23:29,701 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:23:29,701 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:23:29,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:23:29,703 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:23:29,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:23:29,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:23:29,978 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 01:23:29,978 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 01:23:29,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 01:23:29,979 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 01:23:29,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 01:23:29,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-02 01:23:29,980 INFO L87 Difference]: Start difference. First operand 564 states and 831 transitions. Second operand 6 states. [2019-10-02 01:23:31,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:23:31,329 INFO L93 Difference]: Finished difference Result 1526 states and 2378 transitions. [2019-10-02 01:23:31,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 01:23:31,331 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 181 [2019-10-02 01:23:31,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:23:31,341 INFO L225 Difference]: With dead ends: 1526 [2019-10-02 01:23:31,341 INFO L226 Difference]: Without dead ends: 968 [2019-10-02 01:23:31,343 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-10-02 01:23:31,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 968 states. [2019-10-02 01:23:31,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 968 to 942. [2019-10-02 01:23:31,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 942 states. [2019-10-02 01:23:31,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 942 states to 942 states and 1352 transitions. [2019-10-02 01:23:31,389 INFO L78 Accepts]: Start accepts. Automaton has 942 states and 1352 transitions. Word has length 181 [2019-10-02 01:23:31,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:23:31,390 INFO L475 AbstractCegarLoop]: Abstraction has 942 states and 1352 transitions. [2019-10-02 01:23:31,390 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 01:23:31,390 INFO L276 IsEmpty]: Start isEmpty. Operand 942 states and 1352 transitions. [2019-10-02 01:23:31,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-10-02 01:23:31,393 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:23:31,394 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-02 01:23:31,394 INFO L418 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:23:31,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:23:31,395 INFO L82 PathProgramCache]: Analyzing trace with hash -906348779, now seen corresponding path program 1 times [2019-10-02 01:23:31,395 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:23:31,395 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:23:31,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:23:31,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:23:31,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:23:31,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:23:31,605 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 142 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 01:23:31,606 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:23:31,606 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 01:23:31,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:23:31,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:23:31,691 INFO L256 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 01:23:31,704 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:23:31,813 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 142 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Stream closed [2019-10-02 01:23:31,819 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 01:23:31,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-10-02 01:23:31,820 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 01:23:31,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 01:23:31,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-10-02 01:23:31,823 INFO L87 Difference]: Start difference. First operand 942 states and 1352 transitions. Second operand 9 states. [2019-10-02 01:23:37,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:23:37,257 INFO L93 Difference]: Finished difference Result 3896 states and 6183 transitions. [2019-10-02 01:23:37,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-10-02 01:23:37,259 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 200 [2019-10-02 01:23:37,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:23:37,295 INFO L225 Difference]: With dead ends: 3896 [2019-10-02 01:23:37,295 INFO L226 Difference]: Without dead ends: 2378 [2019-10-02 01:23:37,303 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 219 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 399 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=314, Invalid=1168, Unknown=0, NotChecked=0, Total=1482 [2019-10-02 01:23:37,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2378 states. [2019-10-02 01:23:37,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2378 to 2134. [2019-10-02 01:23:37,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2134 states. [2019-10-02 01:23:37,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2134 states to 2134 states and 3054 transitions. [2019-10-02 01:23:37,478 INFO L78 Accepts]: Start accepts. Automaton has 2134 states and 3054 transitions. Word has length 200 [2019-10-02 01:23:37,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:23:37,480 INFO L475 AbstractCegarLoop]: Abstraction has 2134 states and 3054 transitions. [2019-10-02 01:23:37,480 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 01:23:37,480 INFO L276 IsEmpty]: Start isEmpty. Operand 2134 states and 3054 transitions. [2019-10-02 01:23:37,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2019-10-02 01:23:37,491 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:23:37,491 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 01:23:37,492 INFO L418 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:23:37,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:23:37,492 INFO L82 PathProgramCache]: Analyzing trace with hash 311736925, now seen corresponding path program 1 times [2019-10-02 01:23:37,492 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:23:37,493 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:23:37,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:23:37,496 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:23:37,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:23:37,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:23:38,273 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 165 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 01:23:38,273 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:23:38,273 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 01:23:38,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:23:38,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:23:38,357 INFO L256 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 01:23:38,364 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:23:38,428 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2019-10-02 01:23:38,432 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 01:23:38,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [11] total 12 [2019-10-02 01:23:38,433 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-02 01:23:38,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-02 01:23:38,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2019-10-02 01:23:38,434 INFO L87 Difference]: Start difference. First operand 2134 states and 3054 transitions. Second operand 12 states. [2019-10-02 01:23:39,407 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 42 [2019-10-02 01:23:42,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:23:42,576 INFO L93 Difference]: Finished difference Result 5274 states and 7921 transitions. [2019-10-02 01:23:42,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-10-02 01:23:42,576 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 252 [2019-10-02 01:23:42,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:23:42,606 INFO L225 Difference]: With dead ends: 5274 [2019-10-02 01:23:42,606 INFO L226 Difference]: Without dead ends: 3146 [2019-10-02 01:23:42,621 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 266 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=236, Invalid=694, Unknown=0, NotChecked=0, Total=930 [2019-10-02 01:23:42,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3146 states. [2019-10-02 01:23:42,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3146 to 2734. [2019-10-02 01:23:42,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2734 states. [2019-10-02 01:23:42,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2734 states to 2734 states and 3823 transitions. [2019-10-02 01:23:42,820 INFO L78 Accepts]: Start accepts. Automaton has 2734 states and 3823 transitions. Word has length 252 [2019-10-02 01:23:42,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:23:42,821 INFO L475 AbstractCegarLoop]: Abstraction has 2734 states and 3823 transitions. [2019-10-02 01:23:42,821 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-02 01:23:42,821 INFO L276 IsEmpty]: Start isEmpty. Operand 2734 states and 3823 transitions. [2019-10-02 01:23:42,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2019-10-02 01:23:42,828 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:23:42,829 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-02 01:23:42,829 INFO L418 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:23:42,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:23:42,830 INFO L82 PathProgramCache]: Analyzing trace with hash 657294153, now seen corresponding path program 1 times [2019-10-02 01:23:42,830 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:23:42,830 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:23:42,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:23:42,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:23:42,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:23:42,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:23:43,030 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 140 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 01:23:43,030 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:23:43,031 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-10-02 01:23:43,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 01:23:43,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:23:43,123 INFO L256 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-02 01:23:43,128 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:23:43,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:23:43,282 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 138 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (4)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 01:23:43,286 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 01:23:43,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 10 [2019-10-02 01:23:43,288 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 01:23:43,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 01:23:43,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-10-02 01:23:43,289 INFO L87 Difference]: Start difference. First operand 2734 states and 3823 transitions. Second operand 10 states. [2019-10-02 01:23:50,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:23:50,356 INFO L93 Difference]: Finished difference Result 10208 states and 13813 transitions. [2019-10-02 01:23:50,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-10-02 01:23:50,356 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 258 [2019-10-02 01:23:50,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:23:50,390 INFO L225 Difference]: With dead ends: 10208 [2019-10-02 01:23:50,391 INFO L226 Difference]: Without dead ends: 7292 [2019-10-02 01:23:50,404 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 265 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 346 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=256, Invalid=1076, Unknown=0, NotChecked=0, Total=1332 [2019-10-02 01:23:50,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7292 states. [2019-10-02 01:23:50,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7292 to 6170. [2019-10-02 01:23:50,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6170 states. [2019-10-02 01:23:50,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6170 states to 6170 states and 7935 transitions. [2019-10-02 01:23:50,572 INFO L78 Accepts]: Start accepts. Automaton has 6170 states and 7935 transitions. Word has length 258 [2019-10-02 01:23:50,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:23:50,580 INFO L475 AbstractCegarLoop]: Abstraction has 6170 states and 7935 transitions. [2019-10-02 01:23:50,580 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-02 01:23:50,580 INFO L276 IsEmpty]: Start isEmpty. Operand 6170 states and 7935 transitions. [2019-10-02 01:23:50,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2019-10-02 01:23:50,588 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:23:50,589 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 01:23:50,589 INFO L418 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:23:50,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:23:50,590 INFO L82 PathProgramCache]: Analyzing trace with hash 1059997985, now seen corresponding path program 1 times [2019-10-02 01:23:50,590 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:23:50,590 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:23:50,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:23:50,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:23:50,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:23:50,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:23:51,292 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 188 proven. 190 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-02 01:23:51,292 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:23:51,292 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 01:23:51,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:23:51,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:23:51,402 INFO L256 TraceCheckSpWp]: Trace formula consists of 571 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 01:23:51,407 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:23:51,480 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 274 trivial. 0 not checked. [2019-10-02 01:23:51,484 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 01:23:51,485 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [12] total 13 [2019-10-02 01:23:51,486 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-02 01:23:51,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-02 01:23:51,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2019-10-02 01:23:51,487 INFO L87 Difference]: Start difference. First operand 6170 states and 7935 transitions. Second operand 13 states. [2019-10-02 01:23:54,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:23:54,639 INFO L93 Difference]: Finished difference Result 12241 states and 15806 transitions. [2019-10-02 01:23:54,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-02 01:23:54,640 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 350 [2019-10-02 01:23:54,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:23:54,666 INFO L225 Difference]: With dead ends: 12241 [2019-10-02 01:23:54,666 INFO L226 Difference]: Without dead ends: 6374 [2019-10-02 01:23:54,682 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 388 GetRequests, 363 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=163, Invalid=539, Unknown=0, NotChecked=0, Total=702 [2019-10-02 01:23:54,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6374 states. [2019-10-02 01:23:54,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6374 to 6154. [2019-10-02 01:23:54,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6154 states. [2019-10-02 01:23:54,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6154 states to 6154 states and 7096 transitions. [2019-10-02 01:23:54,821 INFO L78 Accepts]: Start accepts. Automaton has 6154 states and 7096 transitions. Word has length 350 [2019-10-02 01:23:54,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:23:54,821 INFO L475 AbstractCegarLoop]: Abstraction has 6154 states and 7096 transitions. [2019-10-02 01:23:54,822 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-02 01:23:54,822 INFO L276 IsEmpty]: Start isEmpty. Operand 6154 states and 7096 transitions. [2019-10-02 01:23:54,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 459 [2019-10-02 01:23:54,838 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:23:54,838 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2019-10-02 01:23:54,838 INFO L418 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:23:54,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:23:54,839 INFO L82 PathProgramCache]: Analyzing trace with hash -1301244307, now seen corresponding path program 1 times [2019-10-02 01:23:54,839 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:23:54,839 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:23:54,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:23:54,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:23:54,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:23:54,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:23:55,762 INFO L134 CoverageAnalysis]: Checked inductivity of 674 backedges. 328 proven. 243 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2019-10-02 01:23:55,762 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:23:55,762 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 01:23:55,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:23:55,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:23:55,899 INFO L256 TraceCheckSpWp]: Trace formula consists of 717 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 01:23:55,904 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:23:56,149 INFO L134 CoverageAnalysis]: Checked inductivity of 674 backedges. 423 proven. 2 refuted. 0 times theorem prover too weak. 249 trivial. 0 not checked. [2019-10-02 01:23:56,153 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 01:23:56,153 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 5] total 18 [2019-10-02 01:23:56,154 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-02 01:23:56,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-02 01:23:56,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2019-10-02 01:23:56,155 INFO L87 Difference]: Start difference. First operand 6154 states and 7096 transitions. Second operand 18 states. [2019-10-02 01:23:59,876 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 36 [2019-10-02 01:24:01,061 WARN L191 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 32 [2019-10-02 01:24:02,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:24:02,438 INFO L93 Difference]: Finished difference Result 13337 states and 15947 transitions. [2019-10-02 01:24:02,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-10-02 01:24:02,439 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 458 [2019-10-02 01:24:02,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:24:02,470 INFO L225 Difference]: With dead ends: 13337 [2019-10-02 01:24:02,471 INFO L226 Difference]: Without dead ends: 7237 [2019-10-02 01:24:02,489 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 551 GetRequests, 484 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1471 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=933, Invalid=3759, Unknown=0, NotChecked=0, Total=4692 [2019-10-02 01:24:02,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7237 states. [2019-10-02 01:24:02,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7237 to 6314. [2019-10-02 01:24:02,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6314 states. [2019-10-02 01:24:02,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6314 states to 6314 states and 6838 transitions. [2019-10-02 01:24:02,644 INFO L78 Accepts]: Start accepts. Automaton has 6314 states and 6838 transitions. Word has length 458 [2019-10-02 01:24:02,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:24:02,644 INFO L475 AbstractCegarLoop]: Abstraction has 6314 states and 6838 transitions. [2019-10-02 01:24:02,645 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-02 01:24:02,645 INFO L276 IsEmpty]: Start isEmpty. Operand 6314 states and 6838 transitions. [2019-10-02 01:24:02,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1003 [2019-10-02 01:24:02,694 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:24:02,695 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 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, 7, 7, 7, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 01:24:02,696 INFO L418 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:24:02,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:24:02,699 INFO L82 PathProgramCache]: Analyzing trace with hash -1552035379, now seen corresponding path program 1 times [2019-10-02 01:24:02,699 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:24:02,699 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:24:02,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:24:02,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:24:02,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:24:02,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:24:04,125 INFO L134 CoverageAnalysis]: Checked inductivity of 2749 backedges. 490 proven. 557 refuted. 0 times theorem prover too weak. 1702 trivial. 0 not checked. [2019-10-02 01:24:04,126 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:24:04,126 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 01:24:04,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:24:04,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:24:04,383 INFO L256 TraceCheckSpWp]: Trace formula consists of 1373 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-02 01:24:04,397 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:24:05,252 INFO L134 CoverageAnalysis]: Checked inductivity of 2749 backedges. 1757 proven. 2 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2019-10-02 01:24:05,265 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 01:24:05,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 7 [2019-10-02 01:24:05,268 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 01:24:05,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 01:24:05,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-02 01:24:05,269 INFO L87 Difference]: Start difference. First operand 6314 states and 6838 transitions. Second operand 7 states. [2019-10-02 01:24:06,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:24:06,620 INFO L93 Difference]: Finished difference Result 12620 states and 13680 transitions. [2019-10-02 01:24:06,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 01:24:06,621 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 1002 [2019-10-02 01:24:06,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:24:06,638 INFO L225 Difference]: With dead ends: 12620 [2019-10-02 01:24:06,638 INFO L226 Difference]: Without dead ends: 6310 [2019-10-02 01:24:06,653 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 1020 GetRequests, 1008 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-10-02 01:24:06,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6310 states. [2019-10-02 01:24:06,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6310 to 6126. [2019-10-02 01:24:06,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6126 states. [2019-10-02 01:24:06,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6126 states to 6126 states and 6520 transitions. [2019-10-02 01:24:06,781 INFO L78 Accepts]: Start accepts. Automaton has 6126 states and 6520 transitions. Word has length 1002 [2019-10-02 01:24:06,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:24:06,782 INFO L475 AbstractCegarLoop]: Abstraction has 6126 states and 6520 transitions. [2019-10-02 01:24:06,782 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 01:24:06,783 INFO L276 IsEmpty]: Start isEmpty. Operand 6126 states and 6520 transitions. [2019-10-02 01:24:06,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1103 [2019-10-02 01:24:06,877 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:24:06,877 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 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, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2019-10-02 01:24:06,878 INFO L418 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:24:06,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:24:06,878 INFO L82 PathProgramCache]: Analyzing trace with hash -874640935, now seen corresponding path program 1 times [2019-10-02 01:24:06,878 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:24:06,879 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:24:06,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:24:06,881 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:24:06,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:24:07,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:24:08,512 INFO L134 CoverageAnalysis]: Checked inductivity of 3569 backedges. 869 proven. 872 refuted. 0 times theorem prover too weak. 1828 trivial. 0 not checked. [2019-10-02 01:24:08,513 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:24:08,513 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 01:24:08,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:24:08,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:24:08,779 INFO L256 TraceCheckSpWp]: Trace formula consists of 1515 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-02 01:24:08,798 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:24:09,283 INFO L134 CoverageAnalysis]: Checked inductivity of 3569 backedges. 2447 proven. 2 refuted. 0 times theorem prover too weak. 1120 trivial. 0 not checked. [2019-10-02 01:24:09,288 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 01:24:09,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 5] total 14 [2019-10-02 01:24:09,290 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-02 01:24:09,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-02 01:24:09,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-10-02 01:24:09,291 INFO L87 Difference]: Start difference. First operand 6126 states and 6520 transitions. Second operand 14 states. [2019-10-02 01:24:15,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:24:15,207 INFO L93 Difference]: Finished difference Result 13556 states and 14468 transitions. [2019-10-02 01:24:15,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-10-02 01:24:15,207 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 1102 [2019-10-02 01:24:15,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:24:15,228 INFO L225 Difference]: With dead ends: 13556 [2019-10-02 01:24:15,228 INFO L226 Difference]: Without dead ends: 7620 [2019-10-02 01:24:15,241 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 1221 GetRequests, 1145 SyntacticMatches, 3 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1895 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1002, Invalid=4548, Unknown=0, NotChecked=0, Total=5550 [2019-10-02 01:24:15,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7620 states. [2019-10-02 01:24:15,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7620 to 6696. [2019-10-02 01:24:15,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6696 states. [2019-10-02 01:24:15,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6696 states to 6696 states and 7053 transitions. [2019-10-02 01:24:15,353 INFO L78 Accepts]: Start accepts. Automaton has 6696 states and 7053 transitions. Word has length 1102 [2019-10-02 01:24:15,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:24:15,355 INFO L475 AbstractCegarLoop]: Abstraction has 6696 states and 7053 transitions. [2019-10-02 01:24:15,355 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-02 01:24:15,355 INFO L276 IsEmpty]: Start isEmpty. Operand 6696 states and 7053 transitions. [2019-10-02 01:24:15,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1425 [2019-10-02 01:24:15,383 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:24:15,384 INFO L411 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, 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, 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, 9, 7, 7, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 01:24:15,384 INFO L418 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:24:15,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:24:15,385 INFO L82 PathProgramCache]: Analyzing trace with hash -530212887, now seen corresponding path program 1 times [2019-10-02 01:24:15,385 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:24:15,385 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:24:15,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:24:15,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:24:15,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:24:15,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:24:16,265 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2019-10-02 01:24:16,590 WARN L191 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 48 [2019-10-02 01:24:20,026 INFO L134 CoverageAnalysis]: Checked inductivity of 6358 backedges. 795 proven. 2484 refuted. 0 times theorem prover too weak. 3079 trivial. 0 not checked. [2019-10-02 01:24:20,027 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:24:20,027 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 01:24:20,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:24:20,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:24:20,372 INFO L256 TraceCheckSpWp]: Trace formula consists of 1944 conjuncts, 16 conjunts are in the unsatisfiable core [2019-10-02 01:24:20,382 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:24:20,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-10-02 01:24:22,076 INFO L134 CoverageAnalysis]: Checked inductivity of 6358 backedges. 3539 proven. 2 refuted. 0 times theorem prover too weak. 2817 trivial. 0 not checked. [2019-10-02 01:24:22,081 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 01:24:22,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 6] total 18 [2019-10-02 01:24:22,084 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-02 01:24:22,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-02 01:24:22,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2019-10-02 01:24:22,085 INFO L87 Difference]: Start difference. First operand 6696 states and 7053 transitions. Second operand 18 states. [2019-10-02 01:24:24,294 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 50 [2019-10-02 01:24:25,578 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 55 [2019-10-02 01:24:25,997 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 58 [2019-10-02 01:24:26,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:24:26,493 INFO L93 Difference]: Finished difference Result 14530 states and 15346 transitions. [2019-10-02 01:24:26,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-10-02 01:24:26,494 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 1424 [2019-10-02 01:24:26,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:24:26,519 INFO L225 Difference]: With dead ends: 14530 [2019-10-02 01:24:26,519 INFO L226 Difference]: Without dead ends: 7840 [2019-10-02 01:24:26,533 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 1470 GetRequests, 1434 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 277 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=303, Invalid=1103, Unknown=0, NotChecked=0, Total=1406 [2019-10-02 01:24:26,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7840 states. [2019-10-02 01:24:26,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7840 to 6514. [2019-10-02 01:24:26,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6514 states. [2019-10-02 01:24:26,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6514 states to 6514 states and 6863 transitions. [2019-10-02 01:24:26,662 INFO L78 Accepts]: Start accepts. Automaton has 6514 states and 6863 transitions. Word has length 1424 [2019-10-02 01:24:26,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:24:26,663 INFO L475 AbstractCegarLoop]: Abstraction has 6514 states and 6863 transitions. [2019-10-02 01:24:26,663 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-02 01:24:26,663 INFO L276 IsEmpty]: Start isEmpty. Operand 6514 states and 6863 transitions. [2019-10-02 01:24:26,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1577 [2019-10-02 01:24:26,693 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:24:26,694 INFO L411 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, 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, 12, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 8, 8, 7, 7, 7, 7, 7, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 01:24:26,695 INFO L418 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:24:26,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:24:26,695 INFO L82 PathProgramCache]: Analyzing trace with hash -448502155, now seen corresponding path program 1 times [2019-10-02 01:24:26,696 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:24:26,696 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:24:26,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:24:26,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:24:26,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:24:26,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:24:29,865 INFO L134 CoverageAnalysis]: Checked inductivity of 7480 backedges. 1512 proven. 1159 refuted. 0 times theorem prover too weak. 4809 trivial. 0 not checked. [2019-10-02 01:24:29,865 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:24:29,865 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 01:24:29,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:24:30,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:24:30,214 INFO L256 TraceCheckSpWp]: Trace formula consists of 2136 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-02 01:24:30,234 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:24:30,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:24:31,425 INFO L134 CoverageAnalysis]: Checked inductivity of 7480 backedges. 2705 proven. 2 refuted. 0 times theorem prover too weak. 4773 trivial. 0 not checked. [2019-10-02 01:24:31,430 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 01:24:31,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 5] total 17 [2019-10-02 01:24:31,432 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-02 01:24:31,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-02 01:24:31,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2019-10-02 01:24:31,433 INFO L87 Difference]: Start difference. First operand 6514 states and 6863 transitions. Second operand 17 states. [2019-10-02 01:24:36,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:24:36,364 INFO L93 Difference]: Finished difference Result 13586 states and 14297 transitions. [2019-10-02 01:24:36,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-10-02 01:24:36,367 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 1576 [2019-10-02 01:24:36,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:24:36,386 INFO L225 Difference]: With dead ends: 13586 [2019-10-02 01:24:36,387 INFO L226 Difference]: Without dead ends: 6894 [2019-10-02 01:24:36,399 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 1642 GetRequests, 1596 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 509 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=436, Invalid=1820, Unknown=0, NotChecked=0, Total=2256 [2019-10-02 01:24:36,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6894 states. [2019-10-02 01:24:36,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6894 to 6514. [2019-10-02 01:24:36,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6514 states. [2019-10-02 01:24:36,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6514 states to 6514 states and 6844 transitions. [2019-10-02 01:24:36,504 INFO L78 Accepts]: Start accepts. Automaton has 6514 states and 6844 transitions. Word has length 1576 [2019-10-02 01:24:36,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:24:36,505 INFO L475 AbstractCegarLoop]: Abstraction has 6514 states and 6844 transitions. [2019-10-02 01:24:36,505 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-02 01:24:36,505 INFO L276 IsEmpty]: Start isEmpty. Operand 6514 states and 6844 transitions. [2019-10-02 01:24:36,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1705 [2019-10-02 01:24:36,538 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:24:36,539 INFO L411 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, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 9, 9, 9, 8, 8, 8, 8, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 01:24:36,539 INFO L418 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:24:36,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:24:36,540 INFO L82 PathProgramCache]: Analyzing trace with hash -40396063, now seen corresponding path program 1 times [2019-10-02 01:24:36,540 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:24:36,540 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:24:36,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:24:36,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:24:36,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:24:36,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:24:38,663 INFO L134 CoverageAnalysis]: Checked inductivity of 8880 backedges. 4409 proven. 142 refuted. 0 times theorem prover too weak. 4329 trivial. 0 not checked. [2019-10-02 01:24:38,663 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:24:38,663 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 01:24:38,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:24:39,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:24:39,040 INFO L256 TraceCheckSpWp]: Trace formula consists of 2305 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-02 01:24:39,053 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:24:39,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:24:39,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:24:45,270 WARN L191 SmtUtils]: Spent 4.09 s on a formula simplification that was a NOOP. DAG size: 27 [2019-10-02 01:24:45,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 01:24:46,750 INFO L134 CoverageAnalysis]: Checked inductivity of 8880 backedges. 2902 proven. 68 refuted. 0 times theorem prover too weak. 5910 trivial. 0 not checked. [2019-10-02 01:24:46,755 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 01:24:46,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 16 [2019-10-02 01:24:46,757 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-10-02 01:24:46,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-10-02 01:24:46,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2019-10-02 01:24:46,758 INFO L87 Difference]: Start difference. First operand 6514 states and 6844 transitions. Second operand 16 states. [2019-10-02 01:25:03,573 WARN L191 SmtUtils]: Spent 4.05 s on a formula simplification that was a NOOP. DAG size: 33 [2019-10-02 01:25:32,931 WARN L191 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 30 DAG size of output: 18 [2019-10-02 01:25:51,812 WARN L191 SmtUtils]: Spent 2.05 s on a formula simplification that was a NOOP. DAG size: 30 [2019-10-02 01:26:08,787 WARN L191 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 32 DAG size of output: 20 [2019-10-02 01:26:15,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:26:15,315 INFO L93 Difference]: Finished difference Result 19498 states and 20720 transitions. [2019-10-02 01:26:15,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-10-02 01:26:15,316 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 1704 [2019-10-02 01:26:15,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:26:15,341 INFO L225 Difference]: With dead ends: 19498 [2019-10-02 01:26:15,341 INFO L226 Difference]: Without dead ends: 11494 [2019-10-02 01:26:15,353 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 1755 GetRequests, 1721 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 18.7s TimeCoverageRelationStatistics Valid=313, Invalid=877, Unknown=0, NotChecked=0, Total=1190 [2019-10-02 01:26:15,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11494 states. [2019-10-02 01:26:15,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11494 to 8180. [2019-10-02 01:26:15,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8180 states. [2019-10-02 01:26:15,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8180 states to 8180 states and 8454 transitions. [2019-10-02 01:26:15,513 INFO L78 Accepts]: Start accepts. Automaton has 8180 states and 8454 transitions. Word has length 1704 [2019-10-02 01:26:15,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:26:15,514 INFO L475 AbstractCegarLoop]: Abstraction has 8180 states and 8454 transitions. [2019-10-02 01:26:15,514 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-10-02 01:26:15,515 INFO L276 IsEmpty]: Start isEmpty. Operand 8180 states and 8454 transitions. [2019-10-02 01:26:15,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1805 [2019-10-02 01:26:15,552 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:26:15,553 INFO L411 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, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 9, 8, 7, 7, 7, 7, 7, 7, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 01:26:15,553 INFO L418 AbstractCegarLoop]: === Iteration 14 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:26:15,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:26:15,554 INFO L82 PathProgramCache]: Analyzing trace with hash -116424603, now seen corresponding path program 1 times [2019-10-02 01:26:15,554 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:26:15,554 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:26:15,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:26:15,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:26:15,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:26:15,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:26:17,689 INFO L134 CoverageAnalysis]: Checked inductivity of 9911 backedges. 1968 proven. 455 refuted. 0 times theorem prover too weak. 7488 trivial. 0 not checked. [2019-10-02 01:26:17,689 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:26:17,689 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 01:26:17,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:26:18,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:26:18,117 INFO L256 TraceCheckSpWp]: Trace formula consists of 2446 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 01:26:18,127 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:26:19,377 INFO L134 CoverageAnalysis]: Checked inductivity of 9911 backedges. 3983 proven. 2 refuted. 0 times theorem prover too weak. 5926 trivial. 0 not checked. [2019-10-02 01:26:19,383 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 01:26:19,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 11 [2019-10-02 01:26:19,386 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 01:26:19,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 01:26:19,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-10-02 01:26:19,387 INFO L87 Difference]: Start difference. First operand 8180 states and 8454 transitions. Second operand 11 states. [2019-10-02 01:26:22,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:26:22,414 INFO L93 Difference]: Finished difference Result 15258 states and 15737 transitions. [2019-10-02 01:26:22,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-10-02 01:26:22,414 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 1804 [2019-10-02 01:26:22,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:26:22,425 INFO L225 Difference]: With dead ends: 15258 [2019-10-02 01:26:22,425 INFO L226 Difference]: Without dead ends: 5186 [2019-10-02 01:26:22,434 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 1842 GetRequests, 1815 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=203, Invalid=553, Unknown=0, NotChecked=0, Total=756 [2019-10-02 01:26:22,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5186 states. [2019-10-02 01:26:22,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5186 to 4260. [2019-10-02 01:26:22,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4260 states. [2019-10-02 01:26:22,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4260 states to 4260 states and 4324 transitions. [2019-10-02 01:26:22,500 INFO L78 Accepts]: Start accepts. Automaton has 4260 states and 4324 transitions. Word has length 1804 [2019-10-02 01:26:22,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:26:22,502 INFO L475 AbstractCegarLoop]: Abstraction has 4260 states and 4324 transitions. [2019-10-02 01:26:22,502 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 01:26:22,502 INFO L276 IsEmpty]: Start isEmpty. Operand 4260 states and 4324 transitions. [2019-10-02 01:26:22,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1862 [2019-10-02 01:26:22,538 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:26:22,539 INFO L411 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 10, 10, 10, 10, 9, 8, 8, 8, 7, 7, 7, 7, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 01:26:22,539 INFO L418 AbstractCegarLoop]: === Iteration 15 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:26:22,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:26:22,540 INFO L82 PathProgramCache]: Analyzing trace with hash 1138456962, now seen corresponding path program 1 times [2019-10-02 01:26:22,540 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:26:22,540 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:26:22,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:26:22,542 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:26:22,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:26:22,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:26:27,033 INFO L134 CoverageAnalysis]: Checked inductivity of 11184 backedges. 1918 proven. 3255 refuted. 0 times theorem prover too weak. 6011 trivial. 0 not checked. [2019-10-02 01:26:27,033 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:26:27,034 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 01:26:27,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:26:27,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:26:27,498 INFO L256 TraceCheckSpWp]: Trace formula consists of 2537 conjuncts, 13 conjunts are in the unsatisfiable core [2019-10-02 01:26:27,509 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:26:29,470 INFO L134 CoverageAnalysis]: Checked inductivity of 11184 backedges. 5138 proven. 6 refuted. 0 times theorem prover too weak. 6040 trivial. 0 not checked. [2019-10-02 01:26:29,475 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 01:26:29,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 5] total 16 [2019-10-02 01:26:29,477 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-10-02 01:26:29,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-10-02 01:26:29,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2019-10-02 01:26:29,478 INFO L87 Difference]: Start difference. First operand 4260 states and 4324 transitions. Second operand 16 states. [2019-10-02 01:26:33,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:26:33,882 INFO L93 Difference]: Finished difference Result 5671 states and 5800 transitions. [2019-10-02 01:26:33,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-10-02 01:26:33,882 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 1861 [2019-10-02 01:26:33,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:26:33,889 INFO L225 Difference]: With dead ends: 5671 [2019-10-02 01:26:33,889 INFO L226 Difference]: Without dead ends: 4125 [2019-10-02 01:26:33,896 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 1931 GetRequests, 1892 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 374 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=357, Invalid=1283, Unknown=0, NotChecked=0, Total=1640 [2019-10-02 01:26:33,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4125 states. [2019-10-02 01:26:33,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4125 to 4070. [2019-10-02 01:26:33,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4070 states. [2019-10-02 01:26:33,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4070 states to 4070 states and 4120 transitions. [2019-10-02 01:26:33,952 INFO L78 Accepts]: Start accepts. Automaton has 4070 states and 4120 transitions. Word has length 1861 [2019-10-02 01:26:33,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:26:33,954 INFO L475 AbstractCegarLoop]: Abstraction has 4070 states and 4120 transitions. [2019-10-02 01:26:33,954 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-10-02 01:26:33,954 INFO L276 IsEmpty]: Start isEmpty. Operand 4070 states and 4120 transitions. [2019-10-02 01:26:33,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1880 [2019-10-02 01:26:33,989 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:26:33,991 INFO L411 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 10, 9, 9, 9, 8, 8, 8, 8, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 01:26:33,991 INFO L418 AbstractCegarLoop]: === Iteration 16 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:26:33,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:26:33,992 INFO L82 PathProgramCache]: Analyzing trace with hash -541323542, now seen corresponding path program 1 times [2019-10-02 01:26:33,992 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:26:33,992 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:26:33,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:26:33,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:26:33,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:26:34,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:26:35,963 INFO L134 CoverageAnalysis]: Checked inductivity of 11325 backedges. 2816 proven. 68 refuted. 0 times theorem prover too weak. 8441 trivial. 0 not checked. [2019-10-02 01:26:35,963 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:26:35,964 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 01:26:35,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:26:36,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:26:36,385 INFO L256 TraceCheckSpWp]: Trace formula consists of 2555 conjuncts, 16 conjunts are in the unsatisfiable core [2019-10-02 01:26:36,395 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:26:36,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:26:36,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:26:40,907 WARN L191 SmtUtils]: Spent 2.08 s on a formula simplification. DAG size of input: 24 DAG size of output: 13 [2019-10-02 01:26:40,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:26:40,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:26:40,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:26:40,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:26:40,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:26:40,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:26:40,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:26:40,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:27:07,469 WARN L191 SmtUtils]: Spent 24.35 s on a formula simplification. DAG size of input: 61 DAG size of output: 55 [2019-10-02 01:27:09,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-10-02 01:27:11,926 WARN L191 SmtUtils]: Spent 2.15 s on a formula simplification. DAG size of input: 112 DAG size of output: 32 [2019-10-02 01:27:13,884 INFO L134 CoverageAnalysis]: Checked inductivity of 11325 backedges. 4828 proven. 512 refuted. 0 times theorem prover too weak. 5985 trivial. 0 not checked. [2019-10-02 01:27:13,889 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 01:27:13,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11] total 15 [2019-10-02 01:27:13,891 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-02 01:27:13,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-02 01:27:13,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=165, Unknown=3, NotChecked=0, Total=210 [2019-10-02 01:27:13,892 INFO L87 Difference]: Start difference. First operand 4070 states and 4120 transitions. Second operand 15 states. [2019-10-02 01:27:56,875 WARN L191 SmtUtils]: Spent 41.02 s on a formula simplification. DAG size of input: 80 DAG size of output: 73 [2019-10-02 01:28:16,919 WARN L191 SmtUtils]: Spent 1.21 s on a formula simplification that was a NOOP. DAG size: 16 [2019-10-02 01:28:53,504 WARN L191 SmtUtils]: Spent 26.41 s on a formula simplification that was a NOOP. DAG size: 57 [2019-10-02 01:28:56,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:28:56,767 INFO L93 Difference]: Finished difference Result 5366 states and 5447 transitions. [2019-10-02 01:28:56,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-10-02 01:28:56,767 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 1879 [2019-10-02 01:28:56,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:28:56,775 INFO L225 Difference]: With dead ends: 5366 [2019-10-02 01:28:56,775 INFO L226 Difference]: Without dead ends: 5180 [2019-10-02 01:28:56,777 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 1917 GetRequests, 1884 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 250 ImplicationChecksByTransitivity, 108.4s TimeCoverageRelationStatistics Valid=203, Invalid=845, Unknown=8, NotChecked=0, Total=1056 [2019-10-02 01:28:56,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5180 states. [2019-10-02 01:28:56,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5180 to 4072. [2019-10-02 01:28:56,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4072 states. [2019-10-02 01:28:56,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4072 states to 4072 states and 4121 transitions. [2019-10-02 01:28:56,837 INFO L78 Accepts]: Start accepts. Automaton has 4072 states and 4121 transitions. Word has length 1879 [2019-10-02 01:28:56,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:28:56,838 INFO L475 AbstractCegarLoop]: Abstraction has 4072 states and 4121 transitions. [2019-10-02 01:28:56,838 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-02 01:28:56,838 INFO L276 IsEmpty]: Start isEmpty. Operand 4072 states and 4121 transitions. [2019-10-02 01:28:56,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2065 [2019-10-02 01:28:56,880 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:28:56,881 INFO L411 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 11, 10, 10, 10, 9, 9, 9, 9, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 01:28:56,881 INFO L418 AbstractCegarLoop]: === Iteration 17 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:28:56,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:28:56,882 INFO L82 PathProgramCache]: Analyzing trace with hash 1511618629, now seen corresponding path program 1 times [2019-10-02 01:28:56,882 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:28:56,882 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:28:56,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:28:56,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:28:56,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:28:57,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:29:03,092 INFO L134 CoverageAnalysis]: Checked inductivity of 13222 backedges. 5257 proven. 4790 refuted. 0 times theorem prover too weak. 3175 trivial. 0 not checked. [2019-10-02 01:29:03,093 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:29:03,093 INFO L224 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-10-02 01:29:03,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:29:03,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:29:03,557 INFO L256 TraceCheckSpWp]: Trace formula consists of 2776 conjuncts, 14 conjunts are in the unsatisfiable core [2019-10-02 01:29:03,572 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:29:03,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 01:29:03,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:29:03,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 01:29:03,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 01:29:03,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:29:03,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 01:29:03,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 01:29:06,500 INFO L134 CoverageAnalysis]: Checked inductivity of 13222 backedges. 5834 proven. 2 refuted. 0 times theorem prover too weak. 7386 trivial. 0 not checked. [2019-10-02 01:29:06,508 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 01:29:06,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 6] total 19 [2019-10-02 01:29:06,511 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-02 01:29:06,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-02 01:29:06,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2019-10-02 01:29:06,512 INFO L87 Difference]: Start difference. First operand 4072 states and 4121 transitions. Second operand 19 states. [2019-10-02 01:29:07,556 WARN L191 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 44 [2019-10-02 01:29:08,246 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 47 [2019-10-02 01:29:09,185 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 42 [2019-10-02 01:29:09,610 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 40 [2019-10-02 01:29:11,364 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 45 [2019-10-02 01:29:12,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:29:12,088 INFO L93 Difference]: Finished difference Result 5408 states and 5504 transitions. [2019-10-02 01:29:12,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-10-02 01:29:12,089 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 2064 [2019-10-02 01:29:12,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:29:12,095 INFO L225 Difference]: With dead ends: 5408 [2019-10-02 01:29:12,095 INFO L226 Difference]: Without dead ends: 3736 [2019-10-02 01:29:12,098 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 2136 GetRequests, 2091 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 500 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=439, Invalid=1723, Unknown=0, NotChecked=0, Total=2162 [2019-10-02 01:29:12,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3736 states. [2019-10-02 01:29:12,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3736 to 3702. [2019-10-02 01:29:12,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3702 states. [2019-10-02 01:29:12,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3702 states to 3702 states and 3740 transitions. [2019-10-02 01:29:12,146 INFO L78 Accepts]: Start accepts. Automaton has 3702 states and 3740 transitions. Word has length 2064 [2019-10-02 01:29:12,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:29:12,147 INFO L475 AbstractCegarLoop]: Abstraction has 3702 states and 3740 transitions. [2019-10-02 01:29:12,147 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-02 01:29:12,147 INFO L276 IsEmpty]: Start isEmpty. Operand 3702 states and 3740 transitions. [2019-10-02 01:29:12,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2190 [2019-10-02 01:29:12,189 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:29:12,190 INFO L411 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 12, 11, 11, 11, 10, 10, 10, 10, 9, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 01:29:12,190 INFO L418 AbstractCegarLoop]: === Iteration 18 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:29:12,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:29:12,191 INFO L82 PathProgramCache]: Analyzing trace with hash 311583382, now seen corresponding path program 1 times [2019-10-02 01:29:12,191 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:29:12,191 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:29:12,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:29:12,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:29:12,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:29:12,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:29:15,085 INFO L134 CoverageAnalysis]: Checked inductivity of 15039 backedges. 3258 proven. 68 refuted. 0 times theorem prover too weak. 11713 trivial. 0 not checked. [2019-10-02 01:29:15,085 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:29:15,085 INFO L224 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-10-02 01:29:15,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:29:15,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:29:15,584 INFO L256 TraceCheckSpWp]: Trace formula consists of 2938 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-02 01:29:15,595 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:29:15,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:29:15,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:29:18,517 WARN L191 SmtUtils]: Spent 1.44 s on a formula simplification. DAG size of input: 24 DAG size of output: 13 [2019-10-02 01:29:18,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:29:18,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:29:18,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:29:18,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:29:18,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:29:18,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:29:18,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:29:18,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:29:43,234 WARN L191 SmtUtils]: Spent 24.40 s on a formula simplification. DAG size of input: 61 DAG size of output: 55 [2019-10-02 01:29:43,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-10-02 01:29:45,884 INFO L134 CoverageAnalysis]: Checked inductivity of 15039 backedges. 4660 proven. 289 refuted. 0 times theorem prover too weak. 10090 trivial. 0 not checked. [2019-10-02 01:29:45,889 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 01:29:45,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 13 [2019-10-02 01:29:45,891 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-02 01:29:45,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-02 01:29:45,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=119, Unknown=1, NotChecked=0, Total=156 [2019-10-02 01:29:45,892 INFO L87 Difference]: Start difference. First operand 3702 states and 3740 transitions. Second operand 13 states. [2019-10-02 01:29:51,304 WARN L838 $PredicateComparison]: unable to prove that (and (<= c_~a12~0 |c_old(~a12~0)|) (exists ((v_prenex_20 Int)) (let ((.cse1 (div (+ v_prenex_20 (- 600066)) 5))) (let ((.cse0 (+ (* 34 .cse1) 34))) (and (<= c_~a12~0 (+ (div .cse0 10) 1)) (< .cse0 0) (<= v_prenex_20 599999) (not (= (mod (+ v_prenex_20 4) 5) 0)) (not (= 0 (mod (+ (* 4 .cse1) 4) 10))) (< v_prenex_20 600066))))) (or (exists ((v_~a12~0_455 Int)) (let ((.cse2 (* 34 (div (+ v_~a12~0_455 (- 600066)) 5)))) (and (<= v_~a12~0_455 |c_old(~a12~0)|) (<= 600066 v_~a12~0_455) (<= 0 .cse2) (<= c_~a12~0 (div .cse2 10))))) (exists ((v_~a12~0_455 Int)) (let ((.cse3 (div (+ v_~a12~0_455 (- 600066)) 5))) (and (<= v_~a12~0_455 |c_old(~a12~0)|) (= 0 (mod (* 4 .cse3) 10)) (= (mod (+ v_~a12~0_455 4) 5) 0) (<= c_~a12~0 (div (* 34 .cse3) 10))))) (exists ((v_~a12~0_455 Int)) (let ((.cse5 (div (+ v_~a12~0_455 (- 600066)) 5))) (let ((.cse4 (* 34 .cse5))) (and (<= c_~a12~0 (+ (div .cse4 10) 1)) (< .cse4 0) (<= v_~a12~0_455 |c_old(~a12~0)|) (not (= 0 (mod (* 4 .cse5) 10))) (= (mod (+ v_~a12~0_455 4) 5) 0))))) (exists ((v_~a12~0_455 Int)) (let ((.cse7 (div (+ v_~a12~0_455 (- 600066)) 5))) (let ((.cse6 (+ (* 34 .cse7) 34))) (and (< v_~a12~0_455 600066) (< .cse6 0) (not (= 0 (mod (+ (* 4 .cse7) 4) 10))) (<= v_~a12~0_455 |c_old(~a12~0)|) (<= c_~a12~0 (+ (div .cse6 10) 1)) (not (= (mod (+ v_~a12~0_455 4) 5) 0)))))) (exists ((v_~a12~0_455 Int)) (let ((.cse8 (div (+ v_~a12~0_455 (- 600066)) 5))) (and (< v_~a12~0_455 600066) (<= v_~a12~0_455 |c_old(~a12~0)|) (<= c_~a12~0 (div (+ (* 34 .cse8) 34) 10)) (= 0 (mod (+ (* 4 .cse8) 4) 10)) (not (= (mod (+ v_~a12~0_455 4) 5) 0))))) (exists ((v_~a12~0_455 Int)) (let ((.cse9 (+ (* 34 (div (+ v_~a12~0_455 (- 600066)) 5)) 34))) (and (< v_~a12~0_455 600066) (<= 0 .cse9) (<= v_~a12~0_455 |c_old(~a12~0)|) (<= c_~a12~0 (div .cse9 10)) (not (= (mod (+ v_~a12~0_455 4) 5) 0))))))) is different from false [2019-10-02 01:30:17,681 WARN L191 SmtUtils]: Spent 26.34 s on a formula simplification that was a NOOP. DAG size: 67 [2019-10-02 01:30:36,068 WARN L191 SmtUtils]: Spent 1.98 s on a formula simplification that was a NOOP. DAG size: 16 [2019-10-02 01:30:43,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:30:43,769 INFO L93 Difference]: Finished difference Result 3704 states and 3742 transitions. [2019-10-02 01:30:43,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-02 01:30:43,769 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 2189 [2019-10-02 01:30:43,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:30:43,772 INFO L225 Difference]: With dead ends: 3704 [2019-10-02 01:30:43,772 INFO L226 Difference]: Without dead ends: 0 [2019-10-02 01:30:43,775 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 2218 GetRequests, 2193 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 61.5s TimeCoverageRelationStatistics Valid=131, Invalid=421, Unknown=4, NotChecked=44, Total=600 [2019-10-02 01:30:43,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-02 01:30:43,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-02 01:30:43,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-02 01:30:43,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-02 01:30:43,776 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 2189 [2019-10-02 01:30:43,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:30:43,776 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-02 01:30:43,776 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-02 01:30:43,776 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-02 01:30:43,776 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-02 01:30:43,780 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-02 01:30:45,500 WARN L191 SmtUtils]: Spent 1.13 s on a formula simplification. DAG size of input: 655 DAG size of output: 576 [2019-10-02 01:30:46,257 WARN L191 SmtUtils]: Spent 754.00 ms on a formula simplification. DAG size of input: 655 DAG size of output: 576 [2019-10-02 01:30:46,417 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 28 [2019-10-02 01:30:57,577 WARN L191 SmtUtils]: Spent 11.14 s on a formula simplification. DAG size of input: 632 DAG size of output: 235 [2019-10-02 01:31:05,130 WARN L191 SmtUtils]: Spent 7.53 s on a formula simplification. DAG size of input: 561 DAG size of output: 202 [2019-10-02 01:31:13,029 WARN L191 SmtUtils]: Spent 7.89 s on a formula simplification. DAG size of input: 561 DAG size of output: 202 [2019-10-02 01:31:13,032 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2019-10-02 01:31:13,032 INFO L439 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~a12~0 |old(~a12~0)|) (= ~a24~0 |old(~a24~0)|) (= ~a21~0 |old(~a21~0)|) (= ~a15~0 |old(~a15~0)|)) [2019-10-02 01:31:13,032 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-02 01:31:13,032 INFO L443 ceAbstractionStarter]: For program point L432(lines 432 870) no Hoare annotation was computed. [2019-10-02 01:31:13,033 INFO L443 ceAbstractionStarter]: For program point L366(lines 366 870) no Hoare annotation was computed. [2019-10-02 01:31:13,033 INFO L443 ceAbstractionStarter]: For program point L168-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:31:13,033 INFO L443 ceAbstractionStarter]: For program point L102-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:31:13,033 INFO L443 ceAbstractionStarter]: For program point L36-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:31:13,033 INFO L443 ceAbstractionStarter]: For program point L235(lines 235 870) no Hoare annotation was computed. [2019-10-02 01:31:13,033 INFO L443 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2019-10-02 01:31:13,033 INFO L443 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2019-10-02 01:31:13,033 INFO L443 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2019-10-02 01:31:13,033 INFO L443 ceAbstractionStarter]: For program point L764(lines 764 870) no Hoare annotation was computed. [2019-10-02 01:31:13,033 INFO L443 ceAbstractionStarter]: For program point L632(lines 632 870) no Hoare annotation was computed. [2019-10-02 01:31:13,034 INFO L443 ceAbstractionStarter]: For program point L500(lines 500 870) no Hoare annotation was computed. [2019-10-02 01:31:13,034 INFO L443 ceAbstractionStarter]: For program point L831(lines 831 870) no Hoare annotation was computed. [2019-10-02 01:31:13,034 INFO L443 ceAbstractionStarter]: For program point L171-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:31:13,034 INFO L443 ceAbstractionStarter]: For program point L105-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:31:13,034 INFO L443 ceAbstractionStarter]: For program point L39-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:31:13,034 INFO L443 ceAbstractionStarter]: For program point L700(lines 700 870) no Hoare annotation was computed. [2019-10-02 01:31:13,034 INFO L443 ceAbstractionStarter]: For program point L568(lines 568 870) no Hoare annotation was computed. [2019-10-02 01:31:13,034 INFO L443 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2019-10-02 01:31:13,035 INFO L443 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2019-10-02 01:31:13,035 INFO L443 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2019-10-02 01:31:13,035 INFO L443 ceAbstractionStarter]: For program point L305(lines 305 870) no Hoare annotation was computed. [2019-10-02 01:31:13,035 INFO L443 ceAbstractionStarter]: For program point L438(lines 438 870) no Hoare annotation was computed. [2019-10-02 01:31:13,035 INFO L443 ceAbstractionStarter]: For program point L372(lines 372 870) no Hoare annotation was computed. [2019-10-02 01:31:13,035 INFO L443 ceAbstractionStarter]: For program point L174-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:31:13,035 INFO L443 ceAbstractionStarter]: For program point L108-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:31:13,035 INFO L443 ceAbstractionStarter]: For program point L42-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:31:13,035 INFO L443 ceAbstractionStarter]: For program point L241(lines 241 870) no Hoare annotation was computed. [2019-10-02 01:31:13,036 INFO L443 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2019-10-02 01:31:13,036 INFO L443 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2019-10-02 01:31:13,036 INFO L443 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2019-10-02 01:31:13,036 INFO L443 ceAbstractionStarter]: For program point L638(lines 638 870) no Hoare annotation was computed. [2019-10-02 01:31:13,036 INFO L443 ceAbstractionStarter]: For program point L506(lines 506 870) no Hoare annotation was computed. [2019-10-02 01:31:13,036 INFO L443 ceAbstractionStarter]: For program point L837(lines 837 870) no Hoare annotation was computed. [2019-10-02 01:31:13,036 INFO L443 ceAbstractionStarter]: For program point L771(lines 771 870) no Hoare annotation was computed. [2019-10-02 01:31:13,036 INFO L443 ceAbstractionStarter]: For program point L573(lines 573 870) no Hoare annotation was computed. [2019-10-02 01:31:13,036 INFO L443 ceAbstractionStarter]: For program point L177-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:31:13,037 INFO L443 ceAbstractionStarter]: For program point L111-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:31:13,037 INFO L443 ceAbstractionStarter]: For program point L45-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:31:13,037 INFO L443 ceAbstractionStarter]: For program point L706(lines 706 870) no Hoare annotation was computed. [2019-10-02 01:31:13,037 INFO L443 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2019-10-02 01:31:13,037 INFO L443 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2019-10-02 01:31:13,037 INFO L443 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2019-10-02 01:31:13,037 INFO L443 ceAbstractionStarter]: For program point L311(lines 311 870) no Hoare annotation was computed. [2019-10-02 01:31:13,037 INFO L443 ceAbstractionStarter]: For program point L444(lines 444 870) no Hoare annotation was computed. [2019-10-02 01:31:13,038 INFO L443 ceAbstractionStarter]: For program point L378(lines 378 870) no Hoare annotation was computed. [2019-10-02 01:31:13,038 INFO L443 ceAbstractionStarter]: For program point L180-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:31:13,038 INFO L443 ceAbstractionStarter]: For program point L114-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:31:13,038 INFO L443 ceAbstractionStarter]: For program point L48-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:31:13,038 INFO L443 ceAbstractionStarter]: For program point L247(lines 247 870) no Hoare annotation was computed. [2019-10-02 01:31:13,038 INFO L443 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2019-10-02 01:31:13,038 INFO L443 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2019-10-02 01:31:13,038 INFO L443 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2019-10-02 01:31:13,038 INFO L443 ceAbstractionStarter]: For program point L842(lines 842 870) no Hoare annotation was computed. [2019-10-02 01:31:13,038 INFO L443 ceAbstractionStarter]: For program point L644(lines 644 870) no Hoare annotation was computed. [2019-10-02 01:31:13,039 INFO L443 ceAbstractionStarter]: For program point L512(lines 512 870) no Hoare annotation was computed. [2019-10-02 01:31:13,039 INFO L443 ceAbstractionStarter]: For program point L777(lines 777 870) no Hoare annotation was computed. [2019-10-02 01:31:13,039 INFO L443 ceAbstractionStarter]: For program point L579(lines 579 870) no Hoare annotation was computed. [2019-10-02 01:31:13,039 INFO L443 ceAbstractionStarter]: For program point L183-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:31:13,039 INFO L443 ceAbstractionStarter]: For program point L117-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:31:13,039 INFO L443 ceAbstractionStarter]: For program point L51-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:31:13,039 INFO L443 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:31:13,039 INFO L443 ceAbstractionStarter]: For program point L712(lines 712 870) no Hoare annotation was computed. [2019-10-02 01:31:13,039 INFO L443 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2019-10-02 01:31:13,040 INFO L443 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2019-10-02 01:31:13,040 INFO L443 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2019-10-02 01:31:13,040 INFO L443 ceAbstractionStarter]: For program point L449(lines 449 870) no Hoare annotation was computed. [2019-10-02 01:31:13,040 INFO L443 ceAbstractionStarter]: For program point L317(lines 317 870) no Hoare annotation was computed. [2019-10-02 01:31:13,040 INFO L443 ceAbstractionStarter]: For program point L384(lines 384 870) no Hoare annotation was computed. [2019-10-02 01:31:13,040 INFO L443 ceAbstractionStarter]: For program point L252(lines 252 870) no Hoare annotation was computed. [2019-10-02 01:31:13,040 INFO L443 ceAbstractionStarter]: For program point L186-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:31:13,040 INFO L443 ceAbstractionStarter]: For program point L120-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:31:13,040 INFO L443 ceAbstractionStarter]: For program point L54-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:31:13,040 INFO L443 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2019-10-02 01:31:13,041 INFO L443 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2019-10-02 01:31:13,041 INFO L443 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2019-10-02 01:31:13,041 INFO L443 ceAbstractionStarter]: For program point L848(lines 848 870) no Hoare annotation was computed. [2019-10-02 01:31:13,041 INFO L443 ceAbstractionStarter]: For program point L650(lines 650 870) no Hoare annotation was computed. [2019-10-02 01:31:13,041 INFO L443 ceAbstractionStarter]: For program point L518(lines 518 870) no Hoare annotation was computed. [2019-10-02 01:31:13,041 INFO L443 ceAbstractionStarter]: For program point L783(lines 783 870) no Hoare annotation was computed. [2019-10-02 01:31:13,041 INFO L443 ceAbstractionStarter]: For program point L585(lines 585 870) no Hoare annotation was computed. [2019-10-02 01:31:13,041 INFO L443 ceAbstractionStarter]: For program point L189-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:31:13,041 INFO L443 ceAbstractionStarter]: For program point L123-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:31:13,041 INFO L443 ceAbstractionStarter]: For program point L57-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:31:13,042 INFO L443 ceAbstractionStarter]: For program point L718(lines 718 870) no Hoare annotation was computed. [2019-10-02 01:31:13,042 INFO L443 ceAbstractionStarter]: For program point L454(lines 454 870) no Hoare annotation was computed. [2019-10-02 01:31:13,042 INFO L443 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2019-10-02 01:31:13,042 INFO L443 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2019-10-02 01:31:13,042 INFO L443 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2019-10-02 01:31:13,042 INFO L443 ceAbstractionStarter]: For program point L323(lines 323 870) no Hoare annotation was computed. [2019-10-02 01:31:13,043 INFO L439 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 20 872) the Hoare annotation is: (let ((.cse39 (= 10 |old(~a21~0)|)) (.cse20 (= ~a12~0 |old(~a12~0)|)) (.cse32 (= ~a24~0 |old(~a24~0)|))) (let ((.cse22 (= ~a15~0 9)) (.cse13 (not (<= |old(~a21~0)| 7))) (.cse16 (not (<= |old(~a15~0)| 5))) (.cse27 (not (<= |old(~a12~0)| 228293))) (.cse33 (not (<= 10 |old(~a21~0)|))) (.cse36 (and .cse20 .cse32)) (.cse8 (= ~a21~0 |old(~a21~0)|)) (.cse9 (= ~a15~0 |old(~a15~0)|)) (.cse37 (not .cse39)) (.cse21 (= ~a24~0 1)) (.cse25 (= 10 |old(~a15~0)|)) (.cse30 (= 8 |old(~a21~0)|)) (.cse41 (= 9 |old(~a15~0)|)) (.cse40 (= 6 |old(~a21~0)|)) (.cse4 (not (= 1 |old(~a24~0)|))) (.cse14 (not (= 8 |old(~a15~0)|)))) (let ((.cse10 (or (not (<= 19 |old(~a12~0)|)) (or .cse25 (not (<= |old(~a12~0)| 76)) (and (or .cse40 .cse4 .cse30 .cse41 .cse39) (or .cse40 .cse4 .cse14 .cse39))))) (.cse7 (and .cse20 .cse21)) (.cse18 (forall ((v_prenex_14 Int)) (let ((.cse44 (div (+ v_prenex_14 (- 600066)) 5))) (let ((.cse45 (+ (* 34 .cse44) 34))) (or (= (mod (+ (* 4 .cse44) 4) 10) 0) (not (< v_prenex_14 600066)) (not (<= |old(~a12~0)| (+ (div .cse45 10) 1))) (= (mod (+ v_prenex_14 4) 5) 0) (not (< .cse45 0)) (not (<= v_prenex_14 586307))))))) (.cse29 (not (= 6 |old(~a15~0)|))) (.cse0 (not (<= (+ |old(~a12~0)| 252802) 0))) (.cse24 (or .cse37 .cse4)) (.cse28 (and .cse36 .cse8 .cse9)) (.cse35 (or .cse16 .cse27 .cse33)) (.cse12 (not (<= |old(~a12~0)| 11))) (.cse11 (not (<= 0 (+ |old(~a12~0)| 41)))) (.cse38 (not (= 7 |old(~a21~0)|))) (.cse26 (or .cse4 .cse41 .cse13)) (.cse34 (not (<= (+ |old(~a12~0)| 49) 0))) (.cse19 (not (< 80 |old(~a12~0)|))) (.cse23 (forall ((v_~a12~0_454 Int)) (or (not (<= |old(~a12~0)| v_~a12~0_454)) (not (<= 0 v_~a12~0_454)) (not (<= |old(~a12~0)| (+ (mod v_~a12~0_454 299959) 300041)))))) (.cse17 (and .cse20 .cse32 .cse8 .cse9)) (.cse3 (not .cse41)) (.cse15 (not .cse40)) (.cse1 (and .cse20 .cse8 .cse21 .cse22)) (.cse31 (forall ((v_prenex_20 Int)) (let ((.cse43 (div (+ v_prenex_20 (- 600066)) 5))) (let ((.cse42 (+ (* 34 .cse43) 34))) (or (not (<= v_prenex_20 599999)) (not (<= |old(~a12~0)| (+ (div .cse42 10) 1))) (= (mod (+ v_prenex_20 4) 5) 0) (= 0 (mod (+ (* 4 .cse43) 4) 10)) (not (< v_prenex_20 600066)) (not (< .cse42 0))))))) (.cse5 (not (= 7 |old(~a15~0)|))) (.cse6 (and .cse20 .cse8 .cse9 .cse21)) (.cse2 (not .cse30))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4) (or .cse4 (not (<= 103531 |old(~a12~0)|)) .cse5 .cse6) (or (and (and .cse7 .cse8) .cse9) .cse10 .cse5) (or .cse11 .cse6 .cse4 .cse12 .cse5 .cse13) (or (not (<= |old(~a12~0)| 72)) .cse2 .cse1 .cse3 (not (<= 20 |old(~a12~0)|)) .cse4) (or .cse10 .cse14 (and .cse7 .cse8 .cse9)) (or .cse15 .cse16 .cse17 .cse18) (or (or (not (= 9 |old(~a21~0)|)) .cse3 .cse19) .cse4 (and .cse20 (= ~a21~0 9) .cse21 .cse22) .cse23) (or .cse1 .cse3 .cse18 .cse24) (or .cse25 .cse26 .cse19 .cse6) (or (or .cse27 .cse4 .cse19 .cse2) .cse28 .cse14) (or .cse5 (and (and .cse20 .cse21 .cse8) .cse9) (or .cse4 .cse19 .cse2)) (or .cse11 .cse1 .cse2 .cse3 .cse4 .cse12) (or .cse29 (and .cse20 .cse9 (<= |old(~a21~0)| ~a21~0))) (or (not (= 8 ~a21~0)) .cse29 .cse30) (or .cse31 (and .cse32 .cse8 .cse20 .cse9) (and (or .cse4 .cse0 .cse2) .cse24 (or .cse33 .cse34 .cse4)) .cse14) (or (not (= 5 |old(~a15~0)|)) (or .cse35 .cse4) (and .cse8 .cse36 .cse9)) (or .cse37 .cse28 .cse4 .cse14 .cse19) (or .cse35 .cse4 .cse12 .cse6) (or (or .cse33 .cse4) .cse6 .cse5) (or .cse16 .cse34 (not (<= 7 |old(~a21~0)|)) .cse17) (or (and (or .cse38 .cse19) (or .cse19 .cse2)) .cse3 .cse4 (and .cse32 .cse20 .cse8 .cse9) .cse23) (or .cse16 (and .cse20 .cse21 .cse8 .cse9) .cse4 .cse39) (or .cse37 .cse11 .cse3 .cse4 .cse12 .cse1) (or .cse6 .cse40 .cse4 .cse12 .cse14 .cse11) (or .cse38 (and .cse20 .cse9 .cse21 (= ~a21~0 7)) .cse5 .cse26) (or (or .cse25 .cse34 .cse4 .cse41 .cse13) .cse17) (or .cse3 (or (or .cse33 .cse19) .cse4) .cse23 .cse17) (or .cse27 .cse3 .cse15 .cse4 (not (<= 95382 |old(~a12~0)|)) .cse1) (or .cse31 .cse4 .cse5 .cse6 .cse2))))) [2019-10-02 01:31:13,043 INFO L443 ceAbstractionStarter]: For program point L390(lines 390 870) no Hoare annotation was computed. [2019-10-02 01:31:13,043 INFO L443 ceAbstractionStarter]: For program point L258(lines 258 870) no Hoare annotation was computed. [2019-10-02 01:31:13,043 INFO L443 ceAbstractionStarter]: For program point L192-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:31:13,044 INFO L443 ceAbstractionStarter]: For program point L126-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:31:13,044 INFO L443 ceAbstractionStarter]: For program point L60-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:31:13,044 INFO L443 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2019-10-02 01:31:13,044 INFO L443 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2019-10-02 01:31:13,044 INFO L443 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2019-10-02 01:31:13,044 INFO L443 ceAbstractionStarter]: For program point L854(lines 854 870) no Hoare annotation was computed. [2019-10-02 01:31:13,044 INFO L443 ceAbstractionStarter]: For program point L656(lines 656 870) no Hoare annotation was computed. [2019-10-02 01:31:13,044 INFO L443 ceAbstractionStarter]: For program point L524(lines 524 870) no Hoare annotation was computed. [2019-10-02 01:31:13,045 INFO L443 ceAbstractionStarter]: For program point L789(lines 789 870) no Hoare annotation was computed. [2019-10-02 01:31:13,045 INFO L443 ceAbstractionStarter]: For program point L591(lines 591 870) no Hoare annotation was computed. [2019-10-02 01:31:13,045 INFO L443 ceAbstractionStarter]: For program point L195-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:31:13,045 INFO L443 ceAbstractionStarter]: For program point L129-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:31:13,045 INFO L443 ceAbstractionStarter]: For program point L63-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:31:13,045 INFO L443 ceAbstractionStarter]: For program point L724(lines 724 870) no Hoare annotation was computed. [2019-10-02 01:31:13,045 INFO L443 ceAbstractionStarter]: For program point L460(lines 460 870) no Hoare annotation was computed. [2019-10-02 01:31:13,045 INFO L443 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2019-10-02 01:31:13,045 INFO L443 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2019-10-02 01:31:13,046 INFO L443 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2019-10-02 01:31:13,046 INFO L443 ceAbstractionStarter]: For program point L329(lines 329 870) no Hoare annotation was computed. [2019-10-02 01:31:13,046 INFO L443 ceAbstractionStarter]: For program point L396(lines 396 870) no Hoare annotation was computed. [2019-10-02 01:31:13,046 INFO L443 ceAbstractionStarter]: For program point L264(lines 264 870) no Hoare annotation was computed. [2019-10-02 01:31:13,046 INFO L443 ceAbstractionStarter]: For program point L198-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:31:13,046 INFO L443 ceAbstractionStarter]: For program point L132-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:31:13,046 INFO L443 ceAbstractionStarter]: For program point L66-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:31:13,046 INFO L443 ceAbstractionStarter]: For program point L859(lines 859 870) no Hoare annotation was computed. [2019-10-02 01:31:13,046 INFO L443 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2019-10-02 01:31:13,047 INFO L443 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2019-10-02 01:31:13,047 INFO L443 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2019-10-02 01:31:13,047 INFO L443 ceAbstractionStarter]: For program point L662(lines 662 870) no Hoare annotation was computed. [2019-10-02 01:31:13,047 INFO L443 ceAbstractionStarter]: For program point L530(lines 530 870) no Hoare annotation was computed. [2019-10-02 01:31:13,047 INFO L443 ceAbstractionStarter]: For program point L795(lines 795 870) no Hoare annotation was computed. [2019-10-02 01:31:13,047 INFO L443 ceAbstractionStarter]: For program point L597(lines 597 870) no Hoare annotation was computed. [2019-10-02 01:31:13,047 INFO L443 ceAbstractionStarter]: For program point L201-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:31:13,047 INFO L443 ceAbstractionStarter]: For program point L135-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:31:13,048 INFO L443 ceAbstractionStarter]: For program point L69-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:31:13,048 INFO L443 ceAbstractionStarter]: For program point L730(lines 730 870) no Hoare annotation was computed. [2019-10-02 01:31:13,048 INFO L443 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2019-10-02 01:31:13,048 INFO L443 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2019-10-02 01:31:13,048 INFO L443 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2019-10-02 01:31:13,048 INFO L443 ceAbstractionStarter]: For program point L467(lines 467 870) no Hoare annotation was computed. [2019-10-02 01:31:13,048 INFO L443 ceAbstractionStarter]: For program point L335(lines 335 870) no Hoare annotation was computed. [2019-10-02 01:31:13,048 INFO L443 ceAbstractionStarter]: For program point L269(lines 269 870) no Hoare annotation was computed. [2019-10-02 01:31:13,048 INFO L443 ceAbstractionStarter]: For program point L402(lines 402 870) no Hoare annotation was computed. [2019-10-02 01:31:13,048 INFO L443 ceAbstractionStarter]: For program point L138-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:31:13,049 INFO L443 ceAbstractionStarter]: For program point L72-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:31:13,049 INFO L443 ceAbstractionStarter]: For program point L865(lines 865 870) no Hoare annotation was computed. [2019-10-02 01:31:13,049 INFO L443 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2019-10-02 01:31:13,049 INFO L443 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2019-10-02 01:31:13,049 INFO L443 ceAbstractionStarter]: For program point L668(lines 668 870) no Hoare annotation was computed. [2019-10-02 01:31:13,049 INFO L443 ceAbstractionStarter]: For program point L536(lines 536 870) no Hoare annotation was computed. [2019-10-02 01:31:13,049 INFO L443 ceAbstractionStarter]: For program point L801(lines 801 870) no Hoare annotation was computed. [2019-10-02 01:31:13,049 INFO L443 ceAbstractionStarter]: For program point L735(lines 735 870) no Hoare annotation was computed. [2019-10-02 01:31:13,050 INFO L443 ceAbstractionStarter]: For program point L603(lines 603 870) no Hoare annotation was computed. [2019-10-02 01:31:13,050 INFO L443 ceAbstractionStarter]: For program point L141-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:31:13,050 INFO L443 ceAbstractionStarter]: For program point L75-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:31:13,050 INFO L443 ceAbstractionStarter]: For program point L472(lines 472 870) no Hoare annotation was computed. [2019-10-02 01:31:13,050 INFO L443 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2019-10-02 01:31:13,050 INFO L443 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2019-10-02 01:31:13,050 INFO L443 ceAbstractionStarter]: For program point L341(lines 341 870) no Hoare annotation was computed. [2019-10-02 01:31:13,050 INFO L443 ceAbstractionStarter]: For program point L275(lines 275 870) no Hoare annotation was computed. [2019-10-02 01:31:13,050 INFO L443 ceAbstractionStarter]: For program point L408(lines 408 870) no Hoare annotation was computed. [2019-10-02 01:31:13,051 INFO L443 ceAbstractionStarter]: For program point L144-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:31:13,051 INFO L443 ceAbstractionStarter]: For program point L78-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:31:13,051 INFO L443 ceAbstractionStarter]: For program point L541(lines 541 870) no Hoare annotation was computed. [2019-10-02 01:31:13,051 INFO L443 ceAbstractionStarter]: For program point L211(lines 211 870) no Hoare annotation was computed. [2019-10-02 01:31:13,051 INFO L443 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2019-10-02 01:31:13,051 INFO L443 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2019-10-02 01:31:13,051 INFO L443 ceAbstractionStarter]: For program point L674(lines 674 870) no Hoare annotation was computed. [2019-10-02 01:31:13,051 INFO L443 ceAbstractionStarter]: For program point L807(lines 807 870) no Hoare annotation was computed. [2019-10-02 01:31:13,051 INFO L443 ceAbstractionStarter]: For program point L741(lines 741 870) no Hoare annotation was computed. [2019-10-02 01:31:13,052 INFO L443 ceAbstractionStarter]: For program point L609(lines 609 870) no Hoare annotation was computed. [2019-10-02 01:31:13,052 INFO L443 ceAbstractionStarter]: For program point L147-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:31:13,052 INFO L443 ceAbstractionStarter]: For program point L81-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:31:13,052 INFO L443 ceAbstractionStarter]: For program point L478(lines 478 870) no Hoare annotation was computed. [2019-10-02 01:31:13,052 INFO L443 ceAbstractionStarter]: For program point L280(lines 280 870) no Hoare annotation was computed. [2019-10-02 01:31:13,052 INFO L443 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2019-10-02 01:31:13,052 INFO L443 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2019-10-02 01:31:13,052 INFO L443 ceAbstractionStarter]: For program point L677(lines 677 870) no Hoare annotation was computed. [2019-10-02 01:31:13,052 INFO L443 ceAbstractionStarter]: For program point L347(lines 347 870) no Hoare annotation was computed. [2019-10-02 01:31:13,053 INFO L443 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 109) no Hoare annotation was computed. [2019-10-02 01:31:13,053 INFO L443 ceAbstractionStarter]: For program point L414(lines 414 870) no Hoare annotation was computed. [2019-10-02 01:31:13,053 INFO L443 ceAbstractionStarter]: For program point L150-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:31:13,053 INFO L443 ceAbstractionStarter]: For program point L84-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:31:13,053 INFO L443 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:31:13,053 INFO L443 ceAbstractionStarter]: For program point L547(lines 547 870) no Hoare annotation was computed. [2019-10-02 01:31:13,053 INFO L443 ceAbstractionStarter]: For program point L217(lines 217 870) no Hoare annotation was computed. [2019-10-02 01:31:13,053 INFO L443 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2019-10-02 01:31:13,054 INFO L443 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2019-10-02 01:31:13,054 INFO L443 ceAbstractionStarter]: For program point L747(lines 747 870) no Hoare annotation was computed. [2019-10-02 01:31:13,054 INFO L443 ceAbstractionStarter]: For program point L615(lines 615 870) no Hoare annotation was computed. [2019-10-02 01:31:13,054 INFO L443 ceAbstractionStarter]: For program point L153-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:31:13,054 INFO L443 ceAbstractionStarter]: For program point L87-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:31:13,054 INFO L443 ceAbstractionStarter]: For program point L21(lines 21 23) no Hoare annotation was computed. [2019-10-02 01:31:13,054 INFO L443 ceAbstractionStarter]: For program point L21-2(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:31:13,054 INFO L443 ceAbstractionStarter]: For program point L814(lines 814 870) no Hoare annotation was computed. [2019-10-02 01:31:13,054 INFO L443 ceAbstractionStarter]: For program point L484(lines 484 870) no Hoare annotation was computed. [2019-10-02 01:31:13,054 INFO L443 ceAbstractionStarter]: For program point L286(lines 286 870) no Hoare annotation was computed. [2019-10-02 01:31:13,055 INFO L443 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2019-10-02 01:31:13,055 INFO L443 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2019-10-02 01:31:13,055 INFO L443 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2019-10-02 01:31:13,055 INFO L443 ceAbstractionStarter]: For program point L683(lines 683 870) no Hoare annotation was computed. [2019-10-02 01:31:13,055 INFO L443 ceAbstractionStarter]: For program point L353(lines 353 870) no Hoare annotation was computed. [2019-10-02 01:31:13,055 INFO L443 ceAbstractionStarter]: For program point L552(lines 552 870) no Hoare annotation was computed. [2019-10-02 01:31:13,055 INFO L443 ceAbstractionStarter]: For program point L420(lines 420 870) no Hoare annotation was computed. [2019-10-02 01:31:13,055 INFO L443 ceAbstractionStarter]: For program point L156-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:31:13,055 INFO L443 ceAbstractionStarter]: For program point L90-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:31:13,055 INFO L443 ceAbstractionStarter]: For program point L24-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:31:13,056 INFO L443 ceAbstractionStarter]: For program point L223(lines 223 870) no Hoare annotation was computed. [2019-10-02 01:31:13,056 INFO L443 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2019-10-02 01:31:13,056 INFO L443 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2019-10-02 01:31:13,056 INFO L443 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2019-10-02 01:31:13,056 INFO L443 ceAbstractionStarter]: For program point L752(lines 752 870) no Hoare annotation was computed. [2019-10-02 01:31:13,056 INFO L443 ceAbstractionStarter]: For program point L819(lines 819 870) no Hoare annotation was computed. [2019-10-02 01:31:13,056 INFO L443 ceAbstractionStarter]: For program point L621(lines 621 870) no Hoare annotation was computed. [2019-10-02 01:31:13,056 INFO L443 ceAbstractionStarter]: For program point L555(lines 555 870) no Hoare annotation was computed. [2019-10-02 01:31:13,056 INFO L443 ceAbstractionStarter]: For program point L159-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:31:13,057 INFO L443 ceAbstractionStarter]: For program point L93-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:31:13,057 INFO L443 ceAbstractionStarter]: For program point L27-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:31:13,057 INFO L443 ceAbstractionStarter]: For program point L688(lines 688 870) no Hoare annotation was computed. [2019-10-02 01:31:13,057 INFO L443 ceAbstractionStarter]: For program point L490(lines 490 870) no Hoare annotation was computed. [2019-10-02 01:31:13,057 INFO L443 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2019-10-02 01:31:13,057 INFO L443 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2019-10-02 01:31:13,057 INFO L443 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2019-10-02 01:31:13,057 INFO L443 ceAbstractionStarter]: For program point L359(lines 359 870) no Hoare annotation was computed. [2019-10-02 01:31:13,058 INFO L443 ceAbstractionStarter]: For program point L293(lines 293 870) no Hoare annotation was computed. [2019-10-02 01:31:13,058 INFO L443 ceAbstractionStarter]: For program point L426(lines 426 870) no Hoare annotation was computed. [2019-10-02 01:31:13,058 INFO L443 ceAbstractionStarter]: For program point L162-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:31:13,058 INFO L443 ceAbstractionStarter]: For program point L96-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:31:13,058 INFO L443 ceAbstractionStarter]: For program point L30-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:31:13,058 INFO L443 ceAbstractionStarter]: For program point L229(lines 229 870) no Hoare annotation was computed. [2019-10-02 01:31:13,058 INFO L443 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2019-10-02 01:31:13,058 INFO L443 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2019-10-02 01:31:13,058 INFO L443 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2019-10-02 01:31:13,058 INFO L443 ceAbstractionStarter]: For program point L758(lines 758 870) no Hoare annotation was computed. [2019-10-02 01:31:13,058 INFO L443 ceAbstractionStarter]: For program point L626(lines 626 870) no Hoare annotation was computed. [2019-10-02 01:31:13,059 INFO L443 ceAbstractionStarter]: For program point L825(lines 825 870) no Hoare annotation was computed. [2019-10-02 01:31:13,059 INFO L443 ceAbstractionStarter]: For program point L561(lines 561 870) no Hoare annotation was computed. [2019-10-02 01:31:13,059 INFO L443 ceAbstractionStarter]: For program point L495(lines 495 870) no Hoare annotation was computed. [2019-10-02 01:31:13,059 INFO L443 ceAbstractionStarter]: For program point L165-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:31:13,059 INFO L443 ceAbstractionStarter]: For program point L99-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:31:13,059 INFO L443 ceAbstractionStarter]: For program point L33-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:31:13,059 INFO L443 ceAbstractionStarter]: For program point L694(lines 694 870) no Hoare annotation was computed. [2019-10-02 01:31:13,059 INFO L443 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2019-10-02 01:31:13,060 INFO L443 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2019-10-02 01:31:13,060 INFO L443 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2019-10-02 01:31:13,060 INFO L443 ceAbstractionStarter]: For program point L299(lines 299 870) no Hoare annotation was computed. [2019-10-02 01:31:13,060 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-02 01:31:13,060 INFO L439 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= ~a15~0 8) (= ~a24~0 1) (= ~a21~0 7) (<= (+ ~a12~0 49) 0)) [2019-10-02 01:31:13,060 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-02 01:31:13,060 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-02 01:31:13,060 INFO L439 ceAbstractionStarter]: At program point mainENTRY(lines 874 890) the Hoare annotation is: (or (not (<= (+ |old(~a12~0)| 49) 0)) (not (= 8 |old(~a15~0)|)) (and (= ~a12~0 |old(~a12~0)|) (= ~a15~0 |old(~a15~0)|) (= ~a24~0 1) (= ~a21~0 7)) (not (= 7 |old(~a21~0)|)) (not (= 1 |old(~a24~0)|))) [2019-10-02 01:31:13,061 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 874 890) no Hoare annotation was computed. [2019-10-02 01:31:13,061 INFO L439 ceAbstractionStarter]: At program point L888(line 888) the Hoare annotation is: (let ((.cse30 (= ~a21~0 10)) (.cse17 (= ~a21~0 6))) (let ((.cse15 (= ~a21~0 8)) (.cse6 (< 80 ~a12~0)) (.cse32 (or (and (not (= 9 |old(~a21~0)|)) (not (= 10 |old(~a21~0)|)) (not (= 8 |old(~a21~0)|))) (<= 0 (+ |old(~a12~0)| 42)))) (.cse31 (not .cse17)) (.cse9 (= ~a24~0 |old(~a24~0)|)) (.cse23 (= ~a15~0 |old(~a15~0)|)) (.cse14 (not .cse30)) (.cse20 (not (= 10 ~a15~0))) (.cse21 (<= ~a12~0 228293)) (.cse8 (<= 10 ~a21~0)) (.cse26 (<= ~a21~0 7)) (.cse13 (= ~a24~0 1)) (.cse33 (not (= 9 ~a15~0))) (.cse36 (<= ~a15~0 5)) (.cse12 (= 8 |old(~a15~0)|))) (let ((.cse3 (and .cse36 .cse12)) (.cse1 (and .cse26 .cse13 .cse33 .cse12)) (.cse2 (= ~a21~0 7)) (.cse19 (<= (+ ~a12~0 252802) 0)) (.cse25 (and .cse8 .cse13)) (.cse24 (= ~a12~0 |old(~a12~0)|)) (.cse10 (and (and .cse21 .cse8 .cse36 .cse12) .cse13)) (.cse22 (and (and .cse32 (and (<= ~a12~0 76) (or (and .cse31 (and .cse13 (not (= 8 ~a21~0)) .cse33 .cse12) .cse14) (and .cse31 (and .cse9 .cse12 .cse23) .cse14)) .cse20)) (<= 19 ~a12~0))) (.cse18 (exists ((v_prenex_14 Int)) (let ((.cse35 (div (+ v_prenex_14 (- 600066)) 5))) (let ((.cse34 (+ (* 34 .cse35) 34))) (and (not (= (mod (+ v_prenex_14 4) 5) 0)) (<= ~a12~0 (+ (div .cse34 10) 1)) (< .cse34 0) (<= v_prenex_14 586307) (not (= (mod (+ (* 4 .cse35) 4) 10) 0)) (< v_prenex_14 600066)))))) (.cse16 (<= 0 (+ ~a12~0 41))) (.cse11 (<= ~a12~0 11)) (.cse5 (<= ~a12~0 599999)) (.cse4 (<= (+ ~a12~0 49) 0)) (.cse0 (= ~a15~0 7)) (.cse27 (and .cse20 .cse32 .cse15 .cse6 (and .cse21 .cse9 .cse33 .cse12) (not (= 6 |old(~a21~0)|)))) (.cse7 (= ~a15~0 9))) (or (and .cse0 .cse1 .cse2) (and (<= 7 ~a21~0) .cse3 .cse4) (and .cse5 .cse6 (and .cse7 (and .cse8 .cse9))) (and .cse10 .cse11) (not .cse12) (and (and .cse3 .cse13) .cse14) (and .cse15 .cse16 .cse13 .cse7 .cse11) (and .cse0 .cse9 (<= 103531 ~a12~0)) (and .cse17 .cse18 .cse3) (and .cse15 .cse19 .cse13 .cse7) (and .cse20 .cse1 .cse6) (and (and (and (or .cse2 .cse15) .cse9) .cse7) .cse5 .cse6) (and .cse17 .cse21 (<= 95382 ~a12~0) .cse13 .cse7) (and .cse22 .cse23) (and .cse24 (or .cse25 (and .cse15 (and .cse9 .cse19))) .cse23) (and .cse0 .cse16 .cse26 .cse13 .cse11) (and .cse27 .cse23) (and (exists ((v_prenex_20 Int)) (let ((.cse29 (div (+ v_prenex_20 (- 600066)) 5))) (let ((.cse28 (+ (* 34 .cse29) 34))) (and (<= ~a12~0 (+ (div .cse28 10) 1)) (< .cse28 0) (<= v_prenex_20 599999) (not (= (mod (+ v_prenex_20 4) 5) 0)) (not (= 0 (mod (+ (* 4 .cse29) 4) 10))) (< v_prenex_20 600066))))) (and .cse0 .cse15 .cse13)) (and .cse0 .cse25) (and .cse30 .cse16 .cse13 .cse7 .cse11) (not (<= (+ |old(~a12~0)| 49) 0)) (and (= ~a15~0 8) .cse13 .cse30 .cse6) (= ~a15~0 6) (and .cse24 .cse9 (= ~a21~0 |old(~a21~0)|) .cse23) (not (<= |old(~a21~0)| 7)) (and (= ~a15~0 5) .cse10) (and .cse0 .cse22) (and .cse18 .cse13 .cse7 .cse30) (and .cse31 .cse16 .cse23 .cse13 .cse11) (not (<= 7 |old(~a21~0)|)) (and .cse5 (and .cse9 .cse7 (= ~a21~0 9)) .cse6) (and .cse0 (and .cse26 .cse13 .cse4)) (and .cse0 .cse27) (not (= 1 |old(~a24~0)|)) (and .cse15 .cse13 (<= 20 ~a12~0) (<= ~a12~0 72) .cse7))))) [2019-10-02 01:31:13,062 INFO L443 ceAbstractionStarter]: For program point L888-1(line 888) no Hoare annotation was computed. [2019-10-02 01:31:13,062 INFO L443 ceAbstractionStarter]: For program point L885(line 885) no Hoare annotation was computed. [2019-10-02 01:31:13,062 INFO L439 ceAbstractionStarter]: At program point L880-2(lines 880 889) the Hoare annotation is: (let ((.cse30 (= ~a21~0 10)) (.cse17 (= ~a21~0 6))) (let ((.cse15 (= ~a21~0 8)) (.cse6 (< 80 ~a12~0)) (.cse32 (or (and (not (= 9 |old(~a21~0)|)) (not (= 10 |old(~a21~0)|)) (not (= 8 |old(~a21~0)|))) (<= 0 (+ |old(~a12~0)| 42)))) (.cse31 (not .cse17)) (.cse9 (= ~a24~0 |old(~a24~0)|)) (.cse23 (= ~a15~0 |old(~a15~0)|)) (.cse14 (not .cse30)) (.cse20 (not (= 10 ~a15~0))) (.cse21 (<= ~a12~0 228293)) (.cse8 (<= 10 ~a21~0)) (.cse26 (<= ~a21~0 7)) (.cse13 (= ~a24~0 1)) (.cse33 (not (= 9 ~a15~0))) (.cse36 (<= ~a15~0 5)) (.cse12 (= 8 |old(~a15~0)|))) (let ((.cse3 (and .cse36 .cse12)) (.cse1 (and .cse26 .cse13 .cse33 .cse12)) (.cse2 (= ~a21~0 7)) (.cse19 (<= (+ ~a12~0 252802) 0)) (.cse25 (and .cse8 .cse13)) (.cse24 (= ~a12~0 |old(~a12~0)|)) (.cse10 (and (and .cse21 .cse8 .cse36 .cse12) .cse13)) (.cse22 (and (and .cse32 (and (<= ~a12~0 76) (or (and .cse31 (and .cse13 (not (= 8 ~a21~0)) .cse33 .cse12) .cse14) (and .cse31 (and .cse9 .cse12 .cse23) .cse14)) .cse20)) (<= 19 ~a12~0))) (.cse18 (exists ((v_prenex_14 Int)) (let ((.cse35 (div (+ v_prenex_14 (- 600066)) 5))) (let ((.cse34 (+ (* 34 .cse35) 34))) (and (not (= (mod (+ v_prenex_14 4) 5) 0)) (<= ~a12~0 (+ (div .cse34 10) 1)) (< .cse34 0) (<= v_prenex_14 586307) (not (= (mod (+ (* 4 .cse35) 4) 10) 0)) (< v_prenex_14 600066)))))) (.cse16 (<= 0 (+ ~a12~0 41))) (.cse11 (<= ~a12~0 11)) (.cse5 (<= ~a12~0 599999)) (.cse4 (<= (+ ~a12~0 49) 0)) (.cse0 (= ~a15~0 7)) (.cse27 (and .cse20 .cse32 .cse15 .cse6 (and .cse21 .cse9 .cse33 .cse12) (not (= 6 |old(~a21~0)|)))) (.cse7 (= ~a15~0 9))) (or (and .cse0 .cse1 .cse2) (and (<= 7 ~a21~0) .cse3 .cse4) (and .cse5 .cse6 (and .cse7 (and .cse8 .cse9))) (and .cse10 .cse11) (not .cse12) (and (and .cse3 .cse13) .cse14) (and .cse15 .cse16 .cse13 .cse7 .cse11) (and .cse0 .cse9 (<= 103531 ~a12~0)) (and .cse17 .cse18 .cse3) (and .cse15 .cse19 .cse13 .cse7) (and .cse20 .cse1 .cse6) (and (and (and (or .cse2 .cse15) .cse9) .cse7) .cse5 .cse6) (and .cse17 .cse21 (<= 95382 ~a12~0) .cse13 .cse7) (and .cse22 .cse23) (and .cse24 (or .cse25 (and .cse15 (and .cse9 .cse19))) .cse23) (and .cse0 .cse16 .cse26 .cse13 .cse11) (and .cse27 .cse23) (and (exists ((v_prenex_20 Int)) (let ((.cse29 (div (+ v_prenex_20 (- 600066)) 5))) (let ((.cse28 (+ (* 34 .cse29) 34))) (and (<= ~a12~0 (+ (div .cse28 10) 1)) (< .cse28 0) (<= v_prenex_20 599999) (not (= (mod (+ v_prenex_20 4) 5) 0)) (not (= 0 (mod (+ (* 4 .cse29) 4) 10))) (< v_prenex_20 600066))))) (and .cse0 .cse15 .cse13)) (and .cse0 .cse25) (and .cse30 .cse16 .cse13 .cse7 .cse11) (not (<= (+ |old(~a12~0)| 49) 0)) (and (= ~a15~0 8) .cse13 .cse30 .cse6) (= ~a15~0 6) (and .cse24 .cse9 (= ~a21~0 |old(~a21~0)|) .cse23) (not (<= |old(~a21~0)| 7)) (and (= ~a15~0 5) .cse10) (and .cse0 .cse22) (and .cse18 .cse13 .cse7 .cse30) (and .cse31 .cse16 .cse23 .cse13 .cse11) (not (<= 7 |old(~a21~0)|)) (and .cse5 (and .cse9 .cse7 (= ~a21~0 9)) .cse6) (and .cse0 (and .cse26 .cse13 .cse4)) (and .cse0 .cse27) (not (= 1 |old(~a24~0)|)) (and .cse15 .cse13 (<= 20 ~a12~0) (<= ~a12~0 72) .cse7))))) [2019-10-02 01:31:13,063 INFO L443 ceAbstractionStarter]: For program point L880-3(lines 874 890) no Hoare annotation was computed. [2019-10-02 01:31:13,075 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-10-02 01:31:13,076 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-10-02 01:31:13,076 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-10-02 01:31:13,077 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-10-02 01:31:13,077 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-10-02 01:31:13,077 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-10-02 01:31:13,078 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-10-02 01:31:13,079 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-10-02 01:31:13,079 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-10-02 01:31:13,079 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-10-02 01:31:13,080 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-10-02 01:31:13,080 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-10-02 01:31:13,081 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-10-02 01:31:13,081 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-10-02 01:31:13,081 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-10-02 01:31:13,082 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-10-02 01:31:13,082 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-10-02 01:31:13,082 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-10-02 01:31:13,096 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-10-02 01:31:13,096 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-10-02 01:31:13,097 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-10-02 01:31:13,097 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-10-02 01:31:13,097 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-10-02 01:31:13,098 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-10-02 01:31:13,099 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-10-02 01:31:13,099 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-10-02 01:31:13,099 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-10-02 01:31:13,099 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-10-02 01:31:13,100 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-10-02 01:31:13,100 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-10-02 01:31:13,101 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-10-02 01:31:13,101 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-10-02 01:31:13,101 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-10-02 01:31:13,101 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-10-02 01:31:13,102 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-10-02 01:31:13,102 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-10-02 01:31:13,109 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.10 01:31:13 BoogieIcfgContainer [2019-10-02 01:31:13,109 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-02 01:31:13,111 INFO L168 Benchmark]: Toolchain (without parser) took 469376.00 ms. Allocated memory was 135.8 MB in the beginning and 2.7 GB in the end (delta: 2.6 GB). Free memory was 84.6 MB in the beginning and 913.0 MB in the end (delta: -828.4 MB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. [2019-10-02 01:31:13,112 INFO L168 Benchmark]: CDTParser took 0.51 ms. Allocated memory is still 135.8 MB. Free memory was 104.9 MB in the beginning and 104.7 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-10-02 01:31:13,113 INFO L168 Benchmark]: CACSL2BoogieTranslator took 840.71 ms. Allocated memory was 135.8 MB in the beginning and 201.3 MB in the end (delta: 65.5 MB). Free memory was 84.4 MB in the beginning and 154.9 MB in the end (delta: -70.5 MB). Peak memory consumption was 25.6 MB. Max. memory is 7.1 GB. [2019-10-02 01:31:13,113 INFO L168 Benchmark]: Boogie Preprocessor took 134.22 ms. Allocated memory is still 201.3 MB. Free memory was 154.9 MB in the beginning and 149.6 MB in the end (delta: 5.3 MB). Peak memory consumption was 5.3 MB. Max. memory is 7.1 GB. [2019-10-02 01:31:13,114 INFO L168 Benchmark]: RCFGBuilder took 1396.34 ms. Allocated memory was 201.3 MB in the beginning and 223.3 MB in the end (delta: 22.0 MB). Free memory was 149.6 MB in the beginning and 142.7 MB in the end (delta: 6.9 MB). Peak memory consumption was 82.7 MB. Max. memory is 7.1 GB. [2019-10-02 01:31:13,115 INFO L168 Benchmark]: TraceAbstraction took 466999.14 ms. Allocated memory was 223.3 MB in the beginning and 2.7 GB in the end (delta: 2.5 GB). Free memory was 141.4 MB in the beginning and 913.0 MB in the end (delta: -771.6 MB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. [2019-10-02 01:31:13,119 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.51 ms. Allocated memory is still 135.8 MB. Free memory was 104.9 MB in the beginning and 104.7 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 840.71 ms. Allocated memory was 135.8 MB in the beginning and 201.3 MB in the end (delta: 65.5 MB). Free memory was 84.4 MB in the beginning and 154.9 MB in the end (delta: -70.5 MB). Peak memory consumption was 25.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 134.22 ms. Allocated memory is still 201.3 MB. Free memory was 154.9 MB in the beginning and 149.6 MB in the end (delta: 5.3 MB). Peak memory consumption was 5.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1396.34 ms. Allocated memory was 201.3 MB in the beginning and 223.3 MB in the end (delta: 22.0 MB). Free memory was 149.6 MB in the beginning and 142.7 MB in the end (delta: 6.9 MB). Peak memory consumption was 82.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 466999.14 ms. Allocated memory was 223.3 MB in the beginning and 2.7 GB in the end (delta: 2.5 GB). Free memory was 141.4 MB in the beginning and 913.0 MB in the end (delta: -771.6 MB). Peak memory consumption was 2.6 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_prenex_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 109]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 880]: Loop Invariant [2019-10-02 01:31:13,129 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-10-02 01:31:13,130 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-10-02 01:31:13,130 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-10-02 01:31:13,130 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-10-02 01:31:13,131 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-10-02 01:31:13,131 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-10-02 01:31:13,132 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-10-02 01:31:13,132 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-10-02 01:31:13,132 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-10-02 01:31:13,133 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-10-02 01:31:13,133 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-10-02 01:31:13,133 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-10-02 01:31:13,134 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-10-02 01:31:13,134 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-10-02 01:31:13,134 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-10-02 01:31:13,135 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-10-02 01:31:13,135 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-10-02 01:31:13,135 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-10-02 01:31:13,138 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-10-02 01:31:13,139 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-10-02 01:31:13,139 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-10-02 01:31:13,139 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-10-02 01:31:13,140 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-10-02 01:31:13,140 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-10-02 01:31:13,141 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-10-02 01:31:13,141 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-10-02 01:31:13,142 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-10-02 01:31:13,142 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-10-02 01:31:13,142 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-10-02 01:31:13,142 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-10-02 01:31:13,143 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-10-02 01:31:13,143 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-10-02 01:31:13,143 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-10-02 01:31:13,144 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-10-02 01:31:13,144 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-10-02 01:31:13,144 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] Derived loop invariant: (((((((((((((((((((((((((((((((((((a15 == 7 && ((a21 <= 7 && a24 == 1) && !(9 == a15)) && 8 == \old(a15)) && a21 == 7) || ((7 <= a21 && a15 <= 5 && 8 == \old(a15)) && a12 + 49 <= 0)) || ((a12 <= 599999 && 80 < a12) && a15 == 9 && 10 <= a21 && a24 == \old(a24))) || (((((a12 <= 228293 && 10 <= a21) && a15 <= 5) && 8 == \old(a15)) && a24 == 1) && a12 <= 11)) || !(8 == \old(a15))) || (((a15 <= 5 && 8 == \old(a15)) && a24 == 1) && !(a21 == 10))) || ((((a21 == 8 && 0 <= a12 + 41) && a24 == 1) && a15 == 9) && a12 <= 11)) || ((a15 == 7 && a24 == \old(a24)) && 103531 <= a12)) || ((a21 == 6 && (\exists v_prenex_14 : int :: ((((!((v_prenex_14 + 4) % 5 == 0) && a12 <= (34 * ((v_prenex_14 + -600066) / 5) + 34) / 10 + 1) && 34 * ((v_prenex_14 + -600066) / 5) + 34 < 0) && v_prenex_14 <= 586307) && !((4 * ((v_prenex_14 + -600066) / 5) + 4) % 10 == 0)) && v_prenex_14 < 600066)) && a15 <= 5 && 8 == \old(a15))) || (((a21 == 8 && a12 + 252802 <= 0) && a24 == 1) && a15 == 9)) || ((!(10 == a15) && ((a21 <= 7 && a24 == 1) && !(9 == a15)) && 8 == \old(a15)) && 80 < a12)) || (((((a21 == 7 || a21 == 8) && a24 == \old(a24)) && a15 == 9) && a12 <= 599999) && 80 < a12)) || ((((a21 == 6 && a12 <= 228293) && 95382 <= a12) && a24 == 1) && a15 == 9)) || ((((((!(9 == \old(a21)) && !(10 == \old(a21))) && !(8 == \old(a21))) || 0 <= \old(a12) + 42) && (a12 <= 76 && (((!(a21 == 6) && ((a24 == 1 && !(8 == a21)) && !(9 == a15)) && 8 == \old(a15)) && !(a21 == 10)) || ((!(a21 == 6) && (a24 == \old(a24) && 8 == \old(a15)) && a15 == \old(a15)) && !(a21 == 10)))) && !(10 == a15)) && 19 <= a12) && a15 == \old(a15))) || ((a12 == \old(a12) && ((10 <= a21 && a24 == 1) || (a21 == 8 && a24 == \old(a24) && a12 + 252802 <= 0))) && a15 == \old(a15))) || ((((a15 == 7 && 0 <= a12 + 41) && a21 <= 7) && a24 == 1) && a12 <= 11)) || ((((((!(10 == a15) && (((!(9 == \old(a21)) && !(10 == \old(a21))) && !(8 == \old(a21))) || 0 <= \old(a12) + 42)) && a21 == 8) && 80 < a12) && ((a12 <= 228293 && a24 == \old(a24)) && !(9 == a15)) && 8 == \old(a15)) && !(6 == \old(a21))) && a15 == \old(a15))) || ((\exists v_prenex_20 : int :: ((((a12 <= (34 * ((v_prenex_20 + -600066) / 5) + 34) / 10 + 1 && 34 * ((v_prenex_20 + -600066) / 5) + 34 < 0) && v_prenex_20 <= 599999) && !((v_prenex_20 + 4) % 5 == 0)) && !(0 == (4 * ((v_prenex_20 + -600066) / 5) + 4) % 10)) && v_prenex_20 < 600066) && (a15 == 7 && a21 == 8) && a24 == 1)) || (a15 == 7 && 10 <= a21 && a24 == 1)) || ((((a21 == 10 && 0 <= a12 + 41) && a24 == 1) && a15 == 9) && a12 <= 11)) || !(\old(a12) + 49 <= 0)) || (((a15 == 8 && a24 == 1) && a21 == 10) && 80 < a12)) || a15 == 6) || (((a12 == \old(a12) && a24 == \old(a24)) && a21 == \old(a21)) && a15 == \old(a15))) || !(\old(a21) <= 7)) || (a15 == 5 && (((a12 <= 228293 && 10 <= a21) && a15 <= 5) && 8 == \old(a15)) && a24 == 1)) || (a15 == 7 && ((((!(9 == \old(a21)) && !(10 == \old(a21))) && !(8 == \old(a21))) || 0 <= \old(a12) + 42) && (a12 <= 76 && (((!(a21 == 6) && ((a24 == 1 && !(8 == a21)) && !(9 == a15)) && 8 == \old(a15)) && !(a21 == 10)) || ((!(a21 == 6) && (a24 == \old(a24) && 8 == \old(a15)) && a15 == \old(a15)) && !(a21 == 10)))) && !(10 == a15)) && 19 <= a12)) || ((((\exists v_prenex_14 : int :: ((((!((v_prenex_14 + 4) % 5 == 0) && a12 <= (34 * ((v_prenex_14 + -600066) / 5) + 34) / 10 + 1) && 34 * ((v_prenex_14 + -600066) / 5) + 34 < 0) && v_prenex_14 <= 586307) && !((4 * ((v_prenex_14 + -600066) / 5) + 4) % 10 == 0)) && v_prenex_14 < 600066) && a24 == 1) && a15 == 9) && a21 == 10)) || ((((!(a21 == 6) && 0 <= a12 + 41) && a15 == \old(a15)) && a24 == 1) && a12 <= 11)) || !(7 <= \old(a21))) || ((a12 <= 599999 && (a24 == \old(a24) && a15 == 9) && a21 == 9) && 80 < a12)) || (a15 == 7 && (a21 <= 7 && a24 == 1) && a12 + 49 <= 0)) || (a15 == 7 && ((((!(10 == a15) && (((!(9 == \old(a21)) && !(10 == \old(a21))) && !(8 == \old(a21))) || 0 <= \old(a12) + 42)) && a21 == 8) && 80 < a12) && ((a12 <= 228293 && a24 == \old(a24)) && !(9 == a15)) && 8 == \old(a15)) && !(6 == \old(a21)))) || !(1 == \old(a24))) || ((((a21 == 8 && a24 == 1) && 20 <= a12) && a12 <= 72) && a15 == 9) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 254 locations, 1 error locations. SAFE Result, 466.8s OverallTime, 18 OverallIterations, 18 TraceHistogramMax, 309.5s AutomataDifference, 0.0s DeadEndRemovalTime, 29.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 670 SDtfs, 32398 SDslu, 2593 SDs, 0 SdLazy, 52718 SolverSat, 6178 SolverUnsat, 62 SolverUnknown, 0 SolverNotchecked, 164.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 18966 GetRequests, 18383 SyntacticMatches, 15 SemanticMatches, 568 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 6887 ImplicationChecksByTransitivity, 204.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8180occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.9s AutomataMinimizationTime, 18 MinimizatonAttempts, 11208 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 437 PreInvPairs, 571 NumberOfFragments, 3115 HoareAnnotationTreeSize, 437 FomulaSimplifications, 393717 FormulaSimplificationTreeSizeReduction, 2.4s HoareSimplificationTime, 7 FomulaSimplificationsInter, 183958 FormulaSimplificationTreeSizeReductionInter, 26.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 1.0s SsaConstructionTime, 4.8s SatisfiabilityAnalysisTime, 95.8s InterpolantComputationTime, 36585 NumberOfCodeBlocks, 36585 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 36552 ConstructedInterpolants, 115 QuantifiedInterpolants, 171826417 SizeOfPredicates, 22 NumberOfNonLiveVariables, 25072 ConjunctsInSsa, 132 ConjunctsInUnsatCore, 33 InterpolantComputations, 6 PerfectInterpolantSequences, 167371/182582 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...