/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_label30.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 20:52:20,072 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 20:52:20,074 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 20:52:20,087 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 20:52:20,087 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 20:52:20,088 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 20:52:20,090 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 20:52:20,092 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 20:52:20,093 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 20:52:20,094 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 20:52:20,095 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 20:52:20,096 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 20:52:20,097 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 20:52:20,098 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 20:52:20,099 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 20:52:20,100 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 20:52:20,101 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 20:52:20,102 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 20:52:20,103 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 20:52:20,105 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 20:52:20,106 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 20:52:20,107 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 20:52:20,109 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 20:52:20,109 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 20:52:20,112 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 20:52:20,112 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 20:52:20,112 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 20:52:20,113 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 20:52:20,113 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 20:52:20,114 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 20:52:20,115 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 20:52:20,115 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 20:52:20,116 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 20:52:20,117 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 20:52:20,118 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 20:52:20,118 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 20:52:20,119 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 20:52:20,119 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 20:52:20,119 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 20:52:20,120 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 20:52:20,121 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 20:52:20,122 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:52:20,136 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 20:52:20,136 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 20:52:20,137 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-23 20:52:20,137 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-23 20:52:20,138 INFO L138 SettingsManager]: * Use SBE=true [2019-11-23 20:52:20,138 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 20:52:20,138 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 20:52:20,138 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 20:52:20,139 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 20:52:20,139 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 20:52:20,139 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 20:52:20,139 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 20:52:20,139 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 20:52:20,139 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-23 20:52:20,140 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 20:52:20,140 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 20:52:20,140 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-23 20:52:20,140 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 20:52:20,140 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 20:52:20,141 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-23 20:52:20,141 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 20:52:20,141 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 20:52:20,141 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 20:52:20,141 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 20:52:20,142 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 20:52:20,142 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 20:52:20,142 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-23 20:52:20,142 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 20:52:20,142 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 20:52:20,143 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 20:52:20,437 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 20:52:20,458 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 20:52:20,462 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 20:52:20,464 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 20:52:20,465 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 20:52:20,467 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label30.c [2019-11-23 20:52:20,554 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/764261f76/b089b10431444ac2a10dd4a255f59a24/FLAGcc75c3ff2 [2019-11-23 20:52:21,133 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 20:52:21,134 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label30.c [2019-11-23 20:52:21,158 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/764261f76/b089b10431444ac2a10dd4a255f59a24/FLAGcc75c3ff2 [2019-11-23 20:52:21,353 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/764261f76/b089b10431444ac2a10dd4a255f59a24 [2019-11-23 20:52:21,364 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 20:52:21,366 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 20:52:21,367 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 20:52:21,367 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 20:52:21,372 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 20:52:21,373 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:52:21" (1/1) ... [2019-11-23 20:52:21,376 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38480461 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:52:21, skipping insertion in model container [2019-11-23 20:52:21,376 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:52:21" (1/1) ... [2019-11-23 20:52:21,384 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 20:52:21,457 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 20:52:21,936 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 20:52:21,949 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 20:52:22,139 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 20:52:22,159 INFO L208 MainTranslator]: Completed translation [2019-11-23 20:52:22,160 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:52:22 WrapperNode [2019-11-23 20:52:22,160 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 20:52:22,161 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 20:52:22,161 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 20:52:22,161 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 20:52:22,169 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:52:22" (1/1) ... [2019-11-23 20:52:22,191 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:52:22" (1/1) ... [2019-11-23 20:52:22,258 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 20:52:22,258 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 20:52:22,259 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 20:52:22,259 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 20:52:22,269 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:52:22" (1/1) ... [2019-11-23 20:52:22,269 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:52:22" (1/1) ... [2019-11-23 20:52:22,273 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:52:22" (1/1) ... [2019-11-23 20:52:22,274 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:52:22" (1/1) ... [2019-11-23 20:52:22,294 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:52:22" (1/1) ... [2019-11-23 20:52:22,315 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:52:22" (1/1) ... [2019-11-23 20:52:22,329 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:52:22" (1/1) ... [2019-11-23 20:52:22,343 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 20:52:22,343 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 20:52:22,343 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 20:52:22,344 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 20:52:22,344 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:52:22" (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:52:22,415 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 20:52:22,416 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 20:52:23,533 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 20:52:23,533 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-23 20:52:23,535 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:52:23 BoogieIcfgContainer [2019-11-23 20:52:23,535 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 20:52:23,537 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 20:52:23,538 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 20:52:23,543 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 20:52:23,545 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 08:52:21" (1/3) ... [2019-11-23 20:52:23,546 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7928a540 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:52:23, skipping insertion in model container [2019-11-23 20:52:23,546 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:52:22" (2/3) ... [2019-11-23 20:52:23,547 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7928a540 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:52:23, skipping insertion in model container [2019-11-23 20:52:23,547 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:52:23" (3/3) ... [2019-11-23 20:52:23,549 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem01_label30.c [2019-11-23 20:52:23,562 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 20:52:23,574 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 20:52:23,588 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 20:52:23,638 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 20:52:23,638 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 20:52:23,639 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 20:52:23,639 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 20:52:23,639 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 20:52:23,640 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 20:52:23,640 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 20:52:23,641 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 20:52:23,669 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states. [2019-11-23 20:52:23,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-11-23 20:52:23,689 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:52:23,690 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:52:23,691 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:52:23,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:52:23,697 INFO L82 PathProgramCache]: Analyzing trace with hash -1318724346, now seen corresponding path program 1 times [2019-11-23 20:52:23,707 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:52:23,707 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311660030] [2019-11-23 20:52:23,708 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:52:23,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:52:24,175 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:52:24,175 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311660030] [2019-11-23 20:52:24,178 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:52:24,178 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 20:52:24,180 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774029434] [2019-11-23 20:52:24,190 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:52:24,191 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:52:24,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:52:24,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:52:24,207 INFO L87 Difference]: Start difference. First operand 198 states. Second operand 3 states. [2019-11-23 20:52:25,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:52:25,139 INFO L93 Difference]: Finished difference Result 528 states and 915 transitions. [2019-11-23 20:52:25,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:52:25,141 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 125 [2019-11-23 20:52:25,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:52:25,170 INFO L225 Difference]: With dead ends: 528 [2019-11-23 20:52:25,171 INFO L226 Difference]: Without dead ends: 266 [2019-11-23 20:52:25,180 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:52:25,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2019-11-23 20:52:25,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 266. [2019-11-23 20:52:25,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-11-23 20:52:25,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 374 transitions. [2019-11-23 20:52:25,280 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 374 transitions. Word has length 125 [2019-11-23 20:52:25,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:52:25,281 INFO L462 AbstractCegarLoop]: Abstraction has 266 states and 374 transitions. [2019-11-23 20:52:25,282 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:52:25,282 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 374 transitions. [2019-11-23 20:52:25,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-11-23 20:52:25,286 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:52:25,286 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:52:25,286 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:52:25,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:52:25,287 INFO L82 PathProgramCache]: Analyzing trace with hash 1866428878, now seen corresponding path program 1 times [2019-11-23 20:52:25,287 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:52:25,287 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540046096] [2019-11-23 20:52:25,287 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:52:25,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:52:25,440 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:52:25,441 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540046096] [2019-11-23 20:52:25,441 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:52:25,441 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:52:25,442 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371053443] [2019-11-23 20:52:25,443 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:52:25,444 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:52:25,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:52:25,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:52:25,444 INFO L87 Difference]: Start difference. First operand 266 states and 374 transitions. Second operand 3 states. [2019-11-23 20:52:25,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:52:25,946 INFO L93 Difference]: Finished difference Result 792 states and 1117 transitions. [2019-11-23 20:52:25,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:52:25,947 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 129 [2019-11-23 20:52:25,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:52:25,952 INFO L225 Difference]: With dead ends: 792 [2019-11-23 20:52:25,952 INFO L226 Difference]: Without dead ends: 528 [2019-11-23 20:52:25,954 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:52:25,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2019-11-23 20:52:25,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 528. [2019-11-23 20:52:25,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 528 states. [2019-11-23 20:52:25,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 708 transitions. [2019-11-23 20:52:25,986 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 708 transitions. Word has length 129 [2019-11-23 20:52:25,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:52:25,988 INFO L462 AbstractCegarLoop]: Abstraction has 528 states and 708 transitions. [2019-11-23 20:52:25,988 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:52:25,989 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 708 transitions. [2019-11-23 20:52:25,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-11-23 20:52:25,995 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:52:25,996 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:52:25,996 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:52:25,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:52:25,997 INFO L82 PathProgramCache]: Analyzing trace with hash -1624585415, now seen corresponding path program 1 times [2019-11-23 20:52:25,998 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:52:25,998 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895843250] [2019-11-23 20:52:25,998 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:52:26,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:52:26,073 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-23 20:52:26,073 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895843250] [2019-11-23 20:52:26,074 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:52:26,074 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 20:52:26,074 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8679475] [2019-11-23 20:52:26,075 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:52:26,075 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:52:26,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:52:26,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:52:26,076 INFO L87 Difference]: Start difference. First operand 528 states and 708 transitions. Second operand 3 states. [2019-11-23 20:52:26,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:52:26,617 INFO L93 Difference]: Finished difference Result 1316 states and 1785 transitions. [2019-11-23 20:52:26,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:52:26,618 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 148 [2019-11-23 20:52:26,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:52:26,622 INFO L225 Difference]: With dead ends: 1316 [2019-11-23 20:52:26,622 INFO L226 Difference]: Without dead ends: 790 [2019-11-23 20:52:26,623 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:52:26,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2019-11-23 20:52:26,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 659. [2019-11-23 20:52:26,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 659 states. [2019-11-23 20:52:26,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 888 transitions. [2019-11-23 20:52:26,647 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 888 transitions. Word has length 148 [2019-11-23 20:52:26,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:52:26,647 INFO L462 AbstractCegarLoop]: Abstraction has 659 states and 888 transitions. [2019-11-23 20:52:26,647 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:52:26,648 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 888 transitions. [2019-11-23 20:52:26,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-11-23 20:52:26,650 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:52:26,650 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:52:26,650 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:52:26,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:52:26,651 INFO L82 PathProgramCache]: Analyzing trace with hash 130660739, now seen corresponding path program 1 times [2019-11-23 20:52:26,651 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:52:26,651 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876751465] [2019-11-23 20:52:26,652 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:52:26,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:52:26,822 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-23 20:52:26,823 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876751465] [2019-11-23 20:52:26,823 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:52:26,823 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:52:26,824 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841012004] [2019-11-23 20:52:26,825 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 20:52:26,825 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:52:26,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 20:52:26,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:52:26,826 INFO L87 Difference]: Start difference. First operand 659 states and 888 transitions. Second operand 4 states. [2019-11-23 20:52:27,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:52:27,600 INFO L93 Difference]: Finished difference Result 1449 states and 1931 transitions. [2019-11-23 20:52:27,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 20:52:27,601 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 152 [2019-11-23 20:52:27,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:52:27,605 INFO L225 Difference]: With dead ends: 1449 [2019-11-23 20:52:27,606 INFO L226 Difference]: Without dead ends: 792 [2019-11-23 20:52:27,607 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-23 20:52:27,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 792 states. [2019-11-23 20:52:27,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 792 to 790. [2019-11-23 20:52:27,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2019-11-23 20:52:27,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 1025 transitions. [2019-11-23 20:52:27,630 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 1025 transitions. Word has length 152 [2019-11-23 20:52:27,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:52:27,630 INFO L462 AbstractCegarLoop]: Abstraction has 790 states and 1025 transitions. [2019-11-23 20:52:27,630 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 20:52:27,631 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 1025 transitions. [2019-11-23 20:52:27,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-11-23 20:52:27,635 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:52:27,635 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:27,636 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:52:27,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:52:27,637 INFO L82 PathProgramCache]: Analyzing trace with hash 1709270971, now seen corresponding path program 1 times [2019-11-23 20:52:27,637 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:52:27,637 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297842048] [2019-11-23 20:52:27,638 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:52:27,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:52:27,707 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-11-23 20:52:27,708 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297842048] [2019-11-23 20:52:27,708 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:52:27,708 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 20:52:27,709 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140221574] [2019-11-23 20:52:27,709 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:52:27,710 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:52:27,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:52:27,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:52:27,711 INFO L87 Difference]: Start difference. First operand 790 states and 1025 transitions. Second operand 3 states. [2019-11-23 20:52:28,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:52:28,188 INFO L93 Difference]: Finished difference Result 1709 states and 2245 transitions. [2019-11-23 20:52:28,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:52:28,188 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 156 [2019-11-23 20:52:28,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:52:28,194 INFO L225 Difference]: With dead ends: 1709 [2019-11-23 20:52:28,194 INFO L226 Difference]: Without dead ends: 1052 [2019-11-23 20:52:28,196 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:52:28,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1052 states. [2019-11-23 20:52:28,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1052 to 1052. [2019-11-23 20:52:28,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1052 states. [2019-11-23 20:52:28,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1052 states to 1052 states and 1323 transitions. [2019-11-23 20:52:28,221 INFO L78 Accepts]: Start accepts. Automaton has 1052 states and 1323 transitions. Word has length 156 [2019-11-23 20:52:28,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:52:28,221 INFO L462 AbstractCegarLoop]: Abstraction has 1052 states and 1323 transitions. [2019-11-23 20:52:28,221 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:52:28,221 INFO L276 IsEmpty]: Start isEmpty. Operand 1052 states and 1323 transitions. [2019-11-23 20:52:28,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-11-23 20:52:28,225 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:52:28,225 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:28,225 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:52:28,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:52:28,226 INFO L82 PathProgramCache]: Analyzing trace with hash -467564647, now seen corresponding path program 1 times [2019-11-23 20:52:28,226 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:52:28,226 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136305911] [2019-11-23 20:52:28,227 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:52:28,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:52:28,308 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-11-23 20:52:28,309 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136305911] [2019-11-23 20:52:28,309 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:52:28,309 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 20:52:28,309 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328498985] [2019-11-23 20:52:28,310 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 20:52:28,310 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:52:28,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 20:52:28,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:52:28,311 INFO L87 Difference]: Start difference. First operand 1052 states and 1323 transitions. Second operand 4 states. [2019-11-23 20:52:29,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:52:29,115 INFO L93 Difference]: Finished difference Result 3281 states and 4154 transitions. [2019-11-23 20:52:29,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 20:52:29,115 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 165 [2019-11-23 20:52:29,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:52:29,129 INFO L225 Difference]: With dead ends: 3281 [2019-11-23 20:52:29,129 INFO L226 Difference]: Without dead ends: 2362 [2019-11-23 20:52:29,131 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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:52:29,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2362 states. [2019-11-23 20:52:29,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2362 to 1707. [2019-11-23 20:52:29,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1707 states. [2019-11-23 20:52:29,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1707 states to 1707 states and 2099 transitions. [2019-11-23 20:52:29,182 INFO L78 Accepts]: Start accepts. Automaton has 1707 states and 2099 transitions. Word has length 165 [2019-11-23 20:52:29,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:52:29,182 INFO L462 AbstractCegarLoop]: Abstraction has 1707 states and 2099 transitions. [2019-11-23 20:52:29,182 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 20:52:29,182 INFO L276 IsEmpty]: Start isEmpty. Operand 1707 states and 2099 transitions. [2019-11-23 20:52:29,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-11-23 20:52:29,188 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:52:29,189 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:29,189 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:52:29,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:52:29,190 INFO L82 PathProgramCache]: Analyzing trace with hash 765811402, now seen corresponding path program 1 times [2019-11-23 20:52:29,190 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:52:29,191 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107476167] [2019-11-23 20:52:29,191 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:52:29,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:52:29,278 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-11-23 20:52:29,278 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107476167] [2019-11-23 20:52:29,279 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:52:29,279 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 20:52:29,279 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051796168] [2019-11-23 20:52:29,280 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 20:52:29,280 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:52:29,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 20:52:29,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 20:52:29,281 INFO L87 Difference]: Start difference. First operand 1707 states and 2099 transitions. Second operand 5 states. [2019-11-23 20:52:30,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:52:30,433 INFO L93 Difference]: Finished difference Result 3805 states and 4667 transitions. [2019-11-23 20:52:30,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 20:52:30,433 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 171 [2019-11-23 20:52:30,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:52:30,443 INFO L225 Difference]: With dead ends: 3805 [2019-11-23 20:52:30,443 INFO L226 Difference]: Without dead ends: 2231 [2019-11-23 20:52:30,448 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 20:52:30,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2231 states. [2019-11-23 20:52:30,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2231 to 1969. [2019-11-23 20:52:30,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1969 states. [2019-11-23 20:52:30,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1969 states to 1969 states and 2373 transitions. [2019-11-23 20:52:30,505 INFO L78 Accepts]: Start accepts. Automaton has 1969 states and 2373 transitions. Word has length 171 [2019-11-23 20:52:30,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:52:30,506 INFO L462 AbstractCegarLoop]: Abstraction has 1969 states and 2373 transitions. [2019-11-23 20:52:30,506 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 20:52:30,506 INFO L276 IsEmpty]: Start isEmpty. Operand 1969 states and 2373 transitions. [2019-11-23 20:52:30,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-11-23 20:52:30,511 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:52:30,511 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:30,511 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:52:30,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:52:30,512 INFO L82 PathProgramCache]: Analyzing trace with hash -1768959985, now seen corresponding path program 1 times [2019-11-23 20:52:30,512 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:52:30,513 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066313635] [2019-11-23 20:52:30,513 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:52:30,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:52:30,567 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-11-23 20:52:30,568 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066313635] [2019-11-23 20:52:30,568 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:52:30,568 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:52:30,568 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531846633] [2019-11-23 20:52:30,569 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:52:30,569 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:52:30,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:52:30,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:52:30,570 INFO L87 Difference]: Start difference. First operand 1969 states and 2373 transitions. Second operand 3 states. [2019-11-23 20:52:31,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:52:31,087 INFO L93 Difference]: Finished difference Result 4067 states and 4887 transitions. [2019-11-23 20:52:31,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:52:31,088 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 174 [2019-11-23 20:52:31,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:52:31,096 INFO L225 Difference]: With dead ends: 4067 [2019-11-23 20:52:31,096 INFO L226 Difference]: Without dead ends: 1969 [2019-11-23 20:52:31,099 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:52:31,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1969 states. [2019-11-23 20:52:31,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1969 to 1838. [2019-11-23 20:52:31,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1838 states. [2019-11-23 20:52:31,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 2015 transitions. [2019-11-23 20:52:31,137 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 2015 transitions. Word has length 174 [2019-11-23 20:52:31,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:52:31,138 INFO L462 AbstractCegarLoop]: Abstraction has 1838 states and 2015 transitions. [2019-11-23 20:52:31,138 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:52:31,138 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 2015 transitions. [2019-11-23 20:52:31,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-11-23 20:52:31,142 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:52:31,143 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:31,143 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:52:31,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:52:31,144 INFO L82 PathProgramCache]: Analyzing trace with hash 1455962891, now seen corresponding path program 1 times [2019-11-23 20:52:31,144 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:52:31,144 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604480205] [2019-11-23 20:52:31,144 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:52:31,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:52:31,235 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-23 20:52:31,236 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604480205] [2019-11-23 20:52:31,236 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:52:31,236 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 20:52:31,242 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941100865] [2019-11-23 20:52:31,242 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:52:31,243 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:52:31,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:52:31,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:52:31,243 INFO L87 Difference]: Start difference. First operand 1838 states and 2015 transitions. Second operand 3 states. [2019-11-23 20:52:31,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:52:31,727 INFO L93 Difference]: Finished difference Result 3674 states and 4028 transitions. [2019-11-23 20:52:31,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:52:31,728 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 189 [2019-11-23 20:52:31,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:52:31,735 INFO L225 Difference]: With dead ends: 3674 [2019-11-23 20:52:31,736 INFO L226 Difference]: Without dead ends: 1838 [2019-11-23 20:52:31,738 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:52:31,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1838 states. [2019-11-23 20:52:31,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1838 to 1838. [2019-11-23 20:52:31,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1838 states. [2019-11-23 20:52:31,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 2010 transitions. [2019-11-23 20:52:31,774 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 2010 transitions. Word has length 189 [2019-11-23 20:52:31,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:52:31,775 INFO L462 AbstractCegarLoop]: Abstraction has 1838 states and 2010 transitions. [2019-11-23 20:52:31,775 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:52:31,775 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 2010 transitions. [2019-11-23 20:52:31,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-11-23 20:52:31,780 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:52:31,780 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:52:31,781 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:52:31,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:52:31,781 INFO L82 PathProgramCache]: Analyzing trace with hash -380467305, now seen corresponding path program 1 times [2019-11-23 20:52:31,781 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:52:31,782 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358757183] [2019-11-23 20:52:31,782 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:52:31,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:52:32,018 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 139 proven. 27 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-23 20:52:32,018 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358757183] [2019-11-23 20:52:32,019 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1423984652] [2019-11-23 20:52:32,019 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:52:32,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:52:32,214 INFO L255 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-23 20:52:32,229 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:52:32,334 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-11-23 20:52:32,334 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-23 20:52:32,335 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2019-11-23 20:52:32,335 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247436813] [2019-11-23 20:52:32,335 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:52:32,336 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:52:32,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:52:32,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-11-23 20:52:32,336 INFO L87 Difference]: Start difference. First operand 1838 states and 2010 transitions. Second operand 3 states. [2019-11-23 20:52:32,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:52:32,848 INFO L93 Difference]: Finished difference Result 3936 states and 4310 transitions. [2019-11-23 20:52:32,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:52:32,849 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 218 [2019-11-23 20:52:32,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:52:32,857 INFO L225 Difference]: With dead ends: 3936 [2019-11-23 20:52:32,858 INFO L226 Difference]: Without dead ends: 1969 [2019-11-23 20:52:32,864 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 218 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-11-23 20:52:32,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1969 states. [2019-11-23 20:52:32,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1969 to 1838. [2019-11-23 20:52:32,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1838 states. [2019-11-23 20:52:32,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 1977 transitions. [2019-11-23 20:52:32,908 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 1977 transitions. Word has length 218 [2019-11-23 20:52:32,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:52:32,909 INFO L462 AbstractCegarLoop]: Abstraction has 1838 states and 1977 transitions. [2019-11-23 20:52:32,910 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:52:32,910 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 1977 transitions. [2019-11-23 20:52:32,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2019-11-23 20:52:32,916 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:52:32,916 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, 1, 1, 1, 1, 1, 1, 1, 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:52:33,120 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:52:33,121 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:52:33,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:52:33,122 INFO L82 PathProgramCache]: Analyzing trace with hash -1438607801, now seen corresponding path program 1 times [2019-11-23 20:52:33,122 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:52:33,122 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127811729] [2019-11-23 20:52:33,122 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:52:33,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:52:33,450 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:52:33,450 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127811729] [2019-11-23 20:52:33,450 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [492132264] [2019-11-23 20:52:33,451 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:52:33,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:52:33,560 INFO L255 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-23 20:52:33,567 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:52:33,663 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:52:33,664 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-23 20:52:33,664 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2019-11-23 20:52:33,664 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062038396] [2019-11-23 20:52:33,665 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:52:33,665 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:52:33,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:52:33,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-23 20:52:33,666 INFO L87 Difference]: Start difference. First operand 1838 states and 1977 transitions. Second operand 3 states. [2019-11-23 20:52:34,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:52:34,074 INFO L93 Difference]: Finished difference Result 1838 states and 1977 transitions. [2019-11-23 20:52:34,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:52:34,074 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 247 [2019-11-23 20:52:34,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:52:34,075 INFO L225 Difference]: With dead ends: 1838 [2019-11-23 20:52:34,075 INFO L226 Difference]: Without dead ends: 0 [2019-11-23 20:52:34,077 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 249 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:52:34,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-23 20:52:34,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-23 20:52:34,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-23 20:52:34,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-23 20:52:34,078 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 247 [2019-11-23 20:52:34,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:52:34,078 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-23 20:52:34,079 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:52:34,079 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-23 20:52:34,079 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-23 20:52:34,283 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:52:34,287 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-23 20:52:34,532 WARN L192 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 28 [2019-11-23 20:52:34,685 WARN L192 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 28 [2019-11-23 20:52:34,689 INFO L444 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2019-11-23 20:52:34,690 INFO L444 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2019-11-23 20:52:34,690 INFO L444 ceAbstractionStarter]: For program point L565-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:34,690 INFO L444 ceAbstractionStarter]: For program point L532-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:34,691 INFO L444 ceAbstractionStarter]: For program point L499-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:34,691 INFO L444 ceAbstractionStarter]: For program point L466-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:34,691 INFO L444 ceAbstractionStarter]: For program point L433-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:34,691 INFO L444 ceAbstractionStarter]: For program point L400-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:34,692 INFO L444 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2019-11-23 20:52:34,692 INFO L444 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2019-11-23 20:52:34,692 INFO L444 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2019-11-23 20:52:34,692 INFO L444 ceAbstractionStarter]: For program point L533(line 533) no Hoare annotation was computed. [2019-11-23 20:52:34,692 INFO L444 ceAbstractionStarter]: For program point L500(line 500) no Hoare annotation was computed. [2019-11-23 20:52:34,692 INFO L444 ceAbstractionStarter]: For program point L467(line 467) no Hoare annotation was computed. [2019-11-23 20:52:34,693 INFO L444 ceAbstractionStarter]: For program point L434(line 434) no Hoare annotation was computed. [2019-11-23 20:52:34,693 INFO L444 ceAbstractionStarter]: For program point L401(line 401) no Hoare annotation was computed. [2019-11-23 20:52:34,693 INFO L444 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2019-11-23 20:52:34,693 INFO L444 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2019-11-23 20:52:34,693 INFO L444 ceAbstractionStarter]: For program point L568-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:34,693 INFO L444 ceAbstractionStarter]: For program point L535-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:34,693 INFO L444 ceAbstractionStarter]: For program point L502-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:34,694 INFO L444 ceAbstractionStarter]: For program point L469-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:34,694 INFO L444 ceAbstractionStarter]: For program point L436-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:34,694 INFO L444 ceAbstractionStarter]: For program point L403-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:34,694 INFO L444 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2019-11-23 20:52:34,694 INFO L444 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2019-11-23 20:52:34,694 INFO L444 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2019-11-23 20:52:34,695 INFO L444 ceAbstractionStarter]: For program point L536(line 536) no Hoare annotation was computed. [2019-11-23 20:52:34,695 INFO L444 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2019-11-23 20:52:34,695 INFO L444 ceAbstractionStarter]: For program point L470(line 470) no Hoare annotation was computed. [2019-11-23 20:52:34,695 INFO L444 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2019-11-23 20:52:34,695 INFO L444 ceAbstractionStarter]: For program point L404(line 404) no Hoare annotation was computed. [2019-11-23 20:52:34,695 INFO L444 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2019-11-23 20:52:34,696 INFO L444 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2019-11-23 20:52:34,696 INFO L444 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2019-11-23 20:52:34,696 INFO L444 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2019-11-23 20:52:34,696 INFO L444 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2019-11-23 20:52:34,696 INFO L444 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2019-11-23 20:52:34,696 INFO L444 ceAbstractionStarter]: For program point L571-1(lines 571 573) no Hoare annotation was computed. [2019-11-23 20:52:34,697 INFO L444 ceAbstractionStarter]: For program point L538-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:34,697 INFO L444 ceAbstractionStarter]: For program point L505-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:34,697 INFO L444 ceAbstractionStarter]: For program point L472-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:34,697 INFO L444 ceAbstractionStarter]: For program point L439-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:34,697 INFO L444 ceAbstractionStarter]: For program point L406-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:34,697 INFO L444 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2019-11-23 20:52:34,697 INFO L444 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2019-11-23 20:52:34,698 INFO L444 ceAbstractionStarter]: For program point L572(line 572) no Hoare annotation was computed. [2019-11-23 20:52:34,698 INFO L444 ceAbstractionStarter]: For program point L539(line 539) no Hoare annotation was computed. [2019-11-23 20:52:34,698 INFO L444 ceAbstractionStarter]: For program point L506(line 506) no Hoare annotation was computed. [2019-11-23 20:52:34,698 INFO L444 ceAbstractionStarter]: For program point L473(line 473) no Hoare annotation was computed. [2019-11-23 20:52:34,698 INFO L444 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2019-11-23 20:52:34,698 INFO L444 ceAbstractionStarter]: For program point L407(line 407) no Hoare annotation was computed. [2019-11-23 20:52:34,699 INFO L444 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2019-11-23 20:52:34,699 INFO L440 ceAbstractionStarter]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse5 (= 1 ~a7~0))) (let ((.cse0 (not (= ~a16~0 6))) (.cse6 (<= ~a21~0 0)) (.cse3 (= ~a20~0 1)) (.cse4 (= ~a17~0 1)) (.cse7 (not .cse5)) (.cse1 (<= ~a17~0 0)) (.cse2 (= ~a21~0 1))) (or (and .cse0 .cse1 .cse2) (and .cse1 .cse2 .cse3) (and .cse4 .cse2 .cse3) (and .cse2 .cse3 (= ~a16~0 5)) (and .cse5 .cse6 .cse0 .cse4) (and .cse5 .cse6 .cse3) (and .cse7 .cse4 .cse2) (and .cse7 .cse1 .cse2)))) [2019-11-23 20:52:34,699 INFO L444 ceAbstractionStarter]: For program point L541-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:34,699 INFO L444 ceAbstractionStarter]: For program point L508-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:34,700 INFO L444 ceAbstractionStarter]: For program point L475-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:34,700 INFO L444 ceAbstractionStarter]: For program point L442-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:34,700 INFO L444 ceAbstractionStarter]: For program point L409-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:34,700 INFO L444 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2019-11-23 20:52:34,700 INFO L444 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2019-11-23 20:52:34,700 INFO L444 ceAbstractionStarter]: For program point L509(line 509) no Hoare annotation was computed. [2019-11-23 20:52:34,701 INFO L444 ceAbstractionStarter]: For program point L476(line 476) no Hoare annotation was computed. [2019-11-23 20:52:34,701 INFO L444 ceAbstractionStarter]: For program point L443(line 443) no Hoare annotation was computed. [2019-11-23 20:52:34,701 INFO L444 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2019-11-23 20:52:34,701 INFO L444 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2019-11-23 20:52:34,701 INFO L444 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2019-11-23 20:52:34,701 INFO L444 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2019-11-23 20:52:34,701 INFO L444 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2019-11-23 20:52:34,702 INFO L444 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2019-11-23 20:52:34,702 INFO L444 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2019-11-23 20:52:34,702 INFO L444 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2019-11-23 20:52:34,702 INFO L447 ceAbstractionStarter]: At program point L577(lines 577 594) the Hoare annotation is: true [2019-11-23 20:52:34,702 INFO L444 ceAbstractionStarter]: For program point L544-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:34,702 INFO L444 ceAbstractionStarter]: For program point L511-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:34,703 INFO L444 ceAbstractionStarter]: For program point L478-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:34,703 INFO L444 ceAbstractionStarter]: For program point L445-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:34,703 INFO L444 ceAbstractionStarter]: For program point L412-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:34,703 INFO L444 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2019-11-23 20:52:34,703 INFO L444 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2019-11-23 20:52:34,703 INFO L444 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2019-11-23 20:52:34,704 INFO L444 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2019-11-23 20:52:34,704 INFO L444 ceAbstractionStarter]: For program point L512(line 512) no Hoare annotation was computed. [2019-11-23 20:52:34,704 INFO L444 ceAbstractionStarter]: For program point L479(line 479) no Hoare annotation was computed. [2019-11-23 20:52:34,704 INFO L444 ceAbstractionStarter]: For program point L446(line 446) no Hoare annotation was computed. [2019-11-23 20:52:34,704 INFO L444 ceAbstractionStarter]: For program point L413(line 413) no Hoare annotation was computed. [2019-11-23 20:52:34,704 INFO L444 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2019-11-23 20:52:34,704 INFO L444 ceAbstractionStarter]: For program point L547-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:34,705 INFO L444 ceAbstractionStarter]: For program point L514-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:34,705 INFO L444 ceAbstractionStarter]: For program point L481-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:34,705 INFO L444 ceAbstractionStarter]: For program point L448-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:34,705 INFO L444 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2019-11-23 20:52:34,705 INFO L444 ceAbstractionStarter]: For program point L415-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:34,705 INFO L444 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2019-11-23 20:52:34,705 INFO L444 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2019-11-23 20:52:34,706 INFO L444 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2019-11-23 20:52:34,706 INFO L444 ceAbstractionStarter]: For program point L515(line 515) no Hoare annotation was computed. [2019-11-23 20:52:34,706 INFO L444 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2019-11-23 20:52:34,706 INFO L444 ceAbstractionStarter]: For program point L449(line 449) no Hoare annotation was computed. [2019-11-23 20:52:34,706 INFO L444 ceAbstractionStarter]: For program point L416(line 416) no Hoare annotation was computed. [2019-11-23 20:52:34,706 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-23 20:52:34,706 INFO L444 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2019-11-23 20:52:34,707 INFO L444 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2019-11-23 20:52:34,707 INFO L444 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2019-11-23 20:52:34,707 INFO L444 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2019-11-23 20:52:34,707 INFO L444 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2019-11-23 20:52:34,707 INFO L444 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2019-11-23 20:52:34,707 INFO L444 ceAbstractionStarter]: For program point L550-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:34,708 INFO L440 ceAbstractionStarter]: At program point L583-2(lines 583 593) the Hoare annotation is: (let ((.cse5 (= 1 ~a7~0))) (let ((.cse0 (not (= ~a16~0 6))) (.cse6 (<= ~a21~0 0)) (.cse3 (= ~a20~0 1)) (.cse4 (= ~a17~0 1)) (.cse7 (not .cse5)) (.cse1 (<= ~a17~0 0)) (.cse2 (= ~a21~0 1))) (or (and .cse0 .cse1 .cse2) (and .cse1 .cse2 .cse3) (and .cse4 .cse2 .cse3) (and .cse2 .cse3 (= ~a16~0 5)) (and .cse5 .cse6 .cse0 .cse4) (and .cse5 .cse6 .cse3) (and .cse7 .cse4 .cse2) (and .cse7 .cse1 .cse2)))) [2019-11-23 20:52:34,708 INFO L444 ceAbstractionStarter]: For program point L517-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:34,708 INFO L444 ceAbstractionStarter]: For program point L484-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:34,708 INFO L444 ceAbstractionStarter]: For program point L451-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:34,708 INFO L444 ceAbstractionStarter]: For program point L418-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:34,709 INFO L444 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2019-11-23 20:52:34,709 INFO L444 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2019-11-23 20:52:34,709 INFO L444 ceAbstractionStarter]: For program point L518(line 518) no Hoare annotation was computed. [2019-11-23 20:52:34,709 INFO L444 ceAbstractionStarter]: For program point L485(line 485) no Hoare annotation was computed. [2019-11-23 20:52:34,709 INFO L444 ceAbstractionStarter]: For program point L452(line 452) no Hoare annotation was computed. [2019-11-23 20:52:34,709 INFO L444 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2019-11-23 20:52:34,710 INFO L444 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2019-11-23 20:52:34,710 INFO L444 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2019-11-23 20:52:34,710 INFO L444 ceAbstractionStarter]: For program point L553-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:34,710 INFO L444 ceAbstractionStarter]: For program point L520-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:34,710 INFO L444 ceAbstractionStarter]: For program point L487-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:34,710 INFO L444 ceAbstractionStarter]: For program point L454-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:34,710 INFO L444 ceAbstractionStarter]: For program point L421-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:34,711 INFO L444 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2019-11-23 20:52:34,711 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-23 20:52:34,711 INFO L444 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2019-11-23 20:52:34,711 INFO L444 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2019-11-23 20:52:34,711 INFO L444 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2019-11-23 20:52:34,711 INFO L444 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2019-11-23 20:52:34,711 INFO L444 ceAbstractionStarter]: For program point L521(line 521) no Hoare annotation was computed. [2019-11-23 20:52:34,712 INFO L444 ceAbstractionStarter]: For program point L488(line 488) no Hoare annotation was computed. [2019-11-23 20:52:34,712 INFO L444 ceAbstractionStarter]: For program point L455(line 455) no Hoare annotation was computed. [2019-11-23 20:52:34,712 INFO L444 ceAbstractionStarter]: For program point L422(line 422) no Hoare annotation was computed. [2019-11-23 20:52:34,712 INFO L444 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2019-11-23 20:52:34,712 INFO L444 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2019-11-23 20:52:34,712 INFO L444 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2019-11-23 20:52:34,713 INFO L444 ceAbstractionStarter]: For program point L556-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:34,713 INFO L444 ceAbstractionStarter]: For program point L523-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:34,713 INFO L444 ceAbstractionStarter]: For program point L490-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:34,713 INFO L444 ceAbstractionStarter]: For program point L457-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:34,713 INFO L444 ceAbstractionStarter]: For program point L391(lines 391 393) no Hoare annotation was computed. [2019-11-23 20:52:34,713 INFO L444 ceAbstractionStarter]: For program point L424-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:34,714 INFO L444 ceAbstractionStarter]: For program point L391-2(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:34,714 INFO L444 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2019-11-23 20:52:34,714 INFO L444 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2019-11-23 20:52:34,714 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-23 20:52:34,714 INFO L444 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2019-11-23 20:52:34,714 INFO L444 ceAbstractionStarter]: For program point L524(line 524) no Hoare annotation was computed. [2019-11-23 20:52:34,715 INFO L444 ceAbstractionStarter]: For program point L491(line 491) no Hoare annotation was computed. [2019-11-23 20:52:34,715 INFO L444 ceAbstractionStarter]: For program point L458(line 458) no Hoare annotation was computed. [2019-11-23 20:52:34,715 INFO L444 ceAbstractionStarter]: For program point L425(line 425) no Hoare annotation was computed. [2019-11-23 20:52:34,715 INFO L444 ceAbstractionStarter]: For program point L392(line 392) no Hoare annotation was computed. [2019-11-23 20:52:34,715 INFO L444 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2019-11-23 20:52:34,715 INFO L444 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2019-11-23 20:52:34,715 INFO L444 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2019-11-23 20:52:34,716 INFO L444 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2019-11-23 20:52:34,716 INFO L444 ceAbstractionStarter]: For program point L559-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:34,716 INFO L444 ceAbstractionStarter]: For program point L526-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:34,716 INFO L444 ceAbstractionStarter]: For program point L493-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:34,716 INFO L444 ceAbstractionStarter]: For program point L460-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:34,717 INFO L444 ceAbstractionStarter]: For program point L427-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:34,717 INFO L444 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2019-11-23 20:52:34,717 INFO L444 ceAbstractionStarter]: For program point L394-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:34,717 INFO L444 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2019-11-23 20:52:34,717 INFO L444 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2019-11-23 20:52:34,717 INFO L444 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2019-11-23 20:52:34,718 INFO L444 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2019-11-23 20:52:34,718 INFO L444 ceAbstractionStarter]: For program point L494(line 494) no Hoare annotation was computed. [2019-11-23 20:52:34,718 INFO L444 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2019-11-23 20:52:34,718 INFO L444 ceAbstractionStarter]: For program point L428(line 428) no Hoare annotation was computed. [2019-11-23 20:52:34,718 INFO L444 ceAbstractionStarter]: For program point L395(line 395) no Hoare annotation was computed. [2019-11-23 20:52:34,718 INFO L444 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2019-11-23 20:52:34,718 INFO L444 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2019-11-23 20:52:34,719 INFO L444 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2019-11-23 20:52:34,719 INFO L444 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-23 20:52:34,719 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 551) no Hoare annotation was computed. [2019-11-23 20:52:34,719 INFO L444 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2019-11-23 20:52:34,719 INFO L444 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2019-11-23 20:52:34,720 INFO L444 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2019-11-23 20:52:34,720 INFO L444 ceAbstractionStarter]: For program point L562-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:34,720 INFO L444 ceAbstractionStarter]: For program point L529-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:34,720 INFO L444 ceAbstractionStarter]: For program point L496-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:34,720 INFO L444 ceAbstractionStarter]: For program point L463-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:34,720 INFO L444 ceAbstractionStarter]: For program point L430-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:34,720 INFO L444 ceAbstractionStarter]: For program point L397-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:34,721 INFO L444 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2019-11-23 20:52:34,721 INFO L444 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2019-11-23 20:52:34,721 INFO L444 ceAbstractionStarter]: For program point L530(line 530) no Hoare annotation was computed. [2019-11-23 20:52:34,721 INFO L444 ceAbstractionStarter]: For program point L497(line 497) no Hoare annotation was computed. [2019-11-23 20:52:34,721 INFO L444 ceAbstractionStarter]: For program point L464(line 464) no Hoare annotation was computed. [2019-11-23 20:52:34,721 INFO L444 ceAbstractionStarter]: For program point L431(line 431) no Hoare annotation was computed. [2019-11-23 20:52:34,722 INFO L444 ceAbstractionStarter]: For program point L398(line 398) no Hoare annotation was computed. [2019-11-23 20:52:34,722 INFO L444 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2019-11-23 20:52:34,722 INFO L444 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2019-11-23 20:52:34,722 INFO L444 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2019-11-23 20:52:34,743 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 08:52:34 BoogieIcfgContainer [2019-11-23 20:52:34,743 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-23 20:52:34,745 INFO L168 Benchmark]: Toolchain (without parser) took 13379.66 ms. Allocated memory was 136.3 MB in the beginning and 448.8 MB in the end (delta: 312.5 MB). Free memory was 99.8 MB in the beginning and 79.8 MB in the end (delta: 20.0 MB). Peak memory consumption was 332.5 MB. Max. memory is 7.1 GB. [2019-11-23 20:52:34,746 INFO L168 Benchmark]: CDTParser took 0.66 ms. Allocated memory is still 136.3 MB. Free memory was 119.5 MB in the beginning and 119.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-11-23 20:52:34,747 INFO L168 Benchmark]: CACSL2BoogieTranslator took 793.41 ms. Allocated memory was 136.3 MB in the beginning and 202.9 MB in the end (delta: 66.6 MB). Free memory was 99.6 MB in the beginning and 169.3 MB in the end (delta: -69.7 MB). Peak memory consumption was 35.8 MB. Max. memory is 7.1 GB. [2019-11-23 20:52:34,748 INFO L168 Benchmark]: Boogie Procedure Inliner took 97.55 ms. Allocated memory is still 202.9 MB. Free memory was 169.3 MB in the beginning and 164.1 MB in the end (delta: 5.2 MB). Peak memory consumption was 5.2 MB. Max. memory is 7.1 GB. [2019-11-23 20:52:34,748 INFO L168 Benchmark]: Boogie Preprocessor took 84.58 ms. Allocated memory is still 202.9 MB. Free memory was 164.1 MB in the beginning and 157.0 MB in the end (delta: 7.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 7.1 GB. [2019-11-23 20:52:34,749 INFO L168 Benchmark]: RCFGBuilder took 1191.79 ms. Allocated memory was 202.9 MB in the beginning and 232.3 MB in the end (delta: 29.4 MB). Free memory was 157.0 MB in the beginning and 169.7 MB in the end (delta: -12.8 MB). Peak memory consumption was 81.4 MB. Max. memory is 7.1 GB. [2019-11-23 20:52:34,750 INFO L168 Benchmark]: TraceAbstraction took 11206.54 ms. Allocated memory was 232.3 MB in the beginning and 448.8 MB in the end (delta: 216.5 MB). Free memory was 169.7 MB in the beginning and 79.8 MB in the end (delta: 89.9 MB). Peak memory consumption was 306.5 MB. Max. memory is 7.1 GB. [2019-11-23 20:52:34,754 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.66 ms. Allocated memory is still 136.3 MB. Free memory was 119.5 MB in the beginning and 119.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 793.41 ms. Allocated memory was 136.3 MB in the beginning and 202.9 MB in the end (delta: 66.6 MB). Free memory was 99.6 MB in the beginning and 169.3 MB in the end (delta: -69.7 MB). Peak memory consumption was 35.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 97.55 ms. Allocated memory is still 202.9 MB. Free memory was 169.3 MB in the beginning and 164.1 MB in the end (delta: 5.2 MB). Peak memory consumption was 5.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 84.58 ms. Allocated memory is still 202.9 MB. Free memory was 164.1 MB in the beginning and 157.0 MB in the end (delta: 7.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1191.79 ms. Allocated memory was 202.9 MB in the beginning and 232.3 MB in the end (delta: 29.4 MB). Free memory was 157.0 MB in the beginning and 169.7 MB in the end (delta: -12.8 MB). Peak memory consumption was 81.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 11206.54 ms. Allocated memory was 232.3 MB in the beginning and 448.8 MB in the end (delta: 216.5 MB). Free memory was 169.7 MB in the beginning and 79.8 MB in the end (delta: 89.9 MB). Peak memory consumption was 306.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 551]: 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: ((((((((!(a16 == 6) && a17 <= 0) && a21 == 1) || ((a17 <= 0 && a21 == 1) && a20 == 1)) || ((a17 == 1 && a21 == 1) && a20 == 1)) || ((a21 == 1 && a20 == 1) && a16 == 5)) || (((1 == a7 && a21 <= 0) && !(a16 == 6)) && a17 == 1)) || ((1 == a7 && a21 <= 0) && a20 == 1)) || ((!(1 == a7) && a17 == 1) && a21 == 1)) || ((!(1 == a7) && a17 <= 0) && a21 == 1) - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: ((((((((!(a16 == 6) && a17 <= 0) && a21 == 1) || ((a17 <= 0 && a21 == 1) && a20 == 1)) || ((a17 == 1 && a21 == 1) && a20 == 1)) || ((a21 == 1 && a20 == 1) && a16 == 5)) || (((1 == a7 && a21 <= 0) && !(a16 == 6)) && a17 == 1)) || ((1 == a7 && a21 <= 0) && a20 == 1)) || ((!(1 == a7) && a17 == 1) && a21 == 1)) || ((!(1 == a7) && a17 <= 0) && a21 == 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 198 locations, 1 error locations. Result: SAFE, OverallTime: 11.0s, OverallIterations: 11, TraceHistogramMax: 5, AutomataDifference: 7.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.4s, HoareTripleCheckerStatistics: 860 SDtfs, 1681 SDslu, 76 SDs, 0 SdLazy, 4427 SolverSat, 713 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 506 GetRequests, 479 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1969occurred in iteration=7, 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, 11 MinimizatonAttempts, 1312 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 37 NumberOfFragments, 177 HoareAnnotationTreeSize, 3 FomulaSimplifications, 1650 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 3 FomulaSimplificationsInter, 174 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 2339 NumberOfCodeBlocks, 2339 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 2326 ConstructedInterpolants, 0 QuantifiedInterpolants, 1007560 SizeOfPredicates, 2 NumberOfNonLiveVariables, 815 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 13 InterpolantComputations, 11 PerfectInterpolantSequences, 1245/1342 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...