/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/Problem01_label05.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 20:51:23,053 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 20:51:23,055 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 20:51:23,066 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 20:51:23,066 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 20:51:23,067 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 20:51:23,069 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 20:51:23,070 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 20:51:23,072 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 20:51:23,073 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 20:51:23,074 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 20:51:23,075 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 20:51:23,075 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 20:51:23,076 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 20:51:23,077 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 20:51:23,078 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 20:51:23,079 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 20:51:23,080 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 20:51:23,082 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 20:51:23,084 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 20:51:23,085 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 20:51:23,086 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 20:51:23,088 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 20:51:23,088 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 20:51:23,091 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 20:51:23,091 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 20:51:23,092 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 20:51:23,093 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 20:51:23,093 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 20:51:23,094 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 20:51:23,094 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 20:51:23,095 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 20:51:23,096 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 20:51:23,097 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 20:51:23,098 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 20:51:23,098 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 20:51:23,099 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 20:51:23,099 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 20:51:23,099 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 20:51:23,100 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 20:51:23,101 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 20:51:23,102 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:51:23,120 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 20:51:23,121 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 20:51:23,122 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-23 20:51:23,123 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-23 20:51:23,124 INFO L138 SettingsManager]: * Use SBE=true [2019-11-23 20:51:23,124 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 20:51:23,124 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 20:51:23,124 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 20:51:23,125 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 20:51:23,126 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 20:51:23,126 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 20:51:23,126 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 20:51:23,126 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 20:51:23,126 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-23 20:51:23,126 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 20:51:23,128 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 20:51:23,128 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-23 20:51:23,128 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 20:51:23,128 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 20:51:23,129 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-23 20:51:23,129 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 20:51:23,129 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 20:51:23,129 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 20:51:23,129 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 20:51:23,129 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 20:51:23,130 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 20:51:23,131 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-23 20:51:23,131 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 20:51:23,131 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 20:51:23,131 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 20:51:23,396 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 20:51:23,409 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 20:51:23,414 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 20:51:23,415 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 20:51:23,415 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 20:51:23,416 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label05.c [2019-11-23 20:51:23,481 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b17059d51/be7cc4088e2147359551d1f27032a710/FLAG21aac786d [2019-11-23 20:51:24,030 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 20:51:24,031 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label05.c [2019-11-23 20:51:24,042 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b17059d51/be7cc4088e2147359551d1f27032a710/FLAG21aac786d [2019-11-23 20:51:24,310 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b17059d51/be7cc4088e2147359551d1f27032a710 [2019-11-23 20:51:24,319 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 20:51:24,321 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 20:51:24,322 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 20:51:24,322 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 20:51:24,326 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 20:51:24,327 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:51:24" (1/1) ... [2019-11-23 20:51:24,332 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c9ac29d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:51:24, skipping insertion in model container [2019-11-23 20:51:24,332 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:51:24" (1/1) ... [2019-11-23 20:51:24,341 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 20:51:24,410 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 20:51:24,935 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 20:51:24,940 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 20:51:25,050 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 20:51:25,073 INFO L208 MainTranslator]: Completed translation [2019-11-23 20:51:25,073 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:51:25 WrapperNode [2019-11-23 20:51:25,073 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 20:51:25,074 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 20:51:25,074 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 20:51:25,075 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 20:51:25,085 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:51:25" (1/1) ... [2019-11-23 20:51:25,114 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:51:25" (1/1) ... [2019-11-23 20:51:25,191 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 20:51:25,192 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 20:51:25,192 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 20:51:25,192 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 20:51:25,204 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:51:25" (1/1) ... [2019-11-23 20:51:25,204 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:51:25" (1/1) ... [2019-11-23 20:51:25,208 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:51:25" (1/1) ... [2019-11-23 20:51:25,208 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:51:25" (1/1) ... [2019-11-23 20:51:25,241 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:51:25" (1/1) ... [2019-11-23 20:51:25,257 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:51:25" (1/1) ... [2019-11-23 20:51:25,263 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:51:25" (1/1) ... [2019-11-23 20:51:25,280 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 20:51:25,281 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 20:51:25,281 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 20:51:25,281 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 20:51:25,282 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:51:25" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 20:51:25,371 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 20:51:25,371 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 20:51:26,667 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 20:51:26,667 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-23 20:51:26,669 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:51:26 BoogieIcfgContainer [2019-11-23 20:51:26,669 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 20:51:26,670 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 20:51:26,670 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 20:51:26,673 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 20:51:26,673 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 08:51:24" (1/3) ... [2019-11-23 20:51:26,674 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f20bdef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:51:26, skipping insertion in model container [2019-11-23 20:51:26,675 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:51:25" (2/3) ... [2019-11-23 20:51:26,675 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f20bdef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:51:26, skipping insertion in model container [2019-11-23 20:51:26,675 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:51:26" (3/3) ... [2019-11-23 20:51:26,677 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem01_label05.c [2019-11-23 20:51:26,687 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 20:51:26,695 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 20:51:26,708 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 20:51:26,740 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 20:51:26,740 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 20:51:26,741 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 20:51:26,741 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 20:51:26,741 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 20:51:26,742 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 20:51:26,742 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 20:51:26,743 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 20:51:26,775 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states. [2019-11-23 20:51:26,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-23 20:51:26,788 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:51:26,790 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] [2019-11-23 20:51:26,790 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:51:26,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:51:26,797 INFO L82 PathProgramCache]: Analyzing trace with hash 1877985287, now seen corresponding path program 1 times [2019-11-23 20:51:26,807 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:51:26,807 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386206439] [2019-11-23 20:51:26,808 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:51:27,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:51:27,268 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:51:27,269 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386206439] [2019-11-23 20:51:27,270 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:51:27,270 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:51:27,272 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161745895] [2019-11-23 20:51:27,277 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 20:51:27,277 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:51:27,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 20:51:27,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:51:27,294 INFO L87 Difference]: Start difference. First operand 198 states. Second operand 4 states. [2019-11-23 20:51:28,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:51:28,575 INFO L93 Difference]: Finished difference Result 662 states and 1178 transitions. [2019-11-23 20:51:28,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 20:51:28,577 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2019-11-23 20:51:28,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:51:28,597 INFO L225 Difference]: With dead ends: 662 [2019-11-23 20:51:28,597 INFO L226 Difference]: Without dead ends: 397 [2019-11-23 20:51:28,602 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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:51:28,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2019-11-23 20:51:28,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 266. [2019-11-23 20:51:28,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-11-23 20:51:28,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 380 transitions. [2019-11-23 20:51:28,712 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 380 transitions. Word has length 94 [2019-11-23 20:51:28,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:51:28,713 INFO L462 AbstractCegarLoop]: Abstraction has 266 states and 380 transitions. [2019-11-23 20:51:28,714 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 20:51:28,714 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 380 transitions. [2019-11-23 20:51:28,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-11-23 20:51:28,723 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:51:28,724 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-23 20:51:28,725 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:51:28,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:51:28,725 INFO L82 PathProgramCache]: Analyzing trace with hash 1993122394, now seen corresponding path program 1 times [2019-11-23 20:51:28,725 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:51:28,726 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047281993] [2019-11-23 20:51:28,726 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:51:28,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:51:28,853 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:51:28,853 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047281993] [2019-11-23 20:51:28,853 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:51:28,854 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:51:28,854 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060393772] [2019-11-23 20:51:28,856 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 20:51:28,857 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:51:28,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 20:51:28,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:51:28,857 INFO L87 Difference]: Start difference. First operand 266 states and 380 transitions. Second operand 4 states. [2019-11-23 20:51:29,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:51:29,713 INFO L93 Difference]: Finished difference Result 1054 states and 1512 transitions. [2019-11-23 20:51:29,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 20:51:29,714 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2019-11-23 20:51:29,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:51:29,719 INFO L225 Difference]: With dead ends: 1054 [2019-11-23 20:51:29,719 INFO L226 Difference]: Without dead ends: 790 [2019-11-23 20:51:29,721 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:51:29,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2019-11-23 20:51:29,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 790. [2019-11-23 20:51:29,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2019-11-23 20:51:29,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 1067 transitions. [2019-11-23 20:51:29,751 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 1067 transitions. Word has length 100 [2019-11-23 20:51:29,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:51:29,751 INFO L462 AbstractCegarLoop]: Abstraction has 790 states and 1067 transitions. [2019-11-23 20:51:29,751 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 20:51:29,752 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 1067 transitions. [2019-11-23 20:51:29,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-11-23 20:51:29,754 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:51:29,754 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-23 20:51:29,755 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:51:29,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:51:29,755 INFO L82 PathProgramCache]: Analyzing trace with hash 2028903770, now seen corresponding path program 1 times [2019-11-23 20:51:29,755 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:51:29,756 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685619224] [2019-11-23 20:51:29,756 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:51:29,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:51:29,846 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-23 20:51:29,846 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685619224] [2019-11-23 20:51:29,847 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:51:29,847 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 20:51:29,847 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69427135] [2019-11-23 20:51:29,847 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:51:29,848 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:51:29,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:51:29,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:51:29,848 INFO L87 Difference]: Start difference. First operand 790 states and 1067 transitions. Second operand 3 states. [2019-11-23 20:51:30,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:51:30,371 INFO L93 Difference]: Finished difference Result 2102 states and 2831 transitions. [2019-11-23 20:51:30,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:51:30,371 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 101 [2019-11-23 20:51:30,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:51:30,380 INFO L225 Difference]: With dead ends: 2102 [2019-11-23 20:51:30,380 INFO L226 Difference]: Without dead ends: 1314 [2019-11-23 20:51:30,382 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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:51:30,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1314 states. [2019-11-23 20:51:30,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1314 to 1052. [2019-11-23 20:51:30,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1052 states. [2019-11-23 20:51:30,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1052 states to 1052 states and 1328 transitions. [2019-11-23 20:51:30,412 INFO L78 Accepts]: Start accepts. Automaton has 1052 states and 1328 transitions. Word has length 101 [2019-11-23 20:51:30,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:51:30,413 INFO L462 AbstractCegarLoop]: Abstraction has 1052 states and 1328 transitions. [2019-11-23 20:51:30,413 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:51:30,413 INFO L276 IsEmpty]: Start isEmpty. Operand 1052 states and 1328 transitions. [2019-11-23 20:51:30,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-11-23 20:51:30,417 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:51:30,418 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:30,418 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:51:30,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:51:30,419 INFO L82 PathProgramCache]: Analyzing trace with hash -1582856459, now seen corresponding path program 1 times [2019-11-23 20:51:30,419 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:51:30,419 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603197247] [2019-11-23 20:51:30,419 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:51:30,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:51:30,569 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-23 20:51:30,569 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603197247] [2019-11-23 20:51:30,569 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:51:30,570 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 20:51:30,570 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809070857] [2019-11-23 20:51:30,571 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:51:30,571 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:51:30,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:51:30,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:51:30,572 INFO L87 Difference]: Start difference. First operand 1052 states and 1328 transitions. Second operand 3 states. [2019-11-23 20:51:31,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:51:31,082 INFO L93 Difference]: Finished difference Result 2364 states and 3019 transitions. [2019-11-23 20:51:31,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:51:31,083 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 128 [2019-11-23 20:51:31,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:51:31,092 INFO L225 Difference]: With dead ends: 2364 [2019-11-23 20:51:31,092 INFO L226 Difference]: Without dead ends: 1314 [2019-11-23 20:51:31,095 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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:51:31,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1314 states. [2019-11-23 20:51:31,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1314 to 1183. [2019-11-23 20:51:31,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1183 states. [2019-11-23 20:51:31,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1183 states to 1183 states and 1502 transitions. [2019-11-23 20:51:31,129 INFO L78 Accepts]: Start accepts. Automaton has 1183 states and 1502 transitions. Word has length 128 [2019-11-23 20:51:31,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:51:31,130 INFO L462 AbstractCegarLoop]: Abstraction has 1183 states and 1502 transitions. [2019-11-23 20:51:31,130 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:51:31,130 INFO L276 IsEmpty]: Start isEmpty. Operand 1183 states and 1502 transitions. [2019-11-23 20:51:31,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-11-23 20:51:31,133 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:51:31,134 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:31,134 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:51:31,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:51:31,134 INFO L82 PathProgramCache]: Analyzing trace with hash 1986645786, now seen corresponding path program 1 times [2019-11-23 20:51:31,135 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:51:31,135 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883149181] [2019-11-23 20:51:31,135 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:51:31,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:51:31,219 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-23 20:51:31,220 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883149181] [2019-11-23 20:51:31,220 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:51:31,220 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 20:51:31,221 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084163496] [2019-11-23 20:51:31,222 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:51:31,222 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:51:31,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:51:31,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:51:31,223 INFO L87 Difference]: Start difference. First operand 1183 states and 1502 transitions. Second operand 3 states. [2019-11-23 20:51:31,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:51:31,775 INFO L93 Difference]: Finished difference Result 3150 states and 3980 transitions. [2019-11-23 20:51:31,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:51:31,775 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 152 [2019-11-23 20:51:31,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:51:31,786 INFO L225 Difference]: With dead ends: 3150 [2019-11-23 20:51:31,788 INFO L226 Difference]: Without dead ends: 1969 [2019-11-23 20:51:31,790 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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:51:31,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1969 states. [2019-11-23 20:51:31,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1969 to 1838. [2019-11-23 20:51:31,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1838 states. [2019-11-23 20:51:31,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 2265 transitions. [2019-11-23 20:51:31,836 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 2265 transitions. Word has length 152 [2019-11-23 20:51:31,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:51:31,837 INFO L462 AbstractCegarLoop]: Abstraction has 1838 states and 2265 transitions. [2019-11-23 20:51:31,837 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:51:31,837 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 2265 transitions. [2019-11-23 20:51:31,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-11-23 20:51:31,841 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:51:31,842 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:51:31,842 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:51:31,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:51:31,842 INFO L82 PathProgramCache]: Analyzing trace with hash -27987931, now seen corresponding path program 1 times [2019-11-23 20:51:31,843 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:51:31,843 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210279498] [2019-11-23 20:51:31,844 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:51:31,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:51:31,946 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-11-23 20:51:31,946 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210279498] [2019-11-23 20:51:31,947 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:51:31,948 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 20:51:31,948 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448611879] [2019-11-23 20:51:31,948 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:51:31,949 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:51:31,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:51:31,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:51:31,949 INFO L87 Difference]: Start difference. First operand 1838 states and 2265 transitions. Second operand 3 states. [2019-11-23 20:51:32,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:51:32,378 INFO L93 Difference]: Finished difference Result 3674 states and 4528 transitions. [2019-11-23 20:51:32,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:51:32,378 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 157 [2019-11-23 20:51:32,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:51:32,387 INFO L225 Difference]: With dead ends: 3674 [2019-11-23 20:51:32,387 INFO L226 Difference]: Without dead ends: 1838 [2019-11-23 20:51:32,391 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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:51:32,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1838 states. [2019-11-23 20:51:32,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1838 to 1707. [2019-11-23 20:51:32,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1707 states. [2019-11-23 20:51:32,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1707 states to 1707 states and 2110 transitions. [2019-11-23 20:51:32,457 INFO L78 Accepts]: Start accepts. Automaton has 1707 states and 2110 transitions. Word has length 157 [2019-11-23 20:51:32,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:51:32,457 INFO L462 AbstractCegarLoop]: Abstraction has 1707 states and 2110 transitions. [2019-11-23 20:51:32,458 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:51:32,458 INFO L276 IsEmpty]: Start isEmpty. Operand 1707 states and 2110 transitions. [2019-11-23 20:51:32,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-11-23 20:51:32,462 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:51:32,462 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, 2, 2, 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] [2019-11-23 20:51:32,462 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:51:32,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:51:32,463 INFO L82 PathProgramCache]: Analyzing trace with hash 639923582, now seen corresponding path program 1 times [2019-11-23 20:51:32,463 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:51:32,463 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730868947] [2019-11-23 20:51:32,463 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:51:32,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:51:32,531 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2019-11-23 20:51:32,531 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730868947] [2019-11-23 20:51:32,536 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:51:32,537 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 20:51:32,537 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958448155] [2019-11-23 20:51:32,538 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:51:32,545 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:51:32,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:51:32,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:51:32,546 INFO L87 Difference]: Start difference. First operand 1707 states and 2110 transitions. Second operand 3 states. [2019-11-23 20:51:32,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:51:32,979 INFO L93 Difference]: Finished difference Result 3543 states and 4361 transitions. [2019-11-23 20:51:32,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:51:32,979 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 177 [2019-11-23 20:51:32,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:51:32,987 INFO L225 Difference]: With dead ends: 3543 [2019-11-23 20:51:32,987 INFO L226 Difference]: Without dead ends: 1838 [2019-11-23 20:51:32,990 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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:51:32,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1838 states. [2019-11-23 20:51:33,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1838 to 1838. [2019-11-23 20:51:33,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1838 states. [2019-11-23 20:51:33,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 2229 transitions. [2019-11-23 20:51:33,035 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 2229 transitions. Word has length 177 [2019-11-23 20:51:33,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:51:33,035 INFO L462 AbstractCegarLoop]: Abstraction has 1838 states and 2229 transitions. [2019-11-23 20:51:33,035 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:51:33,035 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 2229 transitions. [2019-11-23 20:51:33,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-11-23 20:51:33,042 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:51:33,042 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 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] [2019-11-23 20:51:33,042 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:51:33,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:51:33,043 INFO L82 PathProgramCache]: Analyzing trace with hash 502707782, now seen corresponding path program 1 times [2019-11-23 20:51:33,043 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:51:33,045 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204034292] [2019-11-23 20:51:33,045 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:51:33,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:51:33,265 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2019-11-23 20:51:33,265 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204034292] [2019-11-23 20:51:33,266 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:51:33,266 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-23 20:51:33,266 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810995015] [2019-11-23 20:51:33,266 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-23 20:51:33,267 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:51:33,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-23 20:51:33,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-11-23 20:51:33,267 INFO L87 Difference]: Start difference. First operand 1838 states and 2229 transitions. Second operand 8 states. [2019-11-23 20:51:34,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:51:34,199 INFO L93 Difference]: Finished difference Result 3844 states and 4632 transitions. [2019-11-23 20:51:34,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-23 20:51:34,199 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 181 [2019-11-23 20:51:34,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:51:34,208 INFO L225 Difference]: With dead ends: 3844 [2019-11-23 20:51:34,209 INFO L226 Difference]: Without dead ends: 2008 [2019-11-23 20:51:34,211 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-11-23 20:51:34,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2008 states. [2019-11-23 20:51:34,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2008 to 1838. [2019-11-23 20:51:34,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1838 states. [2019-11-23 20:51:34,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 2217 transitions. [2019-11-23 20:51:34,251 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 2217 transitions. Word has length 181 [2019-11-23 20:51:34,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:51:34,251 INFO L462 AbstractCegarLoop]: Abstraction has 1838 states and 2217 transitions. [2019-11-23 20:51:34,251 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-23 20:51:34,251 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 2217 transitions. [2019-11-23 20:51:34,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-11-23 20:51:34,256 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:51:34,256 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-23 20:51:34,256 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:51:34,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:51:34,257 INFO L82 PathProgramCache]: Analyzing trace with hash 997281865, now seen corresponding path program 1 times [2019-11-23 20:51:34,257 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:51:34,258 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924127243] [2019-11-23 20:51:34,258 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:51:34,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:51:34,466 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2019-11-23 20:51:34,466 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924127243] [2019-11-23 20:51:34,466 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:51:34,467 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:51:34,470 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589581434] [2019-11-23 20:51:34,470 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:51:34,471 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:51:34,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:51:34,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:51:34,471 INFO L87 Difference]: Start difference. First operand 1838 states and 2217 transitions. Second operand 3 states. [2019-11-23 20:51:34,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:51:34,923 INFO L93 Difference]: Finished difference Result 2364 states and 2826 transitions. [2019-11-23 20:51:34,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:51:34,923 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 198 [2019-11-23 20:51:34,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:51:34,933 INFO L225 Difference]: With dead ends: 2364 [2019-11-23 20:51:34,933 INFO L226 Difference]: Without dead ends: 2362 [2019-11-23 20:51:34,934 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:51:34,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2362 states. [2019-11-23 20:51:34,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2362 to 1707. [2019-11-23 20:51:34,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1707 states. [2019-11-23 20:51:34,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1707 states to 1707 states and 2043 transitions. [2019-11-23 20:51:34,971 INFO L78 Accepts]: Start accepts. Automaton has 1707 states and 2043 transitions. Word has length 198 [2019-11-23 20:51:34,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:51:34,971 INFO L462 AbstractCegarLoop]: Abstraction has 1707 states and 2043 transitions. [2019-11-23 20:51:34,971 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:51:34,971 INFO L276 IsEmpty]: Start isEmpty. Operand 1707 states and 2043 transitions. [2019-11-23 20:51:34,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2019-11-23 20:51:34,976 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:51:34,977 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-23 20:51:34,977 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:51:34,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:51:34,977 INFO L82 PathProgramCache]: Analyzing trace with hash 1286042342, now seen corresponding path program 1 times [2019-11-23 20:51:34,977 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:51:34,978 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582510585] [2019-11-23 20:51:34,978 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:51:35,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:51:35,171 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 141 proven. 70 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-11-23 20:51:35,171 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582510585] [2019-11-23 20:51:35,171 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [449858381] [2019-11-23 20:51:35,171 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:51:35,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:51:35,319 INFO L255 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-23 20:51:35,335 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:51:35,412 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2019-11-23 20:51:35,412 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-23 20:51:35,413 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2019-11-23 20:51:35,413 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994057735] [2019-11-23 20:51:35,414 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:51:35,414 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:51:35,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:51:35,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-23 20:51:35,414 INFO L87 Difference]: Start difference. First operand 1707 states and 2043 transitions. Second operand 3 states. [2019-11-23 20:51:35,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:51:35,829 INFO L93 Difference]: Finished difference Result 3410 states and 4083 transitions. [2019-11-23 20:51:35,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:51:35,829 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 216 [2019-11-23 20:51:35,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:51:35,830 INFO L225 Difference]: With dead ends: 3410 [2019-11-23 20:51:35,830 INFO L226 Difference]: Without dead ends: 0 [2019-11-23 20:51:35,833 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 218 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-23 20:51:35,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-23 20:51:35,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-23 20:51:35,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-23 20:51:35,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-23 20:51:35,834 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 216 [2019-11-23 20:51:35,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:51:35,835 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-23 20:51:35,835 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:51:35,835 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-23 20:51:35,835 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-23 20:51:36,038 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:51:36,046 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-23 20:51:36,314 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 28 [2019-11-23 20:51:36,483 WARN L192 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 28 [2019-11-23 20:51:36,486 INFO L444 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2019-11-23 20:51:36,487 INFO L444 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2019-11-23 20:51:36,487 INFO L444 ceAbstractionStarter]: For program point L565-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:36,487 INFO L444 ceAbstractionStarter]: For program point L532-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:36,487 INFO L444 ceAbstractionStarter]: For program point L499-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:36,488 INFO L444 ceAbstractionStarter]: For program point L466-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:36,488 INFO L444 ceAbstractionStarter]: For program point L433-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:36,488 INFO L444 ceAbstractionStarter]: For program point L400-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:36,488 INFO L444 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2019-11-23 20:51:36,488 INFO L444 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2019-11-23 20:51:36,488 INFO L444 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2019-11-23 20:51:36,489 INFO L444 ceAbstractionStarter]: For program point L533(line 533) no Hoare annotation was computed. [2019-11-23 20:51:36,489 INFO L444 ceAbstractionStarter]: For program point L500(line 500) no Hoare annotation was computed. [2019-11-23 20:51:36,489 INFO L444 ceAbstractionStarter]: For program point L467(line 467) no Hoare annotation was computed. [2019-11-23 20:51:36,489 INFO L444 ceAbstractionStarter]: For program point L434(line 434) no Hoare annotation was computed. [2019-11-23 20:51:36,490 INFO L444 ceAbstractionStarter]: For program point L401(line 401) no Hoare annotation was computed. [2019-11-23 20:51:36,490 INFO L444 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2019-11-23 20:51:36,490 INFO L444 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2019-11-23 20:51:36,490 INFO L444 ceAbstractionStarter]: For program point L568-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:36,491 INFO L444 ceAbstractionStarter]: For program point L535-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:36,491 INFO L444 ceAbstractionStarter]: For program point L502-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:36,491 INFO L444 ceAbstractionStarter]: For program point L469-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:36,491 INFO L444 ceAbstractionStarter]: For program point L436-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:36,492 INFO L444 ceAbstractionStarter]: For program point L403-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:36,492 INFO L444 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2019-11-23 20:51:36,492 INFO L444 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2019-11-23 20:51:36,494 INFO L444 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2019-11-23 20:51:36,494 INFO L444 ceAbstractionStarter]: For program point L536(line 536) no Hoare annotation was computed. [2019-11-23 20:51:36,494 INFO L444 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2019-11-23 20:51:36,494 INFO L444 ceAbstractionStarter]: For program point L470(line 470) no Hoare annotation was computed. [2019-11-23 20:51:36,494 INFO L444 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2019-11-23 20:51:36,495 INFO L444 ceAbstractionStarter]: For program point L404(line 404) no Hoare annotation was computed. [2019-11-23 20:51:36,495 INFO L444 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2019-11-23 20:51:36,495 INFO L444 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2019-11-23 20:51:36,495 INFO L444 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2019-11-23 20:51:36,495 INFO L444 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2019-11-23 20:51:36,495 INFO L444 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2019-11-23 20:51:36,496 INFO L444 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2019-11-23 20:51:36,496 INFO L444 ceAbstractionStarter]: For program point L571-1(lines 571 573) no Hoare annotation was computed. [2019-11-23 20:51:36,496 INFO L444 ceAbstractionStarter]: For program point L538-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:36,496 INFO L444 ceAbstractionStarter]: For program point L505-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:36,496 INFO L444 ceAbstractionStarter]: For program point L472-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:36,496 INFO L444 ceAbstractionStarter]: For program point L439-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:36,497 INFO L444 ceAbstractionStarter]: For program point L406-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:36,497 INFO L444 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2019-11-23 20:51:36,497 INFO L444 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2019-11-23 20:51:36,498 INFO L444 ceAbstractionStarter]: For program point L572(line 572) no Hoare annotation was computed. [2019-11-23 20:51:36,498 INFO L444 ceAbstractionStarter]: For program point L539(line 539) no Hoare annotation was computed. [2019-11-23 20:51:36,498 INFO L444 ceAbstractionStarter]: For program point L506(line 506) no Hoare annotation was computed. [2019-11-23 20:51:36,498 INFO L444 ceAbstractionStarter]: For program point L473(line 473) no Hoare annotation was computed. [2019-11-23 20:51:36,499 INFO L444 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2019-11-23 20:51:36,499 INFO L444 ceAbstractionStarter]: For program point L407(line 407) no Hoare annotation was computed. [2019-11-23 20:51:36,499 INFO L444 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2019-11-23 20:51:36,502 INFO L440 ceAbstractionStarter]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse3 (not (= 13 ~a8~0))) (.cse6 (= ~a17~0 1)) (.cse4 (<= ~a21~0 0)) (.cse1 (= ~a20~0 1)) (.cse5 (not (= ~a16~0 6))) (.cse0 (not (= 1 ~a7~0))) (.cse2 (= ~a21~0 1))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse2 .cse3) (and .cse4 .cse5 .cse6) (and .cse5 .cse2 .cse3) (and .cse6 .cse1 .cse2) (and .cse4 .cse1) (and .cse5 .cse0 .cse2))) [2019-11-23 20:51:36,502 INFO L444 ceAbstractionStarter]: For program point L541-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:36,502 INFO L444 ceAbstractionStarter]: For program point L508-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:36,502 INFO L444 ceAbstractionStarter]: For program point L475-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:36,503 INFO L444 ceAbstractionStarter]: For program point L442-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:36,503 INFO L444 ceAbstractionStarter]: For program point L409-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:36,503 INFO L444 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2019-11-23 20:51:36,503 INFO L444 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2019-11-23 20:51:36,503 INFO L444 ceAbstractionStarter]: For program point L509(line 509) no Hoare annotation was computed. [2019-11-23 20:51:36,503 INFO L444 ceAbstractionStarter]: For program point L476(line 476) no Hoare annotation was computed. [2019-11-23 20:51:36,504 INFO L444 ceAbstractionStarter]: For program point L443(line 443) no Hoare annotation was computed. [2019-11-23 20:51:36,504 INFO L444 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2019-11-23 20:51:36,504 INFO L444 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2019-11-23 20:51:36,504 INFO L444 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2019-11-23 20:51:36,504 INFO L444 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2019-11-23 20:51:36,504 INFO L444 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2019-11-23 20:51:36,505 INFO L444 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2019-11-23 20:51:36,505 INFO L444 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2019-11-23 20:51:36,505 INFO L444 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2019-11-23 20:51:36,506 INFO L447 ceAbstractionStarter]: At program point L577(lines 577 594) the Hoare annotation is: true [2019-11-23 20:51:36,506 INFO L444 ceAbstractionStarter]: For program point L544-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:36,506 INFO L444 ceAbstractionStarter]: For program point L511-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:36,506 INFO L444 ceAbstractionStarter]: For program point L478-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:36,506 INFO L444 ceAbstractionStarter]: For program point L445-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:36,506 INFO L444 ceAbstractionStarter]: For program point L412-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:36,506 INFO L444 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2019-11-23 20:51:36,507 INFO L444 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2019-11-23 20:51:36,507 INFO L444 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2019-11-23 20:51:36,507 INFO L444 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2019-11-23 20:51:36,507 INFO L444 ceAbstractionStarter]: For program point L512(line 512) no Hoare annotation was computed. [2019-11-23 20:51:36,507 INFO L444 ceAbstractionStarter]: For program point L479(line 479) no Hoare annotation was computed. [2019-11-23 20:51:36,508 INFO L444 ceAbstractionStarter]: For program point L446(line 446) no Hoare annotation was computed. [2019-11-23 20:51:36,508 INFO L444 ceAbstractionStarter]: For program point L413(line 413) no Hoare annotation was computed. [2019-11-23 20:51:36,508 INFO L444 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2019-11-23 20:51:36,508 INFO L444 ceAbstractionStarter]: For program point L547-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:36,508 INFO L444 ceAbstractionStarter]: For program point L514-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:36,508 INFO L444 ceAbstractionStarter]: For program point L481-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:36,509 INFO L444 ceAbstractionStarter]: For program point L448-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:36,509 INFO L444 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2019-11-23 20:51:36,510 INFO L444 ceAbstractionStarter]: For program point L415-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:36,510 INFO L444 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2019-11-23 20:51:36,510 INFO L444 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2019-11-23 20:51:36,510 INFO L444 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2019-11-23 20:51:36,510 INFO L444 ceAbstractionStarter]: For program point L515(line 515) no Hoare annotation was computed. [2019-11-23 20:51:36,511 INFO L444 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2019-11-23 20:51:36,511 INFO L444 ceAbstractionStarter]: For program point L449(line 449) no Hoare annotation was computed. [2019-11-23 20:51:36,511 INFO L444 ceAbstractionStarter]: For program point L416(line 416) no Hoare annotation was computed. [2019-11-23 20:51:36,511 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-23 20:51:36,511 INFO L444 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2019-11-23 20:51:36,511 INFO L444 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2019-11-23 20:51:36,512 INFO L444 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2019-11-23 20:51:36,512 INFO L444 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2019-11-23 20:51:36,512 INFO L444 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2019-11-23 20:51:36,512 INFO L444 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2019-11-23 20:51:36,512 INFO L444 ceAbstractionStarter]: For program point L550-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:36,512 INFO L440 ceAbstractionStarter]: At program point L583-2(lines 583 593) the Hoare annotation is: (let ((.cse3 (not (= 13 ~a8~0))) (.cse6 (= ~a17~0 1)) (.cse4 (<= ~a21~0 0)) (.cse1 (= ~a20~0 1)) (.cse5 (not (= ~a16~0 6))) (.cse0 (not (= 1 ~a7~0))) (.cse2 (= ~a21~0 1))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse2 .cse3) (and .cse4 .cse5 .cse6) (and .cse5 .cse2 .cse3) (and .cse6 .cse1 .cse2) (and .cse4 .cse1) (and .cse5 .cse0 .cse2))) [2019-11-23 20:51:36,513 INFO L444 ceAbstractionStarter]: For program point L517-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:36,513 INFO L444 ceAbstractionStarter]: For program point L484-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:36,513 INFO L444 ceAbstractionStarter]: For program point L451-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:36,513 INFO L444 ceAbstractionStarter]: For program point L418-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:36,514 INFO L444 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2019-11-23 20:51:36,514 INFO L444 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2019-11-23 20:51:36,514 INFO L444 ceAbstractionStarter]: For program point L518(line 518) no Hoare annotation was computed. [2019-11-23 20:51:36,514 INFO L444 ceAbstractionStarter]: For program point L485(line 485) no Hoare annotation was computed. [2019-11-23 20:51:36,514 INFO L444 ceAbstractionStarter]: For program point L452(line 452) no Hoare annotation was computed. [2019-11-23 20:51:36,514 INFO L444 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2019-11-23 20:51:36,514 INFO L444 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2019-11-23 20:51:36,514 INFO L444 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2019-11-23 20:51:36,515 INFO L444 ceAbstractionStarter]: For program point L553-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:36,515 INFO L444 ceAbstractionStarter]: For program point L520-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:36,515 INFO L444 ceAbstractionStarter]: For program point L487-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:36,515 INFO L444 ceAbstractionStarter]: For program point L454-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:36,515 INFO L444 ceAbstractionStarter]: For program point L421-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:36,515 INFO L444 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2019-11-23 20:51:36,515 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-23 20:51:36,515 INFO L444 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2019-11-23 20:51:36,515 INFO L444 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2019-11-23 20:51:36,516 INFO L444 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2019-11-23 20:51:36,516 INFO L444 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2019-11-23 20:51:36,516 INFO L444 ceAbstractionStarter]: For program point L521(line 521) no Hoare annotation was computed. [2019-11-23 20:51:36,516 INFO L444 ceAbstractionStarter]: For program point L488(line 488) no Hoare annotation was computed. [2019-11-23 20:51:36,516 INFO L444 ceAbstractionStarter]: For program point L455(line 455) no Hoare annotation was computed. [2019-11-23 20:51:36,516 INFO L444 ceAbstractionStarter]: For program point L422(line 422) no Hoare annotation was computed. [2019-11-23 20:51:36,516 INFO L444 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2019-11-23 20:51:36,516 INFO L444 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2019-11-23 20:51:36,516 INFO L444 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2019-11-23 20:51:36,517 INFO L444 ceAbstractionStarter]: For program point L556-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:36,517 INFO L444 ceAbstractionStarter]: For program point L523-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:36,517 INFO L444 ceAbstractionStarter]: For program point L490-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:36,517 INFO L444 ceAbstractionStarter]: For program point L457-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:36,517 INFO L444 ceAbstractionStarter]: For program point L391(lines 391 393) no Hoare annotation was computed. [2019-11-23 20:51:36,517 INFO L444 ceAbstractionStarter]: For program point L424-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:36,517 INFO L444 ceAbstractionStarter]: For program point L391-2(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:36,517 INFO L444 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2019-11-23 20:51:36,517 INFO L444 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2019-11-23 20:51:36,518 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-23 20:51:36,518 INFO L444 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2019-11-23 20:51:36,518 INFO L444 ceAbstractionStarter]: For program point L524(line 524) no Hoare annotation was computed. [2019-11-23 20:51:36,518 INFO L444 ceAbstractionStarter]: For program point L491(line 491) no Hoare annotation was computed. [2019-11-23 20:51:36,518 INFO L444 ceAbstractionStarter]: For program point L458(line 458) no Hoare annotation was computed. [2019-11-23 20:51:36,518 INFO L444 ceAbstractionStarter]: For program point L425(line 425) no Hoare annotation was computed. [2019-11-23 20:51:36,518 INFO L444 ceAbstractionStarter]: For program point L392(line 392) no Hoare annotation was computed. [2019-11-23 20:51:36,518 INFO L444 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2019-11-23 20:51:36,518 INFO L444 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2019-11-23 20:51:36,519 INFO L444 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2019-11-23 20:51:36,519 INFO L444 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2019-11-23 20:51:36,519 INFO L444 ceAbstractionStarter]: For program point L559-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:36,519 INFO L444 ceAbstractionStarter]: For program point L526-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:36,519 INFO L444 ceAbstractionStarter]: For program point L493-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:36,519 INFO L444 ceAbstractionStarter]: For program point L460-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:36,519 INFO L444 ceAbstractionStarter]: For program point L427-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:36,519 INFO L444 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2019-11-23 20:51:36,519 INFO L444 ceAbstractionStarter]: For program point L394-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:36,519 INFO L444 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2019-11-23 20:51:36,520 INFO L444 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2019-11-23 20:51:36,520 INFO L444 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2019-11-23 20:51:36,520 INFO L444 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2019-11-23 20:51:36,520 INFO L444 ceAbstractionStarter]: For program point L494(line 494) no Hoare annotation was computed. [2019-11-23 20:51:36,520 INFO L444 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2019-11-23 20:51:36,520 INFO L444 ceAbstractionStarter]: For program point L428(line 428) no Hoare annotation was computed. [2019-11-23 20:51:36,520 INFO L444 ceAbstractionStarter]: For program point L395(line 395) no Hoare annotation was computed. [2019-11-23 20:51:36,520 INFO L444 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2019-11-23 20:51:36,520 INFO L444 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2019-11-23 20:51:36,520 INFO L444 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2019-11-23 20:51:36,521 INFO L444 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-23 20:51:36,521 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 458) no Hoare annotation was computed. [2019-11-23 20:51:36,521 INFO L444 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2019-11-23 20:51:36,521 INFO L444 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2019-11-23 20:51:36,521 INFO L444 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2019-11-23 20:51:36,522 INFO L444 ceAbstractionStarter]: For program point L562-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:36,522 INFO L444 ceAbstractionStarter]: For program point L529-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:36,522 INFO L444 ceAbstractionStarter]: For program point L496-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:36,522 INFO L444 ceAbstractionStarter]: For program point L463-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:36,522 INFO L444 ceAbstractionStarter]: For program point L430-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:36,522 INFO L444 ceAbstractionStarter]: For program point L397-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:36,523 INFO L444 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2019-11-23 20:51:36,523 INFO L444 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2019-11-23 20:51:36,523 INFO L444 ceAbstractionStarter]: For program point L530(line 530) no Hoare annotation was computed. [2019-11-23 20:51:36,523 INFO L444 ceAbstractionStarter]: For program point L497(line 497) no Hoare annotation was computed. [2019-11-23 20:51:36,523 INFO L444 ceAbstractionStarter]: For program point L464(line 464) no Hoare annotation was computed. [2019-11-23 20:51:36,523 INFO L444 ceAbstractionStarter]: For program point L431(line 431) no Hoare annotation was computed. [2019-11-23 20:51:36,524 INFO L444 ceAbstractionStarter]: For program point L398(line 398) no Hoare annotation was computed. [2019-11-23 20:51:36,524 INFO L444 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2019-11-23 20:51:36,524 INFO L444 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2019-11-23 20:51:36,524 INFO L444 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2019-11-23 20:51:36,572 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 08:51:36 BoogieIcfgContainer [2019-11-23 20:51:36,572 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-23 20:51:36,578 INFO L168 Benchmark]: Toolchain (without parser) took 12255.42 ms. Allocated memory was 143.1 MB in the beginning and 425.7 MB in the end (delta: 282.6 MB). Free memory was 100.6 MB in the beginning and 144.5 MB in the end (delta: -43.9 MB). Peak memory consumption was 238.7 MB. Max. memory is 7.1 GB. [2019-11-23 20:51:36,579 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 143.1 MB. Free memory was 120.6 MB in the beginning and 120.4 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-11-23 20:51:36,582 INFO L168 Benchmark]: CACSL2BoogieTranslator took 751.52 ms. Allocated memory was 143.1 MB in the beginning and 205.0 MB in the end (delta: 61.9 MB). Free memory was 100.4 MB in the beginning and 166.7 MB in the end (delta: -66.2 MB). Peak memory consumption was 26.1 MB. Max. memory is 7.1 GB. [2019-11-23 20:51:36,582 INFO L168 Benchmark]: Boogie Procedure Inliner took 117.23 ms. Allocated memory is still 205.0 MB. Free memory was 166.7 MB in the beginning and 160.6 MB in the end (delta: 6.1 MB). Peak memory consumption was 6.1 MB. Max. memory is 7.1 GB. [2019-11-23 20:51:36,585 INFO L168 Benchmark]: Boogie Preprocessor took 88.77 ms. Allocated memory is still 205.0 MB. Free memory was 160.6 MB in the beginning and 155.8 MB in the end (delta: 4.7 MB). Peak memory consumption was 4.7 MB. Max. memory is 7.1 GB. [2019-11-23 20:51:36,586 INFO L168 Benchmark]: RCFGBuilder took 1388.03 ms. Allocated memory was 205.0 MB in the beginning and 238.6 MB in the end (delta: 33.6 MB). Free memory was 155.8 MB in the beginning and 167.7 MB in the end (delta: -11.9 MB). Peak memory consumption was 73.4 MB. Max. memory is 7.1 GB. [2019-11-23 20:51:36,587 INFO L168 Benchmark]: TraceAbstraction took 9902.40 ms. Allocated memory was 238.6 MB in the beginning and 425.7 MB in the end (delta: 187.2 MB). Free memory was 167.7 MB in the beginning and 144.5 MB in the end (delta: 23.2 MB). Peak memory consumption was 210.4 MB. Max. memory is 7.1 GB. [2019-11-23 20:51:36,593 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 143.1 MB. Free memory was 120.6 MB in the beginning and 120.4 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 751.52 ms. Allocated memory was 143.1 MB in the beginning and 205.0 MB in the end (delta: 61.9 MB). Free memory was 100.4 MB in the beginning and 166.7 MB in the end (delta: -66.2 MB). Peak memory consumption was 26.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 117.23 ms. Allocated memory is still 205.0 MB. Free memory was 166.7 MB in the beginning and 160.6 MB in the end (delta: 6.1 MB). Peak memory consumption was 6.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 88.77 ms. Allocated memory is still 205.0 MB. Free memory was 160.6 MB in the beginning and 155.8 MB in the end (delta: 4.7 MB). Peak memory consumption was 4.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1388.03 ms. Allocated memory was 205.0 MB in the beginning and 238.6 MB in the end (delta: 33.6 MB). Free memory was 155.8 MB in the beginning and 167.7 MB in the end (delta: -11.9 MB). Peak memory consumption was 73.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 9902.40 ms. Allocated memory was 238.6 MB in the beginning and 425.7 MB in the end (delta: 187.2 MB). Free memory was 167.7 MB in the beginning and 144.5 MB in the end (delta: 23.2 MB). Peak memory consumption was 210.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 458]: 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: 30]: Loop Invariant Derived loop invariant: (((((((!(1 == a7) && a20 == 1) && a21 == 1) || ((!(1 == a7) && a21 == 1) && !(13 == a8))) || ((a21 <= 0 && !(a16 == 6)) && a17 == 1)) || ((!(a16 == 6) && a21 == 1) && !(13 == a8))) || ((a17 == 1 && a20 == 1) && a21 == 1)) || (a21 <= 0 && a20 == 1)) || ((!(a16 == 6) && !(1 == a7)) && a21 == 1) - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: (((((((!(1 == a7) && a20 == 1) && a21 == 1) || ((!(1 == a7) && a21 == 1) && !(13 == a8))) || ((a21 <= 0 && !(a16 == 6)) && a17 == 1)) || ((!(a16 == 6) && a21 == 1) && !(13 == a8))) || ((a17 == 1 && a20 == 1) && a21 == 1)) || (a21 <= 0 && a20 == 1)) || ((!(a16 == 6) && !(1 == a7)) && a21 == 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 198 locations, 1 error locations. Result: SAFE, OverallTime: 9.7s, OverallIterations: 10, TraceHistogramMax: 5, AutomataDifference: 6.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.4s, HoareTripleCheckerStatistics: 559 SDtfs, 1803 SDslu, 80 SDs, 0 SdLazy, 4248 SolverSat, 907 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 252 GetRequests, 228 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1838occurred 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.4s AutomataMinimizationTime, 10 MinimizatonAttempts, 1611 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 32 NumberOfFragments, 153 HoareAnnotationTreeSize, 3 FomulaSimplifications, 3250 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 3 FomulaSimplificationsInter, 328 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 1720 NumberOfCodeBlocks, 1720 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1709 ConstructedInterpolants, 0 QuantifiedInterpolants, 712697 SizeOfPredicates, 1 NumberOfNonLiveVariables, 389 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 11 InterpolantComputations, 10 PerfectInterpolantSequences, 1003/1073 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...