/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem02_label15.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 20:53:49,715 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 20:53:49,717 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 20:53:49,734 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 20:53:49,734 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 20:53:49,736 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 20:53:49,738 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 20:53:49,740 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 20:53:49,743 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 20:53:49,744 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 20:53:49,745 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 20:53:49,746 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 20:53:49,746 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 20:53:49,747 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 20:53:49,748 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 20:53:49,749 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 20:53:49,750 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 20:53:49,751 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 20:53:49,753 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 20:53:49,755 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 20:53:49,756 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 20:53:49,757 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 20:53:49,758 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 20:53:49,759 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 20:53:49,761 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 20:53:49,762 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 20:53:49,762 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 20:53:49,763 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 20:53:49,763 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 20:53:49,764 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 20:53:49,764 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 20:53:49,765 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 20:53:49,766 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 20:53:49,766 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 20:53:49,767 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 20:53:49,768 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 20:53:49,768 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 20:53:49,768 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 20:53:49,769 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 20:53:49,769 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 20:53:49,770 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 20:53:49,771 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-11-23 20:53:49,792 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 20:53:49,792 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 20:53:49,794 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-23 20:53:49,795 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-23 20:53:49,795 INFO L138 SettingsManager]: * Use SBE=true [2019-11-23 20:53:49,795 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 20:53:49,795 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 20:53:49,795 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 20:53:49,796 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 20:53:49,796 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 20:53:49,797 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 20:53:49,797 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 20:53:49,797 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 20:53:49,798 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-23 20:53:49,798 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 20:53:49,798 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 20:53:49,798 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-23 20:53:49,798 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 20:53:49,798 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 20:53:49,799 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-23 20:53:49,799 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 20:53:49,799 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 20:53:49,799 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 20:53:49,800 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 20:53:49,800 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 20:53:49,800 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 20:53:49,800 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-23 20:53:49,800 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 20:53:49,801 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 20:53:49,801 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 20:53:50,080 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 20:53:50,093 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 20:53:50,096 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 20:53:50,097 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 20:53:50,098 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 20:53:50,099 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem02_label15.c [2019-11-23 20:53:50,174 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/04c30fa52/3d650f1c5cdb42f8aece57fe11822b5d/FLAGfe5a350ae [2019-11-23 20:53:50,797 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 20:53:50,798 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem02_label15.c [2019-11-23 20:53:50,814 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/04c30fa52/3d650f1c5cdb42f8aece57fe11822b5d/FLAGfe5a350ae [2019-11-23 20:53:50,994 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/04c30fa52/3d650f1c5cdb42f8aece57fe11822b5d [2019-11-23 20:53:51,003 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 20:53:51,005 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 20:53:51,007 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 20:53:51,007 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 20:53:51,012 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 20:53:51,013 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:53:50" (1/1) ... [2019-11-23 20:53:51,016 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f6a1297 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:53:51, skipping insertion in model container [2019-11-23 20:53:51,016 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:53:50" (1/1) ... [2019-11-23 20:53:51,025 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 20:53:51,082 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 20:53:51,496 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 20:53:51,501 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 20:53:51,740 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 20:53:51,765 INFO L208 MainTranslator]: Completed translation [2019-11-23 20:53:51,765 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:53:51 WrapperNode [2019-11-23 20:53:51,766 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 20:53:51,767 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 20:53:51,767 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 20:53:51,767 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 20:53:51,776 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:53:51" (1/1) ... [2019-11-23 20:53:51,796 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:53:51" (1/1) ... [2019-11-23 20:53:51,850 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 20:53:51,850 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 20:53:51,850 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 20:53:51,850 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 20:53:51,858 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:53:51" (1/1) ... [2019-11-23 20:53:51,858 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:53:51" (1/1) ... [2019-11-23 20:53:51,868 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:53:51" (1/1) ... [2019-11-23 20:53:51,868 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:53:51" (1/1) ... [2019-11-23 20:53:51,904 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:53:51" (1/1) ... [2019-11-23 20:53:51,926 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:53:51" (1/1) ... [2019-11-23 20:53:51,937 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:53:51" (1/1) ... [2019-11-23 20:53:51,954 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 20:53:51,957 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 20:53:51,957 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 20:53:51,958 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 20:53:51,959 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:53:51" (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-11-23 20:53:52,039 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 20:53:52,040 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 20:53:53,343 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 20:53:53,344 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-23 20:53:53,345 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:53:53 BoogieIcfgContainer [2019-11-23 20:53:53,345 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 20:53:53,347 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 20:53:53,347 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 20:53:53,350 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 20:53:53,350 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 08:53:50" (1/3) ... [2019-11-23 20:53:53,351 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a71ee0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:53:53, skipping insertion in model container [2019-11-23 20:53:53,351 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:53:51" (2/3) ... [2019-11-23 20:53:53,352 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a71ee0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:53:53, skipping insertion in model container [2019-11-23 20:53:53,352 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:53:53" (3/3) ... [2019-11-23 20:53:53,354 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem02_label15.c [2019-11-23 20:53:53,364 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 20:53:53,372 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 20:53:53,385 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 20:53:53,413 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 20:53:53,413 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 20:53:53,414 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 20:53:53,414 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 20:53:53,414 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 20:53:53,414 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 20:53:53,414 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 20:53:53,415 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 20:53:53,438 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states. [2019-11-23 20:53:53,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-11-23 20:53:53,451 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:53:53,453 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-23 20:53:53,453 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:53:53,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:53:53,460 INFO L82 PathProgramCache]: Analyzing trace with hash -648019827, now seen corresponding path program 1 times [2019-11-23 20:53:53,470 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:53:53,471 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440538793] [2019-11-23 20:53:53,471 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:53:53,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:53:54,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:53:54,054 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440538793] [2019-11-23 20:53:54,056 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:53:54,056 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:53:54,058 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984923279] [2019-11-23 20:53:54,067 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 20:53:54,067 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:53:54,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 20:53:54,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:53:54,085 INFO L87 Difference]: Start difference. First operand 227 states. Second operand 4 states. [2019-11-23 20:53:55,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:53:55,387 INFO L93 Difference]: Finished difference Result 789 states and 1377 transitions. [2019-11-23 20:53:55,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 20:53:55,396 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 130 [2019-11-23 20:53:55,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:53:55,414 INFO L225 Difference]: With dead ends: 789 [2019-11-23 20:53:55,415 INFO L226 Difference]: Without dead ends: 465 [2019-11-23 20:53:55,420 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:53:55,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2019-11-23 20:53:55,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 309. [2019-11-23 20:53:55,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2019-11-23 20:53:55,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 453 transitions. [2019-11-23 20:53:55,484 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 453 transitions. Word has length 130 [2019-11-23 20:53:55,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:53:55,485 INFO L462 AbstractCegarLoop]: Abstraction has 309 states and 453 transitions. [2019-11-23 20:53:55,486 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 20:53:55,486 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 453 transitions. [2019-11-23 20:53:55,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-11-23 20:53:55,489 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:53:55,490 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:53:55,490 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:53:55,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:53:55,491 INFO L82 PathProgramCache]: Analyzing trace with hash 208795960, now seen corresponding path program 1 times [2019-11-23 20:53:55,491 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:53:55,491 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883681692] [2019-11-23 20:53:55,491 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:53:55,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:53:55,744 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:53:55,744 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883681692] [2019-11-23 20:53:55,745 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:53:55,745 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:53:55,745 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505576280] [2019-11-23 20:53:55,747 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 20:53:55,747 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:53:55,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 20:53:55,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:53:55,748 INFO L87 Difference]: Start difference. First operand 309 states and 453 transitions. Second operand 4 states. [2019-11-23 20:53:56,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:53:56,649 INFO L93 Difference]: Finished difference Result 980 states and 1479 transitions. [2019-11-23 20:53:56,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 20:53:56,650 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 134 [2019-11-23 20:53:56,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:53:56,654 INFO L225 Difference]: With dead ends: 980 [2019-11-23 20:53:56,655 INFO L226 Difference]: Without dead ends: 590 [2019-11-23 20:53:56,657 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:53:56,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2019-11-23 20:53:56,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 590. [2019-11-23 20:53:56,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 590 states. [2019-11-23 20:53:56,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 788 transitions. [2019-11-23 20:53:56,690 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 788 transitions. Word has length 134 [2019-11-23 20:53:56,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:53:56,690 INFO L462 AbstractCegarLoop]: Abstraction has 590 states and 788 transitions. [2019-11-23 20:53:56,690 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 20:53:56,690 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 788 transitions. [2019-11-23 20:53:56,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-11-23 20:53:56,696 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:53:56,696 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-23 20:53:56,697 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:53:56,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:53:56,697 INFO L82 PathProgramCache]: Analyzing trace with hash -402206747, now seen corresponding path program 1 times [2019-11-23 20:53:56,697 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:53:56,698 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053399260] [2019-11-23 20:53:56,698 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:53:56,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:53:56,773 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-23 20:53:56,774 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053399260] [2019-11-23 20:53:56,774 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:53:56,774 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:53:56,775 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360223901] [2019-11-23 20:53:56,775 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 20:53:56,776 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:53:56,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 20:53:56,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:53:56,776 INFO L87 Difference]: Start difference. First operand 590 states and 788 transitions. Second operand 4 states. [2019-11-23 20:53:57,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:53:57,779 INFO L93 Difference]: Finished difference Result 2306 states and 3087 transitions. [2019-11-23 20:53:57,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 20:53:57,780 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 160 [2019-11-23 20:53:57,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:53:57,789 INFO L225 Difference]: With dead ends: 2306 [2019-11-23 20:53:57,789 INFO L226 Difference]: Without dead ends: 1718 [2019-11-23 20:53:57,791 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:53:57,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1718 states. [2019-11-23 20:53:57,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1718 to 1572. [2019-11-23 20:53:57,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-11-23 20:53:57,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 1965 transitions. [2019-11-23 20:53:57,836 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 1965 transitions. Word has length 160 [2019-11-23 20:53:57,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:53:57,836 INFO L462 AbstractCegarLoop]: Abstraction has 1572 states and 1965 transitions. [2019-11-23 20:53:57,837 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 20:53:57,837 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 1965 transitions. [2019-11-23 20:53:57,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-11-23 20:53:57,842 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:53:57,843 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-23 20:53:57,843 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:53:57,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:53:57,843 INFO L82 PathProgramCache]: Analyzing trace with hash 864996295, now seen corresponding path program 1 times [2019-11-23 20:53:57,844 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:53:57,844 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688957261] [2019-11-23 20:53:57,844 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:53:57,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:53:57,943 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-23 20:53:57,943 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688957261] [2019-11-23 20:53:57,943 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:53:57,944 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 20:53:57,944 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626831043] [2019-11-23 20:53:57,945 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 20:53:57,945 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:53:57,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 20:53:57,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:53:57,945 INFO L87 Difference]: Start difference. First operand 1572 states and 1965 transitions. Second operand 4 states. [2019-11-23 20:53:58,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:53:58,980 INFO L93 Difference]: Finished difference Result 4277 states and 5403 transitions. [2019-11-23 20:53:58,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 20:53:58,981 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 168 [2019-11-23 20:53:58,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:53:58,998 INFO L225 Difference]: With dead ends: 4277 [2019-11-23 20:53:58,998 INFO L226 Difference]: Without dead ends: 2707 [2019-11-23 20:53:59,001 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:53:59,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2707 states. [2019-11-23 20:53:59,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2707 to 1855. [2019-11-23 20:53:59,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1855 states. [2019-11-23 20:53:59,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1855 states to 1855 states and 2281 transitions. [2019-11-23 20:53:59,050 INFO L78 Accepts]: Start accepts. Automaton has 1855 states and 2281 transitions. Word has length 168 [2019-11-23 20:53:59,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:53:59,051 INFO L462 AbstractCegarLoop]: Abstraction has 1855 states and 2281 transitions. [2019-11-23 20:53:59,051 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 20:53:59,051 INFO L276 IsEmpty]: Start isEmpty. Operand 1855 states and 2281 transitions. [2019-11-23 20:53:59,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-11-23 20:53:59,056 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:53:59,057 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-23 20:53:59,057 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:53:59,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:53:59,057 INFO L82 PathProgramCache]: Analyzing trace with hash 1353288396, now seen corresponding path program 1 times [2019-11-23 20:53:59,058 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:53:59,058 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378872835] [2019-11-23 20:53:59,058 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:53:59,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:53:59,196 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 45 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:53:59,196 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378872835] [2019-11-23 20:53:59,196 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [883069490] [2019-11-23 20:53:59,197 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:53:59,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:53:59,297 INFO L255 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-23 20:53:59,324 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:53:59,442 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2019-11-23 20:53:59,442 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-23 20:53:59,443 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2019-11-23 20:53:59,443 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620119690] [2019-11-23 20:53:59,443 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:53:59,444 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:53:59,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:53:59,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-11-23 20:53:59,445 INFO L87 Difference]: Start difference. First operand 1855 states and 2281 transitions. Second operand 3 states. [2019-11-23 20:54:00,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:54:00,078 INFO L93 Difference]: Finished difference Result 4267 states and 5231 transitions. [2019-11-23 20:54:00,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:54:00,079 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 171 [2019-11-23 20:54:00,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:54:00,095 INFO L225 Difference]: With dead ends: 4267 [2019-11-23 20:54:00,096 INFO L226 Difference]: Without dead ends: 2414 [2019-11-23 20:54:00,100 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-11-23 20:54:00,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2414 states. [2019-11-23 20:54:00,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2414 to 1994. [2019-11-23 20:54:00,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1994 states. [2019-11-23 20:54:00,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1994 states to 1994 states and 2442 transitions. [2019-11-23 20:54:00,166 INFO L78 Accepts]: Start accepts. Automaton has 1994 states and 2442 transitions. Word has length 171 [2019-11-23 20:54:00,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:54:00,168 INFO L462 AbstractCegarLoop]: Abstraction has 1994 states and 2442 transitions. [2019-11-23 20:54:00,169 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:54:00,169 INFO L276 IsEmpty]: Start isEmpty. Operand 1994 states and 2442 transitions. [2019-11-23 20:54:00,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-11-23 20:54:00,177 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:54:00,178 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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] [2019-11-23 20:54:00,382 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:54:00,383 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:54:00,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:54:00,384 INFO L82 PathProgramCache]: Analyzing trace with hash 141468647, now seen corresponding path program 1 times [2019-11-23 20:54:00,384 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:54:00,384 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26146331] [2019-11-23 20:54:00,385 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:54:00,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:54:00,476 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-23 20:54:00,476 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26146331] [2019-11-23 20:54:00,476 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:54:00,477 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:54:00,477 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552442692] [2019-11-23 20:54:00,478 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:54:00,478 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:54:00,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:54:00,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:54:00,478 INFO L87 Difference]: Start difference. First operand 1994 states and 2442 transitions. Second operand 3 states. [2019-11-23 20:54:01,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:54:01,051 INFO L93 Difference]: Finished difference Result 4272 states and 5182 transitions. [2019-11-23 20:54:01,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:54:01,051 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 181 [2019-11-23 20:54:01,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:54:01,063 INFO L225 Difference]: With dead ends: 4272 [2019-11-23 20:54:01,063 INFO L226 Difference]: Without dead ends: 2140 [2019-11-23 20:54:01,067 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:54:01,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2140 states. [2019-11-23 20:54:01,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2140 to 1994. [2019-11-23 20:54:01,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1994 states. [2019-11-23 20:54:01,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1994 states to 1994 states and 2341 transitions. [2019-11-23 20:54:01,110 INFO L78 Accepts]: Start accepts. Automaton has 1994 states and 2341 transitions. Word has length 181 [2019-11-23 20:54:01,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:54:01,111 INFO L462 AbstractCegarLoop]: Abstraction has 1994 states and 2341 transitions. [2019-11-23 20:54:01,111 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:54:01,111 INFO L276 IsEmpty]: Start isEmpty. Operand 1994 states and 2341 transitions. [2019-11-23 20:54:01,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-11-23 20:54:01,116 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:54:01,120 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-23 20:54:01,120 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:54:01,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:54:01,121 INFO L82 PathProgramCache]: Analyzing trace with hash -99265028, now seen corresponding path program 1 times [2019-11-23 20:54:01,122 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:54:01,123 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680249408] [2019-11-23 20:54:01,123 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:54:01,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:54:01,224 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-23 20:54:01,225 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680249408] [2019-11-23 20:54:01,225 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:54:01,225 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:54:01,226 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798251106] [2019-11-23 20:54:01,226 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:54:01,227 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:54:01,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:54:01,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:54:01,228 INFO L87 Difference]: Start difference. First operand 1994 states and 2341 transitions. Second operand 3 states. [2019-11-23 20:54:01,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:54:01,722 INFO L93 Difference]: Finished difference Result 4822 states and 5634 transitions. [2019-11-23 20:54:01,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:54:01,723 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 183 [2019-11-23 20:54:01,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:54:01,734 INFO L225 Difference]: With dead ends: 4822 [2019-11-23 20:54:01,734 INFO L226 Difference]: Without dead ends: 2129 [2019-11-23 20:54:01,738 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:54:01,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2129 states. [2019-11-23 20:54:01,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2129 to 1989. [2019-11-23 20:54:01,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1989 states. [2019-11-23 20:54:01,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1989 states to 1989 states and 2227 transitions. [2019-11-23 20:54:01,778 INFO L78 Accepts]: Start accepts. Automaton has 1989 states and 2227 transitions. Word has length 183 [2019-11-23 20:54:01,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:54:01,779 INFO L462 AbstractCegarLoop]: Abstraction has 1989 states and 2227 transitions. [2019-11-23 20:54:01,779 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:54:01,779 INFO L276 IsEmpty]: Start isEmpty. Operand 1989 states and 2227 transitions. [2019-11-23 20:54:01,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-11-23 20:54:01,784 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:54:01,785 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 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] [2019-11-23 20:54:01,785 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:54:01,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:54:01,785 INFO L82 PathProgramCache]: Analyzing trace with hash 1648518522, now seen corresponding path program 1 times [2019-11-23 20:54:01,786 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:54:01,786 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221128319] [2019-11-23 20:54:01,786 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:54:01,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:54:01,980 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 86 proven. 3 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-11-23 20:54:01,981 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221128319] [2019-11-23 20:54:01,981 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [98174780] [2019-11-23 20:54:01,981 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:54:02,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:54:02,070 INFO L255 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-23 20:54:02,073 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:54:02,120 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-11-23 20:54:02,121 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-23 20:54:02,121 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2019-11-23 20:54:02,121 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070586210] [2019-11-23 20:54:02,122 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:54:02,122 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:54:02,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:54:02,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-11-23 20:54:02,123 INFO L87 Difference]: Start difference. First operand 1989 states and 2227 transitions. Second operand 3 states. [2019-11-23 20:54:02,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:54:02,445 INFO L93 Difference]: Finished difference Result 3545 states and 3921 transitions. [2019-11-23 20:54:02,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:54:02,446 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 198 [2019-11-23 20:54:02,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:54:02,452 INFO L225 Difference]: With dead ends: 3545 [2019-11-23 20:54:02,452 INFO L226 Difference]: Without dead ends: 1274 [2019-11-23 20:54:02,456 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-11-23 20:54:02,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1274 states. [2019-11-23 20:54:02,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1274 to 1274. [2019-11-23 20:54:02,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1274 states. [2019-11-23 20:54:02,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1274 states to 1274 states and 1372 transitions. [2019-11-23 20:54:02,482 INFO L78 Accepts]: Start accepts. Automaton has 1274 states and 1372 transitions. Word has length 198 [2019-11-23 20:54:02,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:54:02,482 INFO L462 AbstractCegarLoop]: Abstraction has 1274 states and 1372 transitions. [2019-11-23 20:54:02,483 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:54:02,483 INFO L276 IsEmpty]: Start isEmpty. Operand 1274 states and 1372 transitions. [2019-11-23 20:54:02,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2019-11-23 20:54:02,488 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:54:02,488 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-23 20:54:02,692 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:54:02,693 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:54:02,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:54:02,693 INFO L82 PathProgramCache]: Analyzing trace with hash -1576967456, now seen corresponding path program 1 times [2019-11-23 20:54:02,693 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:54:02,694 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387375090] [2019-11-23 20:54:02,694 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:54:02,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:54:03,047 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:54:03,047 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387375090] [2019-11-23 20:54:03,048 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:54:03,048 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-23 20:54:03,049 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941770895] [2019-11-23 20:54:03,050 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-23 20:54:03,050 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:54:03,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-23 20:54:03,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-11-23 20:54:03,051 INFO L87 Difference]: Start difference. First operand 1274 states and 1372 transitions. Second operand 7 states. [2019-11-23 20:54:04,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:54:04,322 INFO L93 Difference]: Finished difference Result 2710 states and 2934 transitions. [2019-11-23 20:54:04,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-23 20:54:04,323 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 203 [2019-11-23 20:54:04,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:54:04,330 INFO L225 Difference]: With dead ends: 2710 [2019-11-23 20:54:04,330 INFO L226 Difference]: Without dead ends: 1295 [2019-11-23 20:54:04,332 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-11-23 20:54:04,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1295 states. [2019-11-23 20:54:04,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1295 to 1274. [2019-11-23 20:54:04,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1274 states. [2019-11-23 20:54:04,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1274 states to 1274 states and 1333 transitions. [2019-11-23 20:54:04,356 INFO L78 Accepts]: Start accepts. Automaton has 1274 states and 1333 transitions. Word has length 203 [2019-11-23 20:54:04,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:54:04,357 INFO L462 AbstractCegarLoop]: Abstraction has 1274 states and 1333 transitions. [2019-11-23 20:54:04,357 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-23 20:54:04,357 INFO L276 IsEmpty]: Start isEmpty. Operand 1274 states and 1333 transitions. [2019-11-23 20:54:04,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2019-11-23 20:54:04,361 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:54:04,362 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-23 20:54:04,362 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:54:04,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:54:04,362 INFO L82 PathProgramCache]: Analyzing trace with hash -473711658, now seen corresponding path program 1 times [2019-11-23 20:54:04,363 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:54:04,363 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347581618] [2019-11-23 20:54:04,363 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:54:04,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:54:04,531 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:54:04,532 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347581618] [2019-11-23 20:54:04,532 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:54:04,532 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 20:54:04,533 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991484026] [2019-11-23 20:54:04,533 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 20:54:04,534 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:54:04,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 20:54:04,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:54:04,535 INFO L87 Difference]: Start difference. First operand 1274 states and 1333 transitions. Second operand 4 states. [2019-11-23 20:54:05,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:54:05,245 INFO L93 Difference]: Finished difference Result 2688 states and 2810 transitions. [2019-11-23 20:54:05,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 20:54:05,246 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 207 [2019-11-23 20:54:05,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:54:05,252 INFO L225 Difference]: With dead ends: 2688 [2019-11-23 20:54:05,252 INFO L226 Difference]: Without dead ends: 1416 [2019-11-23 20:54:05,254 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:54:05,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1416 states. [2019-11-23 20:54:05,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1416 to 1274. [2019-11-23 20:54:05,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1274 states. [2019-11-23 20:54:05,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1274 states to 1274 states and 1316 transitions. [2019-11-23 20:54:05,275 INFO L78 Accepts]: Start accepts. Automaton has 1274 states and 1316 transitions. Word has length 207 [2019-11-23 20:54:05,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:54:05,276 INFO L462 AbstractCegarLoop]: Abstraction has 1274 states and 1316 transitions. [2019-11-23 20:54:05,276 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 20:54:05,276 INFO L276 IsEmpty]: Start isEmpty. Operand 1274 states and 1316 transitions. [2019-11-23 20:54:05,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2019-11-23 20:54:05,280 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:54:05,280 INFO L410 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-23 20:54:05,281 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:54:05,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:54:05,281 INFO L82 PathProgramCache]: Analyzing trace with hash 283278328, now seen corresponding path program 1 times [2019-11-23 20:54:05,281 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:54:05,282 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142568016] [2019-11-23 20:54:05,282 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:54:05,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:54:05,411 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-11-23 20:54:05,411 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142568016] [2019-11-23 20:54:05,411 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:54:05,411 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 20:54:05,412 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590467662] [2019-11-23 20:54:05,412 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 20:54:05,412 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:54:05,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 20:54:05,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:54:05,413 INFO L87 Difference]: Start difference. First operand 1274 states and 1316 transitions. Second operand 4 states. [2019-11-23 20:54:06,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:54:06,118 INFO L93 Difference]: Finished difference Result 2543 states and 2631 transitions. [2019-11-23 20:54:06,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 20:54:06,119 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 228 [2019-11-23 20:54:06,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:54:06,120 INFO L225 Difference]: With dead ends: 2543 [2019-11-23 20:54:06,120 INFO L226 Difference]: Without dead ends: 0 [2019-11-23 20:54:06,123 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:54:06,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-23 20:54:06,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-23 20:54:06,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-23 20:54:06,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-23 20:54:06,123 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 228 [2019-11-23 20:54:06,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:54:06,124 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-23 20:54:06,124 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 20:54:06,124 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-23 20:54:06,124 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-23 20:54:06,129 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-23 20:54:06,759 WARN L192 SmtUtils]: Spent 473.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 53 [2019-11-23 20:54:07,217 WARN L192 SmtUtils]: Spent 454.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 53 [2019-11-23 20:54:07,221 INFO L444 ceAbstractionStarter]: For program point L564-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:54:07,222 INFO L444 ceAbstractionStarter]: For program point L498-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:54:07,222 INFO L444 ceAbstractionStarter]: For program point L432-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:54:07,222 INFO L444 ceAbstractionStarter]: For program point L234(lines 234 413) no Hoare annotation was computed. [2019-11-23 20:54:07,222 INFO L444 ceAbstractionStarter]: For program point L565(line 565) no Hoare annotation was computed. [2019-11-23 20:54:07,222 INFO L444 ceAbstractionStarter]: For program point L499(line 499) no Hoare annotation was computed. [2019-11-23 20:54:07,222 INFO L444 ceAbstractionStarter]: For program point L433(line 433) no Hoare annotation was computed. [2019-11-23 20:54:07,222 INFO L444 ceAbstractionStarter]: For program point L169(lines 169 413) no Hoare annotation was computed. [2019-11-23 20:54:07,222 INFO L444 ceAbstractionStarter]: For program point L368(lines 368 413) no Hoare annotation was computed. [2019-11-23 20:54:07,223 INFO L444 ceAbstractionStarter]: For program point L38(lines 38 413) no Hoare annotation was computed. [2019-11-23 20:54:07,223 INFO L444 ceAbstractionStarter]: For program point L567-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:54:07,223 INFO L444 ceAbstractionStarter]: For program point L501-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:54:07,223 INFO L444 ceAbstractionStarter]: For program point L435-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:54:07,223 INFO L444 ceAbstractionStarter]: For program point L237(lines 237 413) no Hoare annotation was computed. [2019-11-23 20:54:07,223 INFO L444 ceAbstractionStarter]: For program point L568(line 568) no Hoare annotation was computed. [2019-11-23 20:54:07,223 INFO L444 ceAbstractionStarter]: For program point L502(line 502) no Hoare annotation was computed. [2019-11-23 20:54:07,223 INFO L444 ceAbstractionStarter]: For program point L436(line 436) no Hoare annotation was computed. [2019-11-23 20:54:07,223 INFO L444 ceAbstractionStarter]: For program point L238(lines 238 246) no Hoare annotation was computed. [2019-11-23 20:54:07,224 INFO L444 ceAbstractionStarter]: For program point L238-2(lines 238 246) no Hoare annotation was computed. [2019-11-23 20:54:07,224 INFO L444 ceAbstractionStarter]: For program point L106(lines 106 413) no Hoare annotation was computed. [2019-11-23 20:54:07,224 INFO L444 ceAbstractionStarter]: For program point L570-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:54:07,224 INFO L444 ceAbstractionStarter]: For program point L504-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:54:07,224 INFO L444 ceAbstractionStarter]: For program point L438-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:54:07,224 INFO L444 ceAbstractionStarter]: For program point L42(lines 42 413) no Hoare annotation was computed. [2019-11-23 20:54:07,224 INFO L444 ceAbstractionStarter]: For program point L571(line 571) no Hoare annotation was computed. [2019-11-23 20:54:07,224 INFO L444 ceAbstractionStarter]: For program point L505(line 505) no Hoare annotation was computed. [2019-11-23 20:54:07,225 INFO L444 ceAbstractionStarter]: For program point L439(line 439) no Hoare annotation was computed. [2019-11-23 20:54:07,225 INFO L444 ceAbstractionStarter]: For program point L175(lines 175 413) no Hoare annotation was computed. [2019-11-23 20:54:07,225 INFO L444 ceAbstractionStarter]: For program point L573-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:54:07,225 INFO L444 ceAbstractionStarter]: For program point L507-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:54:07,225 INFO L444 ceAbstractionStarter]: For program point L441-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:54:07,225 INFO L444 ceAbstractionStarter]: For program point L375(lines 375 413) no Hoare annotation was computed. [2019-11-23 20:54:07,225 INFO L444 ceAbstractionStarter]: For program point L309(lines 309 413) no Hoare annotation was computed. [2019-11-23 20:54:07,225 INFO L444 ceAbstractionStarter]: For program point L574(line 574) no Hoare annotation was computed. [2019-11-23 20:54:07,225 INFO L444 ceAbstractionStarter]: For program point L508(line 508) no Hoare annotation was computed. [2019-11-23 20:54:07,226 INFO L444 ceAbstractionStarter]: For program point L442(line 442) no Hoare annotation was computed. [2019-11-23 20:54:07,226 INFO L444 ceAbstractionStarter]: For program point L179(lines 179 413) no Hoare annotation was computed. [2019-11-23 20:54:07,226 INFO L444 ceAbstractionStarter]: For program point L113(lines 113 413) no Hoare annotation was computed. [2019-11-23 20:54:07,226 INFO L444 ceAbstractionStarter]: For program point L47(lines 47 413) no Hoare annotation was computed. [2019-11-23 20:54:07,226 INFO L444 ceAbstractionStarter]: For program point L576-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:54:07,226 INFO L444 ceAbstractionStarter]: For program point L510-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:54:07,226 INFO L444 ceAbstractionStarter]: For program point L444-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:54:07,226 INFO L444 ceAbstractionStarter]: For program point L378(lines 378 413) no Hoare annotation was computed. [2019-11-23 20:54:07,226 INFO L444 ceAbstractionStarter]: For program point L577(line 577) no Hoare annotation was computed. [2019-11-23 20:54:07,226 INFO L444 ceAbstractionStarter]: For program point L511(line 511) no Hoare annotation was computed. [2019-11-23 20:54:07,226 INFO L444 ceAbstractionStarter]: For program point L445(line 445) no Hoare annotation was computed. [2019-11-23 20:54:07,226 INFO L444 ceAbstractionStarter]: For program point L380(lines 380 413) no Hoare annotation was computed. [2019-11-23 20:54:07,226 INFO L444 ceAbstractionStarter]: For program point L314(lines 314 413) no Hoare annotation was computed. [2019-11-23 20:54:07,226 INFO L444 ceAbstractionStarter]: For program point L248(lines 248 413) no Hoare annotation was computed. [2019-11-23 20:54:07,227 INFO L444 ceAbstractionStarter]: For program point L50(lines 50 413) no Hoare annotation was computed. [2019-11-23 20:54:07,227 INFO L444 ceAbstractionStarter]: For program point L579-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:54:07,227 INFO L444 ceAbstractionStarter]: For program point L513-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:54:07,227 INFO L444 ceAbstractionStarter]: For program point L447-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:54:07,227 INFO L444 ceAbstractionStarter]: For program point L381(lines 381 387) no Hoare annotation was computed. [2019-11-23 20:54:07,227 INFO L444 ceAbstractionStarter]: For program point L315(lines 315 326) no Hoare annotation was computed. [2019-11-23 20:54:07,227 INFO L444 ceAbstractionStarter]: For program point L381-2(lines 381 387) no Hoare annotation was computed. [2019-11-23 20:54:07,227 INFO L444 ceAbstractionStarter]: For program point L315-2(lines 315 326) no Hoare annotation was computed. [2019-11-23 20:54:07,227 INFO L444 ceAbstractionStarter]: For program point L580(line 580) no Hoare annotation was computed. [2019-11-23 20:54:07,227 INFO L444 ceAbstractionStarter]: For program point L514(line 514) no Hoare annotation was computed. [2019-11-23 20:54:07,227 INFO L444 ceAbstractionStarter]: For program point L448(line 448) no Hoare annotation was computed. [2019-11-23 20:54:07,227 INFO L444 ceAbstractionStarter]: For program point L185(lines 185 413) no Hoare annotation was computed. [2019-11-23 20:54:07,227 INFO L444 ceAbstractionStarter]: For program point L119(lines 119 413) no Hoare annotation was computed. [2019-11-23 20:54:07,228 INFO L444 ceAbstractionStarter]: For program point L582-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:54:07,228 INFO L444 ceAbstractionStarter]: For program point L516-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:54:07,228 INFO L444 ceAbstractionStarter]: For program point L450-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:54:07,228 INFO L444 ceAbstractionStarter]: For program point L54(lines 54 413) no Hoare annotation was computed. [2019-11-23 20:54:07,228 INFO L444 ceAbstractionStarter]: For program point L583(line 583) no Hoare annotation was computed. [2019-11-23 20:54:07,228 INFO L444 ceAbstractionStarter]: For program point L517(line 517) no Hoare annotation was computed. [2019-11-23 20:54:07,228 INFO L444 ceAbstractionStarter]: For program point L451(line 451) no Hoare annotation was computed. [2019-11-23 20:54:07,228 INFO L444 ceAbstractionStarter]: For program point L253(lines 253 413) no Hoare annotation was computed. [2019-11-23 20:54:07,228 INFO L444 ceAbstractionStarter]: For program point L187(lines 187 413) no Hoare annotation was computed. [2019-11-23 20:54:07,228 INFO L444 ceAbstractionStarter]: For program point L585-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:54:07,229 INFO L444 ceAbstractionStarter]: For program point L519-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:54:07,229 INFO L444 ceAbstractionStarter]: For program point L453-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:54:07,229 INFO L444 ceAbstractionStarter]: For program point L189(lines 189 413) no Hoare annotation was computed. [2019-11-23 20:54:07,229 INFO L444 ceAbstractionStarter]: For program point L123(lines 123 413) no Hoare annotation was computed. [2019-11-23 20:54:07,229 INFO L444 ceAbstractionStarter]: For program point L586(line 586) no Hoare annotation was computed. [2019-11-23 20:54:07,229 INFO L444 ceAbstractionStarter]: For program point L520(line 520) no Hoare annotation was computed. [2019-11-23 20:54:07,229 INFO L444 ceAbstractionStarter]: For program point L454(line 454) no Hoare annotation was computed. [2019-11-23 20:54:07,229 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-23 20:54:07,229 INFO L444 ceAbstractionStarter]: For program point L389(lines 389 413) no Hoare annotation was computed. [2019-11-23 20:54:07,229 INFO L444 ceAbstractionStarter]: For program point L191(lines 191 413) no Hoare annotation was computed. [2019-11-23 20:54:07,229 INFO L444 ceAbstractionStarter]: For program point L59(lines 59 413) no Hoare annotation was computed. [2019-11-23 20:54:07,229 INFO L444 ceAbstractionStarter]: For program point L588-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:54:07,229 INFO L444 ceAbstractionStarter]: For program point L522-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:54:07,230 INFO L444 ceAbstractionStarter]: For program point L456-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:54:07,230 INFO L444 ceAbstractionStarter]: For program point L589(line 589) no Hoare annotation was computed. [2019-11-23 20:54:07,230 INFO L444 ceAbstractionStarter]: For program point L523(line 523) no Hoare annotation was computed. [2019-11-23 20:54:07,230 INFO L444 ceAbstractionStarter]: For program point L457(line 457) no Hoare annotation was computed. [2019-11-23 20:54:07,230 INFO L444 ceAbstractionStarter]: For program point L259(lines 259 413) no Hoare annotation was computed. [2019-11-23 20:54:07,230 INFO L444 ceAbstractionStarter]: For program point L194(lines 194 413) no Hoare annotation was computed. [2019-11-23 20:54:07,230 INFO L444 ceAbstractionStarter]: For program point L591-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:54:07,230 INFO L444 ceAbstractionStarter]: For program point L525-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:54:07,230 INFO L444 ceAbstractionStarter]: For program point L459-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:54:07,230 INFO L444 ceAbstractionStarter]: For program point L261(lines 261 413) no Hoare annotation was computed. [2019-11-23 20:54:07,230 INFO L444 ceAbstractionStarter]: For program point L592(line 592) no Hoare annotation was computed. [2019-11-23 20:54:07,230 INFO L444 ceAbstractionStarter]: For program point L526(line 526) no Hoare annotation was computed. [2019-11-23 20:54:07,230 INFO L444 ceAbstractionStarter]: For program point L460(line 460) no Hoare annotation was computed. [2019-11-23 20:54:07,230 INFO L444 ceAbstractionStarter]: For program point L394(lines 394 413) no Hoare annotation was computed. [2019-11-23 20:54:07,231 INFO L444 ceAbstractionStarter]: For program point L328(lines 328 413) no Hoare annotation was computed. [2019-11-23 20:54:07,231 INFO L444 ceAbstractionStarter]: For program point L262(lines 262 274) no Hoare annotation was computed. [2019-11-23 20:54:07,231 INFO L444 ceAbstractionStarter]: For program point L262-2(lines 262 274) no Hoare annotation was computed. [2019-11-23 20:54:07,231 INFO L444 ceAbstractionStarter]: For program point L130(lines 130 413) no Hoare annotation was computed. [2019-11-23 20:54:07,231 INFO L444 ceAbstractionStarter]: For program point L65(lines 65 413) no Hoare annotation was computed. [2019-11-23 20:54:07,231 INFO L444 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-23 20:54:07,231 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 562) no Hoare annotation was computed. [2019-11-23 20:54:07,231 INFO L444 ceAbstractionStarter]: For program point L594-1(lines 594 596) no Hoare annotation was computed. [2019-11-23 20:54:07,231 INFO L444 ceAbstractionStarter]: For program point L528-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:54:07,231 INFO L444 ceAbstractionStarter]: For program point L462-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:54:07,231 INFO L444 ceAbstractionStarter]: For program point L198(lines 198 413) no Hoare annotation was computed. [2019-11-23 20:54:07,231 INFO L444 ceAbstractionStarter]: For program point L595(line 595) no Hoare annotation was computed. [2019-11-23 20:54:07,232 INFO L444 ceAbstractionStarter]: For program point L529(line 529) no Hoare annotation was computed. [2019-11-23 20:54:07,232 INFO L444 ceAbstractionStarter]: For program point L463(line 463) no Hoare annotation was computed. [2019-11-23 20:54:07,232 INFO L444 ceAbstractionStarter]: For program point L331(lines 331 413) no Hoare annotation was computed. [2019-11-23 20:54:07,232 INFO L444 ceAbstractionStarter]: For program point L398(lines 398 413) no Hoare annotation was computed. [2019-11-23 20:54:07,232 INFO L444 ceAbstractionStarter]: For program point L332(lines 332 335) no Hoare annotation was computed. [2019-11-23 20:54:07,232 INFO L444 ceAbstractionStarter]: For program point L332-2(lines 332 335) no Hoare annotation was computed. [2019-11-23 20:54:07,232 INFO L444 ceAbstractionStarter]: For program point L134(lines 134 413) no Hoare annotation was computed. [2019-11-23 20:54:07,233 INFO L440 ceAbstractionStarter]: At program point L597(lines 29 598) the Hoare annotation is: (let ((.cse7 (= ~a25~0 1)) (.cse5 (= ~a19~0 1))) (let ((.cse11 (= ~a28~0 9)) (.cse14 (= ~a28~0 10)) (.cse0 (not .cse5)) (.cse12 (not .cse7)) (.cse3 (not (= ~a28~0 11)))) (let ((.cse9 (or (and (<= ~a19~0 0) .cse12) (and .cse0 .cse12 .cse3))) (.cse13 (= ~a28~0 7)) (.cse4 (= ~a17~0 8)) (.cse6 (= ~a21~0 1)) (.cse10 (not .cse14)) (.cse1 (<= 8 ~a17~0)) (.cse8 (<= ~a17~0 8)) (.cse15 (not .cse11)) (.cse2 (= ~a11~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6 .cse7) (and .cse8 .cse9 .cse10) (and .cse11 .cse12 .cse4 .cse6) (and .cse4 .cse13 .cse6) (and .cse2 .cse9) (and .cse13 .cse8 .cse2) (and (not (= 5 ULTIMATE.start_calculate_output_~input)) .cse14 .cse4 .cse5 .cse6) (and .cse12 .cse8 .cse2) (and .cse1 .cse8 .cse7 .cse15 .cse3 .cse10) (and .cse0 .cse1 .cse8 .cse7 .cse15 .cse3) (and .cse11 .cse0 .cse2 .cse3))))) [2019-11-23 20:54:07,233 INFO L444 ceAbstractionStarter]: For program point L531-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:54:07,233 INFO L444 ceAbstractionStarter]: For program point L465-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:54:07,233 INFO L444 ceAbstractionStarter]: For program point L69(lines 69 413) no Hoare annotation was computed. [2019-11-23 20:54:07,233 INFO L444 ceAbstractionStarter]: For program point L532(line 532) no Hoare annotation was computed. [2019-11-23 20:54:07,233 INFO L444 ceAbstractionStarter]: For program point L466(line 466) no Hoare annotation was computed. [2019-11-23 20:54:07,233 INFO L444 ceAbstractionStarter]: For program point L202(lines 202 413) no Hoare annotation was computed. [2019-11-23 20:54:07,233 INFO L444 ceAbstractionStarter]: For program point L203(lines 203 210) no Hoare annotation was computed. [2019-11-23 20:54:07,234 INFO L444 ceAbstractionStarter]: For program point L203-2(lines 203 210) no Hoare annotation was computed. [2019-11-23 20:54:07,234 INFO L447 ceAbstractionStarter]: At program point L600(lines 600 617) the Hoare annotation is: true [2019-11-23 20:54:07,234 INFO L444 ceAbstractionStarter]: For program point L534-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:54:07,234 INFO L444 ceAbstractionStarter]: For program point L468-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:54:07,234 INFO L444 ceAbstractionStarter]: For program point L402(lines 402 413) no Hoare annotation was computed. [2019-11-23 20:54:07,234 INFO L444 ceAbstractionStarter]: For program point L535(line 535) no Hoare annotation was computed. [2019-11-23 20:54:07,234 INFO L444 ceAbstractionStarter]: For program point L469(line 469) no Hoare annotation was computed. [2019-11-23 20:54:07,234 INFO L444 ceAbstractionStarter]: For program point L337(lines 337 413) no Hoare annotation was computed. [2019-11-23 20:54:07,234 INFO L444 ceAbstractionStarter]: For program point L139(lines 139 413) no Hoare annotation was computed. [2019-11-23 20:54:07,235 INFO L444 ceAbstractionStarter]: For program point L404(lines 404 413) no Hoare annotation was computed. [2019-11-23 20:54:07,235 INFO L444 ceAbstractionStarter]: For program point L338(lines 338 347) no Hoare annotation was computed. [2019-11-23 20:54:07,235 INFO L444 ceAbstractionStarter]: For program point L338-2(lines 338 347) no Hoare annotation was computed. [2019-11-23 20:54:07,235 INFO L444 ceAbstractionStarter]: For program point L74(lines 74 413) no Hoare annotation was computed. [2019-11-23 20:54:07,235 INFO L444 ceAbstractionStarter]: For program point L537-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:54:07,235 INFO L444 ceAbstractionStarter]: For program point L471-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:54:07,235 INFO L444 ceAbstractionStarter]: For program point L75(lines 75 80) no Hoare annotation was computed. [2019-11-23 20:54:07,235 INFO L444 ceAbstractionStarter]: For program point L75-2(lines 75 80) no Hoare annotation was computed. [2019-11-23 20:54:07,235 INFO L444 ceAbstractionStarter]: For program point L538(line 538) no Hoare annotation was computed. [2019-11-23 20:54:07,235 INFO L444 ceAbstractionStarter]: For program point L472(line 472) no Hoare annotation was computed. [2019-11-23 20:54:07,236 INFO L444 ceAbstractionStarter]: For program point L407(lines 407 413) no Hoare annotation was computed. [2019-11-23 20:54:07,236 INFO L444 ceAbstractionStarter]: For program point L143(lines 143 413) no Hoare annotation was computed. [2019-11-23 20:54:07,236 INFO L440 ceAbstractionStarter]: At program point L606-2(lines 606 616) the Hoare annotation is: (let ((.cse7 (= ~a25~0 1)) (.cse5 (= ~a19~0 1))) (let ((.cse11 (= ~a28~0 9)) (.cse14 (= ~a28~0 10)) (.cse0 (not .cse5)) (.cse12 (not .cse7)) (.cse3 (not (= ~a28~0 11)))) (let ((.cse9 (or (and (<= ~a19~0 0) .cse12) (and .cse0 .cse12 .cse3))) (.cse13 (= ~a28~0 7)) (.cse4 (= ~a17~0 8)) (.cse6 (= ~a21~0 1)) (.cse10 (not .cse14)) (.cse1 (<= 8 ~a17~0)) (.cse8 (<= ~a17~0 8)) (.cse15 (not .cse11)) (.cse2 (= ~a11~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6 .cse7) (and .cse8 .cse9 .cse10) (and .cse11 .cse12 .cse4 .cse6) (and .cse4 .cse13 .cse6) (and .cse2 .cse9) (and .cse13 .cse8 .cse2) (and (not (= 5 ULTIMATE.start_calculate_output_~input)) .cse14 .cse4 .cse5 .cse6) (and .cse12 .cse8 .cse2) (and .cse1 .cse8 .cse7 .cse15 .cse3 .cse10) (and .cse0 .cse1 .cse8 .cse7 .cse15 .cse3) (and .cse11 .cse0 .cse2 .cse3))))) [2019-11-23 20:54:07,236 INFO L444 ceAbstractionStarter]: For program point L540-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:54:07,236 INFO L444 ceAbstractionStarter]: For program point L474-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:54:07,236 INFO L444 ceAbstractionStarter]: For program point L276(lines 276 413) no Hoare annotation was computed. [2019-11-23 20:54:07,236 INFO L444 ceAbstractionStarter]: For program point L541(line 541) no Hoare annotation was computed. [2019-11-23 20:54:07,237 INFO L444 ceAbstractionStarter]: For program point L475(line 475) no Hoare annotation was computed. [2019-11-23 20:54:07,237 INFO L444 ceAbstractionStarter]: For program point L409(lines 409 413) no Hoare annotation was computed. [2019-11-23 20:54:07,237 INFO L444 ceAbstractionStarter]: For program point L212(lines 212 413) no Hoare annotation was computed. [2019-11-23 20:54:07,237 INFO L444 ceAbstractionStarter]: For program point L543-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:54:07,237 INFO L444 ceAbstractionStarter]: For program point L477-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:54:07,237 INFO L444 ceAbstractionStarter]: For program point L544(line 544) no Hoare annotation was computed. [2019-11-23 20:54:07,237 INFO L444 ceAbstractionStarter]: For program point L478(line 478) no Hoare annotation was computed. [2019-11-23 20:54:07,237 INFO L444 ceAbstractionStarter]: For program point L280(lines 280 413) no Hoare annotation was computed. [2019-11-23 20:54:07,237 INFO L444 ceAbstractionStarter]: For program point L148(lines 148 413) no Hoare annotation was computed. [2019-11-23 20:54:07,237 INFO L444 ceAbstractionStarter]: For program point L82(lines 82 413) no Hoare annotation was computed. [2019-11-23 20:54:07,238 INFO L444 ceAbstractionStarter]: For program point L611(line 611) no Hoare annotation was computed. [2019-11-23 20:54:07,238 INFO L444 ceAbstractionStarter]: For program point L215(lines 215 413) no Hoare annotation was computed. [2019-11-23 20:54:07,238 INFO L444 ceAbstractionStarter]: For program point L83(lines 83 89) no Hoare annotation was computed. [2019-11-23 20:54:07,238 INFO L444 ceAbstractionStarter]: For program point L83-2(lines 83 89) no Hoare annotation was computed. [2019-11-23 20:54:07,238 INFO L444 ceAbstractionStarter]: For program point L546-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:54:07,238 INFO L444 ceAbstractionStarter]: For program point L480-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:54:07,238 INFO L444 ceAbstractionStarter]: For program point L414(lines 414 416) no Hoare annotation was computed. [2019-11-23 20:54:07,238 INFO L444 ceAbstractionStarter]: For program point L414-2(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:54:07,238 INFO L444 ceAbstractionStarter]: For program point L547(line 547) no Hoare annotation was computed. [2019-11-23 20:54:07,238 INFO L444 ceAbstractionStarter]: For program point L481(line 481) no Hoare annotation was computed. [2019-11-23 20:54:07,239 INFO L444 ceAbstractionStarter]: For program point L415(line 415) no Hoare annotation was computed. [2019-11-23 20:54:07,239 INFO L444 ceAbstractionStarter]: For program point L349(lines 349 413) no Hoare annotation was computed. [2019-11-23 20:54:07,239 INFO L444 ceAbstractionStarter]: For program point L283(lines 283 413) no Hoare annotation was computed. [2019-11-23 20:54:07,239 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-23 20:54:07,239 INFO L444 ceAbstractionStarter]: For program point L218(lines 218 413) no Hoare annotation was computed. [2019-11-23 20:54:07,239 INFO L444 ceAbstractionStarter]: For program point L549-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:54:07,239 INFO L444 ceAbstractionStarter]: For program point L483-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:54:07,239 INFO L444 ceAbstractionStarter]: For program point L417-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:54:07,239 INFO L444 ceAbstractionStarter]: For program point L550(line 550) no Hoare annotation was computed. [2019-11-23 20:54:07,240 INFO L444 ceAbstractionStarter]: For program point L484(line 484) no Hoare annotation was computed. [2019-11-23 20:54:07,240 INFO L444 ceAbstractionStarter]: For program point L418(line 418) no Hoare annotation was computed. [2019-11-23 20:54:07,240 INFO L444 ceAbstractionStarter]: For program point L286(lines 286 413) no Hoare annotation was computed. [2019-11-23 20:54:07,240 INFO L444 ceAbstractionStarter]: For program point L154(lines 154 413) no Hoare annotation was computed. [2019-11-23 20:54:07,240 INFO L444 ceAbstractionStarter]: For program point L552-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:54:07,240 INFO L444 ceAbstractionStarter]: For program point L486-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:54:07,240 INFO L444 ceAbstractionStarter]: For program point L420-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:54:07,240 INFO L444 ceAbstractionStarter]: For program point L354(lines 354 413) no Hoare annotation was computed. [2019-11-23 20:54:07,240 INFO L444 ceAbstractionStarter]: For program point L553(line 553) no Hoare annotation was computed. [2019-11-23 20:54:07,241 INFO L444 ceAbstractionStarter]: For program point L487(line 487) no Hoare annotation was computed. [2019-11-23 20:54:07,241 INFO L444 ceAbstractionStarter]: For program point L421(line 421) no Hoare annotation was computed. [2019-11-23 20:54:07,241 INFO L444 ceAbstractionStarter]: For program point L223(lines 223 413) no Hoare annotation was computed. [2019-11-23 20:54:07,241 INFO L444 ceAbstractionStarter]: For program point L91(lines 91 413) no Hoare annotation was computed. [2019-11-23 20:54:07,241 INFO L444 ceAbstractionStarter]: For program point L555-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:54:07,241 INFO L444 ceAbstractionStarter]: For program point L489-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:54:07,241 INFO L444 ceAbstractionStarter]: For program point L423-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:54:07,241 INFO L444 ceAbstractionStarter]: For program point L291(lines 291 413) no Hoare annotation was computed. [2019-11-23 20:54:07,241 INFO L444 ceAbstractionStarter]: For program point L225(lines 225 413) no Hoare annotation was computed. [2019-11-23 20:54:07,241 INFO L444 ceAbstractionStarter]: For program point L159(lines 159 413) no Hoare annotation was computed. [2019-11-23 20:54:07,242 INFO L444 ceAbstractionStarter]: For program point L556(line 556) no Hoare annotation was computed. [2019-11-23 20:54:07,242 INFO L444 ceAbstractionStarter]: For program point L490(line 490) no Hoare annotation was computed. [2019-11-23 20:54:07,242 INFO L444 ceAbstractionStarter]: For program point L424(line 424) no Hoare annotation was computed. [2019-11-23 20:54:07,242 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-23 20:54:07,242 INFO L444 ceAbstractionStarter]: For program point L293(lines 293 413) no Hoare annotation was computed. [2019-11-23 20:54:07,242 INFO L444 ceAbstractionStarter]: For program point L95(lines 95 413) no Hoare annotation was computed. [2019-11-23 20:54:07,242 INFO L444 ceAbstractionStarter]: For program point L558-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:54:07,242 INFO L444 ceAbstractionStarter]: For program point L492-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:54:07,242 INFO L444 ceAbstractionStarter]: For program point L426-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:54:07,243 INFO L444 ceAbstractionStarter]: For program point L30(lines 30 413) no Hoare annotation was computed. [2019-11-23 20:54:07,243 INFO L444 ceAbstractionStarter]: For program point L559(line 559) no Hoare annotation was computed. [2019-11-23 20:54:07,243 INFO L444 ceAbstractionStarter]: For program point L493(line 493) no Hoare annotation was computed. [2019-11-23 20:54:07,243 INFO L444 ceAbstractionStarter]: For program point L427(line 427) no Hoare annotation was computed. [2019-11-23 20:54:07,243 INFO L444 ceAbstractionStarter]: For program point L361(lines 361 413) no Hoare annotation was computed. [2019-11-23 20:54:07,243 INFO L444 ceAbstractionStarter]: For program point L561-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:54:07,243 INFO L444 ceAbstractionStarter]: For program point L495-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:54:07,243 INFO L444 ceAbstractionStarter]: For program point L429-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:54:07,243 INFO L444 ceAbstractionStarter]: For program point L297(lines 297 413) no Hoare annotation was computed. [2019-11-23 20:54:07,244 INFO L444 ceAbstractionStarter]: For program point L165(lines 165 413) no Hoare annotation was computed. [2019-11-23 20:54:07,244 INFO L444 ceAbstractionStarter]: For program point L99(lines 99 413) no Hoare annotation was computed. [2019-11-23 20:54:07,244 INFO L444 ceAbstractionStarter]: For program point L562(line 562) no Hoare annotation was computed. [2019-11-23 20:54:07,244 INFO L444 ceAbstractionStarter]: For program point L496(line 496) no Hoare annotation was computed. [2019-11-23 20:54:07,244 INFO L444 ceAbstractionStarter]: For program point L430(line 430) no Hoare annotation was computed. [2019-11-23 20:54:07,244 INFO L444 ceAbstractionStarter]: For program point L298(lines 298 307) no Hoare annotation was computed. [2019-11-23 20:54:07,244 INFO L444 ceAbstractionStarter]: For program point L232(lines 232 413) no Hoare annotation was computed. [2019-11-23 20:54:07,244 INFO L444 ceAbstractionStarter]: For program point L298-2(lines 298 307) no Hoare annotation was computed. [2019-11-23 20:54:07,245 INFO L444 ceAbstractionStarter]: For program point L35(lines 35 413) no Hoare annotation was computed. [2019-11-23 20:54:07,270 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 08:54:07 BoogieIcfgContainer [2019-11-23 20:54:07,270 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-23 20:54:07,272 INFO L168 Benchmark]: Toolchain (without parser) took 16267.40 ms. Allocated memory was 136.8 MB in the beginning and 520.1 MB in the end (delta: 383.3 MB). Free memory was 100.1 MB in the beginning and 281.7 MB in the end (delta: -181.5 MB). Peak memory consumption was 201.7 MB. Max. memory is 7.1 GB. [2019-11-23 20:54:07,273 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 136.8 MB. Free memory was 120.0 MB in the beginning and 119.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-11-23 20:54:07,274 INFO L168 Benchmark]: CACSL2BoogieTranslator took 758.88 ms. Allocated memory was 136.8 MB in the beginning and 202.4 MB in the end (delta: 65.5 MB). Free memory was 99.9 MB in the beginning and 167.7 MB in the end (delta: -67.7 MB). Peak memory consumption was 35.4 MB. Max. memory is 7.1 GB. [2019-11-23 20:54:07,275 INFO L168 Benchmark]: Boogie Procedure Inliner took 83.53 ms. Allocated memory is still 202.4 MB. Free memory was 167.7 MB in the beginning and 161.9 MB in the end (delta: 5.8 MB). Peak memory consumption was 5.8 MB. Max. memory is 7.1 GB. [2019-11-23 20:54:07,276 INFO L168 Benchmark]: Boogie Preprocessor took 106.59 ms. Allocated memory is still 202.4 MB. Free memory was 161.9 MB in the beginning and 157.5 MB in the end (delta: 4.3 MB). Peak memory consumption was 4.3 MB. Max. memory is 7.1 GB. [2019-11-23 20:54:07,277 INFO L168 Benchmark]: RCFGBuilder took 1388.34 ms. Allocated memory was 202.4 MB in the beginning and 232.8 MB in the end (delta: 30.4 MB). Free memory was 157.5 MB in the beginning and 170.9 MB in the end (delta: -13.3 MB). Peak memory consumption was 81.0 MB. Max. memory is 7.1 GB. [2019-11-23 20:54:07,277 INFO L168 Benchmark]: TraceAbstraction took 13923.85 ms. Allocated memory was 232.8 MB in the beginning and 520.1 MB in the end (delta: 287.3 MB). Free memory was 170.9 MB in the beginning and 281.7 MB in the end (delta: -110.8 MB). Peak memory consumption was 176.5 MB. Max. memory is 7.1 GB. [2019-11-23 20:54:07,282 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.22 ms. Allocated memory is still 136.8 MB. Free memory was 120.0 MB in the beginning and 119.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 758.88 ms. Allocated memory was 136.8 MB in the beginning and 202.4 MB in the end (delta: 65.5 MB). Free memory was 99.9 MB in the beginning and 167.7 MB in the end (delta: -67.7 MB). Peak memory consumption was 35.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 83.53 ms. Allocated memory is still 202.4 MB. Free memory was 167.7 MB in the beginning and 161.9 MB in the end (delta: 5.8 MB). Peak memory consumption was 5.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 106.59 ms. Allocated memory is still 202.4 MB. Free memory was 161.9 MB in the beginning and 157.5 MB in the end (delta: 4.3 MB). Peak memory consumption was 4.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1388.34 ms. Allocated memory was 202.4 MB in the beginning and 232.8 MB in the end (delta: 30.4 MB). Free memory was 157.5 MB in the beginning and 170.9 MB in the end (delta: -13.3 MB). Peak memory consumption was 81.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 13923.85 ms. Allocated memory was 232.8 MB in the beginning and 520.1 MB in the end (delta: 287.3 MB). Free memory was 170.9 MB in the beginning and 281.7 MB in the end (delta: -110.8 MB). Peak memory consumption was 176.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 562]: 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: 600]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 606]: Loop Invariant Derived loop invariant: (((((((((((((!(a19 == 1) && 8 <= a17) && a11 == 1) && !(a28 == 11)) || (((a17 == 8 && a19 == 1) && a21 == 1) && a25 == 1)) || ((a17 <= 8 && ((a19 <= 0 && !(a25 == 1)) || ((!(a19 == 1) && !(a25 == 1)) && !(a28 == 11)))) && !(a28 == 10))) || (((a28 == 9 && !(a25 == 1)) && a17 == 8) && a21 == 1)) || ((a17 == 8 && a28 == 7) && a21 == 1)) || (a11 == 1 && ((a19 <= 0 && !(a25 == 1)) || ((!(a19 == 1) && !(a25 == 1)) && !(a28 == 11))))) || ((a28 == 7 && a17 <= 8) && a11 == 1)) || ((((!(5 == input) && a28 == 10) && a17 == 8) && a19 == 1) && a21 == 1)) || ((!(a25 == 1) && a17 <= 8) && a11 == 1)) || (((((8 <= a17 && a17 <= 8) && a25 == 1) && !(a28 == 9)) && !(a28 == 11)) && !(a28 == 10))) || (((((!(a19 == 1) && 8 <= a17) && a17 <= 8) && a25 == 1) && !(a28 == 9)) && !(a28 == 11))) || (((a28 == 9 && !(a19 == 1)) && a11 == 1) && !(a28 == 11)) - InvariantResult [Line: 29]: Loop Invariant Derived loop invariant: (((((((((((((!(a19 == 1) && 8 <= a17) && a11 == 1) && !(a28 == 11)) || (((a17 == 8 && a19 == 1) && a21 == 1) && a25 == 1)) || ((a17 <= 8 && ((a19 <= 0 && !(a25 == 1)) || ((!(a19 == 1) && !(a25 == 1)) && !(a28 == 11)))) && !(a28 == 10))) || (((a28 == 9 && !(a25 == 1)) && a17 == 8) && a21 == 1)) || ((a17 == 8 && a28 == 7) && a21 == 1)) || (a11 == 1 && ((a19 <= 0 && !(a25 == 1)) || ((!(a19 == 1) && !(a25 == 1)) && !(a28 == 11))))) || ((a28 == 7 && a17 <= 8) && a11 == 1)) || ((((!(5 == input) && a28 == 10) && a17 == 8) && a19 == 1) && a21 == 1)) || ((!(a25 == 1) && a17 <= 8) && a11 == 1)) || (((((8 <= a17 && a17 <= 8) && a25 == 1) && !(a28 == 9)) && !(a28 == 11)) && !(a28 == 10))) || (((((!(a19 == 1) && 8 <= a17) && a17 <= 8) && a25 == 1) && !(a28 == 9)) && !(a28 == 11))) || (((a28 == 9 && !(a19 == 1)) && a11 == 1) && !(a28 == 11)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 227 locations, 1 error locations. Result: SAFE, OverallTime: 13.8s, OverallIterations: 11, TraceHistogramMax: 5, AutomataDifference: 9.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.0s, HoareTripleCheckerStatistics: 1262 SDtfs, 2480 SDslu, 295 SDs, 0 SdLazy, 6276 SolverSat, 996 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 417 GetRequests, 381 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1994occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 11 MinimizatonAttempts, 2023 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 52 NumberOfFragments, 413 HoareAnnotationTreeSize, 3 FomulaSimplifications, 2056 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 3 FomulaSimplificationsInter, 1242 FormulaSimplificationTreeSizeReductionInter, 0.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 2332 NumberOfCodeBlocks, 2332 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 2319 ConstructedInterpolants, 0 QuantifiedInterpolants, 1339968 SizeOfPredicates, 1 NumberOfNonLiveVariables, 641 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 13 InterpolantComputations, 11 PerfectInterpolantSequences, 890/896 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...