/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/Problem03_label58.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 20:57:05,113 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 20:57:05,115 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 20:57:05,132 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 20:57:05,133 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 20:57:05,135 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 20:57:05,136 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 20:57:05,145 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 20:57:05,149 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 20:57:05,152 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 20:57:05,154 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 20:57:05,156 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 20:57:05,157 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 20:57:05,158 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 20:57:05,161 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 20:57:05,162 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 20:57:05,164 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 20:57:05,166 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 20:57:05,168 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 20:57:05,173 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 20:57:05,177 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 20:57:05,180 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 20:57:05,181 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 20:57:05,182 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 20:57:05,185 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 20:57:05,185 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 20:57:05,185 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 20:57:05,187 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 20:57:05,188 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 20:57:05,189 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 20:57:05,189 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 20:57:05,190 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 20:57:05,191 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 20:57:05,192 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 20:57:05,193 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 20:57:05,193 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 20:57:05,194 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 20:57:05,194 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 20:57:05,194 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 20:57:05,196 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 20:57:05,197 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 20:57:05,199 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:57:05,232 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 20:57:05,232 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 20:57:05,233 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-23 20:57:05,233 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-23 20:57:05,234 INFO L138 SettingsManager]: * Use SBE=true [2019-11-23 20:57:05,234 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 20:57:05,234 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 20:57:05,234 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 20:57:05,235 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 20:57:05,235 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 20:57:05,235 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 20:57:05,235 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 20:57:05,235 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 20:57:05,235 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-23 20:57:05,236 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 20:57:05,236 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 20:57:05,236 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-23 20:57:05,236 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 20:57:05,236 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 20:57:05,237 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-23 20:57:05,237 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 20:57:05,237 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 20:57:05,237 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 20:57:05,237 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 20:57:05,238 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 20:57:05,238 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 20:57:05,238 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-23 20:57:05,238 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 20:57:05,238 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 20:57:05,239 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 20:57:05,567 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 20:57:05,590 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 20:57:05,593 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 20:57:05,594 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 20:57:05,594 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 20:57:05,595 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem03_label58.c [2019-11-23 20:57:05,666 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed83ae2ce/890746f3713d4abf947d87d439b03535/FLAGc1c45343b [2019-11-23 20:57:06,304 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 20:57:06,305 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem03_label58.c [2019-11-23 20:57:06,324 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed83ae2ce/890746f3713d4abf947d87d439b03535/FLAGc1c45343b [2019-11-23 20:57:06,490 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed83ae2ce/890746f3713d4abf947d87d439b03535 [2019-11-23 20:57:06,498 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 20:57:06,499 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 20:57:06,500 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 20:57:06,500 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 20:57:06,504 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 20:57:06,505 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:57:06" (1/1) ... [2019-11-23 20:57:06,507 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e223023 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:57:06, skipping insertion in model container [2019-11-23 20:57:06,508 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:57:06" (1/1) ... [2019-11-23 20:57:06,515 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 20:57:06,596 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 20:57:07,412 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 20:57:07,418 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 20:57:07,721 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 20:57:07,744 INFO L208 MainTranslator]: Completed translation [2019-11-23 20:57:07,745 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:57:07 WrapperNode [2019-11-23 20:57:07,745 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 20:57:07,746 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 20:57:07,746 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 20:57:07,746 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 20:57:07,755 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:57:07" (1/1) ... [2019-11-23 20:57:07,797 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:57:07" (1/1) ... [2019-11-23 20:57:07,881 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 20:57:07,881 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 20:57:07,881 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 20:57:07,881 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 20:57:07,892 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:57:07" (1/1) ... [2019-11-23 20:57:07,892 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:57:07" (1/1) ... [2019-11-23 20:57:07,899 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:57:07" (1/1) ... [2019-11-23 20:57:07,899 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:57:07" (1/1) ... [2019-11-23 20:57:07,939 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:57:07" (1/1) ... [2019-11-23 20:57:07,953 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:57:07" (1/1) ... [2019-11-23 20:57:07,969 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:57:07" (1/1) ... [2019-11-23 20:57:07,990 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 20:57:07,991 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 20:57:07,991 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 20:57:07,991 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 20:57:07,992 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:57:07" (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:57:08,086 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 20:57:08,086 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 20:57:10,453 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 20:57:10,455 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-23 20:57:10,456 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:57:10 BoogieIcfgContainer [2019-11-23 20:57:10,457 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 20:57:10,458 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 20:57:10,458 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 20:57:10,462 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 20:57:10,464 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 08:57:06" (1/3) ... [2019-11-23 20:57:10,465 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c95caa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:57:10, skipping insertion in model container [2019-11-23 20:57:10,465 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:57:07" (2/3) ... [2019-11-23 20:57:10,466 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c95caa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:57:10, skipping insertion in model container [2019-11-23 20:57:10,466 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:57:10" (3/3) ... [2019-11-23 20:57:10,468 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem03_label58.c [2019-11-23 20:57:10,478 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 20:57:10,489 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 20:57:10,505 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 20:57:10,557 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 20:57:10,557 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 20:57:10,557 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 20:57:10,558 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 20:57:10,558 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 20:57:10,559 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 20:57:10,559 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 20:57:10,559 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 20:57:10,601 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states. [2019-11-23 20:57:10,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-11-23 20:57:10,626 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:57:10,628 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:10,629 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:57:10,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:57:10,638 INFO L82 PathProgramCache]: Analyzing trace with hash -415972030, now seen corresponding path program 1 times [2019-11-23 20:57:10,650 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:57:10,651 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814727390] [2019-11-23 20:57:10,651 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:57:11,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:57:11,396 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:57:11,396 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814727390] [2019-11-23 20:57:11,398 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:57:11,398 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 20:57:11,400 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125298967] [2019-11-23 20:57:11,406 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:57:11,407 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:57:11,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:57:11,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:57:11,423 INFO L87 Difference]: Start difference. First operand 302 states. Second operand 3 states. [2019-11-23 20:57:13,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:57:13,132 INFO L93 Difference]: Finished difference Result 829 states and 1478 transitions. [2019-11-23 20:57:13,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:57:13,133 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 160 [2019-11-23 20:57:13,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:57:13,157 INFO L225 Difference]: With dead ends: 829 [2019-11-23 20:57:13,157 INFO L226 Difference]: Without dead ends: 463 [2019-11-23 20:57:13,170 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:57:13,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2019-11-23 20:57:13,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 449. [2019-11-23 20:57:13,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 449 states. [2019-11-23 20:57:13,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 725 transitions. [2019-11-23 20:57:13,290 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 725 transitions. Word has length 160 [2019-11-23 20:57:13,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:57:13,294 INFO L462 AbstractCegarLoop]: Abstraction has 449 states and 725 transitions. [2019-11-23 20:57:13,294 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:57:13,295 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 725 transitions. [2019-11-23 20:57:13,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-11-23 20:57:13,305 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:57:13,305 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:13,306 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:57:13,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:57:13,306 INFO L82 PathProgramCache]: Analyzing trace with hash 1978469906, now seen corresponding path program 1 times [2019-11-23 20:57:13,307 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:57:13,310 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217574293] [2019-11-23 20:57:13,310 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:57:13,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:57:13,497 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:57:13,497 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217574293] [2019-11-23 20:57:13,498 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:57:13,498 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:57:13,498 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569909209] [2019-11-23 20:57:13,500 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 20:57:13,500 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:57:13,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 20:57:13,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:57:13,501 INFO L87 Difference]: Start difference. First operand 449 states and 725 transitions. Second operand 4 states. [2019-11-23 20:57:15,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:57:15,281 INFO L93 Difference]: Finished difference Result 1735 states and 2827 transitions. [2019-11-23 20:57:15,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 20:57:15,289 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 165 [2019-11-23 20:57:15,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:57:15,297 INFO L225 Difference]: With dead ends: 1735 [2019-11-23 20:57:15,297 INFO L226 Difference]: Without dead ends: 1288 [2019-11-23 20:57:15,302 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:57:15,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1288 states. [2019-11-23 20:57:15,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1288 to 859. [2019-11-23 20:57:15,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 859 states. [2019-11-23 20:57:15,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 859 states to 859 states and 1315 transitions. [2019-11-23 20:57:15,335 INFO L78 Accepts]: Start accepts. Automaton has 859 states and 1315 transitions. Word has length 165 [2019-11-23 20:57:15,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:57:15,335 INFO L462 AbstractCegarLoop]: Abstraction has 859 states and 1315 transitions. [2019-11-23 20:57:15,335 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 20:57:15,336 INFO L276 IsEmpty]: Start isEmpty. Operand 859 states and 1315 transitions. [2019-11-23 20:57:15,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-11-23 20:57:15,338 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:57:15,338 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:15,339 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:57:15,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:57:15,339 INFO L82 PathProgramCache]: Analyzing trace with hash 939548030, now seen corresponding path program 1 times [2019-11-23 20:57:15,340 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:57:15,340 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006885973] [2019-11-23 20:57:15,340 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:57:15,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:57:15,422 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:57:15,422 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006885973] [2019-11-23 20:57:15,423 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:57:15,423 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 20:57:15,424 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369088201] [2019-11-23 20:57:15,424 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:57:15,425 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:57:15,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:57:15,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:57:15,426 INFO L87 Difference]: Start difference. First operand 859 states and 1315 transitions. Second operand 3 states. [2019-11-23 20:57:15,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:57:15,945 INFO L93 Difference]: Finished difference Result 1695 states and 2599 transitions. [2019-11-23 20:57:15,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:57:15,945 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 173 [2019-11-23 20:57:15,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:57:15,949 INFO L225 Difference]: With dead ends: 1695 [2019-11-23 20:57:15,950 INFO L226 Difference]: Without dead ends: 838 [2019-11-23 20:57:15,951 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:57:15,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2019-11-23 20:57:15,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 838. [2019-11-23 20:57:15,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 838 states. [2019-11-23 20:57:15,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 1236 transitions. [2019-11-23 20:57:15,973 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 1236 transitions. Word has length 173 [2019-11-23 20:57:15,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:57:15,973 INFO L462 AbstractCegarLoop]: Abstraction has 838 states and 1236 transitions. [2019-11-23 20:57:15,973 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:57:15,973 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1236 transitions. [2019-11-23 20:57:15,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-11-23 20:57:15,976 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:57:15,977 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:15,977 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:57:15,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:57:15,977 INFO L82 PathProgramCache]: Analyzing trace with hash -1519707828, now seen corresponding path program 1 times [2019-11-23 20:57:15,978 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:57:15,978 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039782249] [2019-11-23 20:57:15,978 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:57:16,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:57:16,055 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-23 20:57:16,055 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039782249] [2019-11-23 20:57:16,055 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:57:16,056 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:57:16,056 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362936460] [2019-11-23 20:57:16,057 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 20:57:16,057 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:57:16,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 20:57:16,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:57:16,058 INFO L87 Difference]: Start difference. First operand 838 states and 1236 transitions. Second operand 4 states. [2019-11-23 20:57:17,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:57:17,577 INFO L93 Difference]: Finished difference Result 3313 states and 4894 transitions. [2019-11-23 20:57:17,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 20:57:17,578 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 174 [2019-11-23 20:57:17,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:57:17,591 INFO L225 Difference]: With dead ends: 3313 [2019-11-23 20:57:17,591 INFO L226 Difference]: Without dead ends: 2477 [2019-11-23 20:57:17,594 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:57:17,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2477 states. [2019-11-23 20:57:17,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2477 to 1655. [2019-11-23 20:57:17,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1655 states. [2019-11-23 20:57:17,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1655 states to 1655 states and 2337 transitions. [2019-11-23 20:57:17,641 INFO L78 Accepts]: Start accepts. Automaton has 1655 states and 2337 transitions. Word has length 174 [2019-11-23 20:57:17,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:57:17,641 INFO L462 AbstractCegarLoop]: Abstraction has 1655 states and 2337 transitions. [2019-11-23 20:57:17,642 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 20:57:17,642 INFO L276 IsEmpty]: Start isEmpty. Operand 1655 states and 2337 transitions. [2019-11-23 20:57:17,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-11-23 20:57:17,646 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:57:17,647 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:17,647 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:57:17,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:57:17,647 INFO L82 PathProgramCache]: Analyzing trace with hash -774618925, now seen corresponding path program 1 times [2019-11-23 20:57:17,648 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:57:17,648 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290252062] [2019-11-23 20:57:17,648 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:57:17,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:57:17,715 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-23 20:57:17,716 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290252062] [2019-11-23 20:57:17,716 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:57:17,716 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 20:57:17,716 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31095472] [2019-11-23 20:57:17,717 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:57:17,717 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:57:17,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:57:17,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:57:17,718 INFO L87 Difference]: Start difference. First operand 1655 states and 2337 transitions. Second operand 3 states. [2019-11-23 20:57:18,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:57:18,795 INFO L93 Difference]: Finished difference Result 4133 states and 5815 transitions. [2019-11-23 20:57:18,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:57:18,799 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 177 [2019-11-23 20:57:18,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:57:18,811 INFO L225 Difference]: With dead ends: 4133 [2019-11-23 20:57:18,811 INFO L226 Difference]: Without dead ends: 2480 [2019-11-23 20:57:18,814 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:57:18,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2480 states. [2019-11-23 20:57:18,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2480 to 2479. [2019-11-23 20:57:18,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2479 states. [2019-11-23 20:57:18,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2479 states to 2479 states and 3454 transitions. [2019-11-23 20:57:18,865 INFO L78 Accepts]: Start accepts. Automaton has 2479 states and 3454 transitions. Word has length 177 [2019-11-23 20:57:18,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:57:18,866 INFO L462 AbstractCegarLoop]: Abstraction has 2479 states and 3454 transitions. [2019-11-23 20:57:18,866 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:57:18,866 INFO L276 IsEmpty]: Start isEmpty. Operand 2479 states and 3454 transitions. [2019-11-23 20:57:18,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-11-23 20:57:18,871 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:57:18,871 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:18,871 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:57:18,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:57:18,872 INFO L82 PathProgramCache]: Analyzing trace with hash 686334728, now seen corresponding path program 1 times [2019-11-23 20:57:18,872 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:57:18,872 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089468392] [2019-11-23 20:57:18,873 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:57:18,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:57:18,942 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-23 20:57:18,942 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089468392] [2019-11-23 20:57:18,943 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:57:18,943 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 20:57:18,943 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439924356] [2019-11-23 20:57:18,944 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:57:18,944 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:57:18,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:57:18,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:57:18,945 INFO L87 Difference]: Start difference. First operand 2479 states and 3454 transitions. Second operand 3 states. [2019-11-23 20:57:19,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:57:19,357 INFO L93 Difference]: Finished difference Result 7424 states and 10346 transitions. [2019-11-23 20:57:19,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:57:19,357 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 180 [2019-11-23 20:57:19,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:57:19,380 INFO L225 Difference]: With dead ends: 7424 [2019-11-23 20:57:19,380 INFO L226 Difference]: Without dead ends: 4947 [2019-11-23 20:57:19,385 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:57:19,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4947 states. [2019-11-23 20:57:19,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4947 to 4945. [2019-11-23 20:57:19,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4945 states. [2019-11-23 20:57:19,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4945 states to 4945 states and 6884 transitions. [2019-11-23 20:57:19,483 INFO L78 Accepts]: Start accepts. Automaton has 4945 states and 6884 transitions. Word has length 180 [2019-11-23 20:57:19,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:57:19,483 INFO L462 AbstractCegarLoop]: Abstraction has 4945 states and 6884 transitions. [2019-11-23 20:57:19,484 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:57:19,484 INFO L276 IsEmpty]: Start isEmpty. Operand 4945 states and 6884 transitions. [2019-11-23 20:57:19,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-11-23 20:57:19,491 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:57:19,491 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:19,492 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:57:19,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:57:19,492 INFO L82 PathProgramCache]: Analyzing trace with hash -494215325, now seen corresponding path program 1 times [2019-11-23 20:57:19,492 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:57:19,493 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016123264] [2019-11-23 20:57:19,493 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:57:19,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:57:19,651 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-23 20:57:19,653 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016123264] [2019-11-23 20:57:19,657 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:57:19,657 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:57:19,658 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885455674] [2019-11-23 20:57:19,658 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:57:19,664 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:57:19,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:57:19,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:57:19,667 INFO L87 Difference]: Start difference. First operand 4945 states and 6884 transitions. Second operand 3 states. [2019-11-23 20:57:20,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:57:20,675 INFO L93 Difference]: Finished difference Result 14560 states and 20285 transitions. [2019-11-23 20:57:20,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:57:20,676 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 182 [2019-11-23 20:57:20,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:57:20,714 INFO L225 Difference]: With dead ends: 14560 [2019-11-23 20:57:20,715 INFO L226 Difference]: Without dead ends: 9617 [2019-11-23 20:57:20,723 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:57:20,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9617 states. [2019-11-23 20:57:20,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9617 to 9615. [2019-11-23 20:57:20,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9615 states. [2019-11-23 20:57:20,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9615 states to 9615 states and 12493 transitions. [2019-11-23 20:57:20,915 INFO L78 Accepts]: Start accepts. Automaton has 9615 states and 12493 transitions. Word has length 182 [2019-11-23 20:57:20,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:57:20,916 INFO L462 AbstractCegarLoop]: Abstraction has 9615 states and 12493 transitions. [2019-11-23 20:57:20,916 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:57:20,916 INFO L276 IsEmpty]: Start isEmpty. Operand 9615 states and 12493 transitions. [2019-11-23 20:57:20,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-11-23 20:57:20,926 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:57:20,926 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:20,926 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:57:20,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:57:20,927 INFO L82 PathProgramCache]: Analyzing trace with hash -227827320, now seen corresponding path program 2 times [2019-11-23 20:57:20,927 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:57:20,927 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732127231] [2019-11-23 20:57:20,927 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:57:20,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:57:21,122 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-23 20:57:21,123 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732127231] [2019-11-23 20:57:21,123 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:57:21,123 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:57:21,124 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74070427] [2019-11-23 20:57:21,124 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:57:21,124 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:57:21,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:57:21,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:57:21,125 INFO L87 Difference]: Start difference. First operand 9615 states and 12493 transitions. Second operand 3 states. [2019-11-23 20:57:22,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:57:22,247 INFO L93 Difference]: Finished difference Result 26540 states and 34559 transitions. [2019-11-23 20:57:22,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:57:22,247 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 184 [2019-11-23 20:57:22,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:57:22,305 INFO L225 Difference]: With dead ends: 26540 [2019-11-23 20:57:22,305 INFO L226 Difference]: Without dead ends: 16927 [2019-11-23 20:57:22,318 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:57:22,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16927 states. [2019-11-23 20:57:22,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16927 to 16923. [2019-11-23 20:57:22,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16923 states. [2019-11-23 20:57:22,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16923 states to 16923 states and 20089 transitions. [2019-11-23 20:57:22,606 INFO L78 Accepts]: Start accepts. Automaton has 16923 states and 20089 transitions. Word has length 184 [2019-11-23 20:57:22,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:57:22,607 INFO L462 AbstractCegarLoop]: Abstraction has 16923 states and 20089 transitions. [2019-11-23 20:57:22,607 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:57:22,608 INFO L276 IsEmpty]: Start isEmpty. Operand 16923 states and 20089 transitions. [2019-11-23 20:57:22,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2019-11-23 20:57:22,625 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:57:22,625 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:22,626 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:57:22,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:57:22,626 INFO L82 PathProgramCache]: Analyzing trace with hash -1910647691, now seen corresponding path program 1 times [2019-11-23 20:57:22,626 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:57:22,627 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053569776] [2019-11-23 20:57:22,627 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:57:22,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:57:22,727 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-23 20:57:22,727 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053569776] [2019-11-23 20:57:22,727 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:57:22,727 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:57:22,732 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568869098] [2019-11-23 20:57:22,733 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 20:57:22,733 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:57:22,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 20:57:22,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:57:22,734 INFO L87 Difference]: Start difference. First operand 16923 states and 20089 transitions. Second operand 4 states. [2019-11-23 20:57:24,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:57:24,088 INFO L93 Difference]: Finished difference Result 33846 states and 40180 transitions. [2019-11-23 20:57:24,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:57:24,089 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 202 [2019-11-23 20:57:24,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:57:24,113 INFO L225 Difference]: With dead ends: 33846 [2019-11-23 20:57:24,113 INFO L226 Difference]: Without dead ends: 16925 [2019-11-23 20:57:24,132 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:57:24,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16925 states. [2019-11-23 20:57:24,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16925 to 16923. [2019-11-23 20:57:24,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16923 states. [2019-11-23 20:57:24,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16923 states to 16923 states and 19544 transitions. [2019-11-23 20:57:24,382 INFO L78 Accepts]: Start accepts. Automaton has 16923 states and 19544 transitions. Word has length 202 [2019-11-23 20:57:24,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:57:24,382 INFO L462 AbstractCegarLoop]: Abstraction has 16923 states and 19544 transitions. [2019-11-23 20:57:24,383 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 20:57:24,383 INFO L276 IsEmpty]: Start isEmpty. Operand 16923 states and 19544 transitions. [2019-11-23 20:57:24,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2019-11-23 20:57:24,400 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:57:24,401 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:24,401 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:57:24,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:57:24,401 INFO L82 PathProgramCache]: Analyzing trace with hash -842943628, now seen corresponding path program 1 times [2019-11-23 20:57:24,402 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:57:24,402 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322148761] [2019-11-23 20:57:24,402 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:57:24,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:57:24,594 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-23 20:57:24,594 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322148761] [2019-11-23 20:57:24,595 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:57:24,595 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 20:57:24,595 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907143134] [2019-11-23 20:57:24,595 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 20:57:24,596 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:57:24,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 20:57:24,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 20:57:24,596 INFO L87 Difference]: Start difference. First operand 16923 states and 19544 transitions. Second operand 5 states. [2019-11-23 20:57:26,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:57:26,550 INFO L93 Difference]: Finished difference Result 77631 states and 89804 transitions. [2019-11-23 20:57:26,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 20:57:26,550 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 227 [2019-11-23 20:57:26,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:57:26,638 INFO L225 Difference]: With dead ends: 77631 [2019-11-23 20:57:26,639 INFO L226 Difference]: Without dead ends: 60710 [2019-11-23 20:57:26,667 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 20:57:26,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60710 states. [2019-11-23 20:57:28,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60710 to 60704. [2019-11-23 20:57:28,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60704 states. [2019-11-23 20:57:28,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60704 states to 60704 states and 70206 transitions. [2019-11-23 20:57:28,595 INFO L78 Accepts]: Start accepts. Automaton has 60704 states and 70206 transitions. Word has length 227 [2019-11-23 20:57:28,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:57:28,597 INFO L462 AbstractCegarLoop]: Abstraction has 60704 states and 70206 transitions. [2019-11-23 20:57:28,597 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 20:57:28,597 INFO L276 IsEmpty]: Start isEmpty. Operand 60704 states and 70206 transitions. [2019-11-23 20:57:28,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-11-23 20:57:28,617 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:57:28,619 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:57:28,620 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:57:28,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:57:28,620 INFO L82 PathProgramCache]: Analyzing trace with hash 1840322684, now seen corresponding path program 1 times [2019-11-23 20:57:28,621 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:57:28,621 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697900210] [2019-11-23 20:57:28,621 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:57:28,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:57:28,747 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:57:28,748 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697900210] [2019-11-23 20:57:28,748 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:57:28,748 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:57:28,748 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703387240] [2019-11-23 20:57:28,749 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:57:28,749 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:57:28,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:57:28,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:57:28,750 INFO L87 Difference]: Start difference. First operand 60704 states and 70206 transitions. Second operand 3 states. [2019-11-23 20:57:30,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:57:30,447 INFO L93 Difference]: Finished difference Result 143587 states and 166565 transitions. [2019-11-23 20:57:30,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:57:30,447 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 230 [2019-11-23 20:57:30,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:57:30,546 INFO L225 Difference]: With dead ends: 143587 [2019-11-23 20:57:30,547 INFO L226 Difference]: Without dead ends: 82885 [2019-11-23 20:57:30,592 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:57:30,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82885 states. [2019-11-23 20:57:33,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82885 to 82831. [2019-11-23 20:57:33,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82831 states. [2019-11-23 20:57:33,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82831 states to 82831 states and 95016 transitions. [2019-11-23 20:57:33,401 INFO L78 Accepts]: Start accepts. Automaton has 82831 states and 95016 transitions. Word has length 230 [2019-11-23 20:57:33,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:57:33,401 INFO L462 AbstractCegarLoop]: Abstraction has 82831 states and 95016 transitions. [2019-11-23 20:57:33,402 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:57:33,402 INFO L276 IsEmpty]: Start isEmpty. Operand 82831 states and 95016 transitions. [2019-11-23 20:57:33,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2019-11-23 20:57:33,444 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:57:33,444 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:57:33,445 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:57:33,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:57:33,445 INFO L82 PathProgramCache]: Analyzing trace with hash 606323975, now seen corresponding path program 1 times [2019-11-23 20:57:33,445 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:57:33,446 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44076777] [2019-11-23 20:57:33,446 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:57:33,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:57:33,635 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 86 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-11-23 20:57:33,635 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44076777] [2019-11-23 20:57:33,636 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1087327431] [2019-11-23 20:57:33,636 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:57:33,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:57:33,799 INFO L255 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-23 20:57:33,821 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:57:33,880 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-23 20:57:33,880 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-23 20:57:33,880 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2019-11-23 20:57:33,881 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270074478] [2019-11-23 20:57:33,881 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:57:33,881 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:57:33,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:57:33,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-23 20:57:33,882 INFO L87 Difference]: Start difference. First operand 82831 states and 95016 transitions. Second operand 3 states. [2019-11-23 20:57:35,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:57:35,512 INFO L93 Difference]: Finished difference Result 161604 states and 185341 transitions. [2019-11-23 20:57:35,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:57:35,513 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 238 [2019-11-23 20:57:35,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:57:35,581 INFO L225 Difference]: With dead ends: 161604 [2019-11-23 20:57:35,581 INFO L226 Difference]: Without dead ends: 78775 [2019-11-23 20:57:35,611 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 237 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-23 20:57:35,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78775 states. [2019-11-23 20:57:36,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78775 to 72876. [2019-11-23 20:57:36,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72876 states. [2019-11-23 20:57:36,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72876 states to 72876 states and 81908 transitions. [2019-11-23 20:57:36,365 INFO L78 Accepts]: Start accepts. Automaton has 72876 states and 81908 transitions. Word has length 238 [2019-11-23 20:57:36,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:57:36,365 INFO L462 AbstractCegarLoop]: Abstraction has 72876 states and 81908 transitions. [2019-11-23 20:57:36,365 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:57:36,366 INFO L276 IsEmpty]: Start isEmpty. Operand 72876 states and 81908 transitions. [2019-11-23 20:57:36,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2019-11-23 20:57:36,388 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:57:36,388 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-23 20:57:36,591 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:57:36,592 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:57:36,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:57:36,593 INFO L82 PathProgramCache]: Analyzing trace with hash -801056395, now seen corresponding path program 1 times [2019-11-23 20:57:36,593 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:57:36,593 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311251139] [2019-11-23 20:57:36,594 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:57:36,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:57:37,098 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 143 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-23 20:57:37,098 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311251139] [2019-11-23 20:57:37,098 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:57:37,099 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 20:57:37,099 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194899816] [2019-11-23 20:57:37,099 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:57:37,100 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:57:37,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:57:37,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:57:37,100 INFO L87 Difference]: Start difference. First operand 72876 states and 81908 transitions. Second operand 3 states. [2019-11-23 20:57:37,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:57:37,691 INFO L93 Difference]: Finished difference Result 214341 states and 240595 transitions. [2019-11-23 20:57:37,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:57:37,692 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 300 [2019-11-23 20:57:37,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:57:37,812 INFO L225 Difference]: With dead ends: 214341 [2019-11-23 20:57:37,812 INFO L226 Difference]: Without dead ends: 141467 [2019-11-23 20:57:37,854 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:57:37,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141467 states. [2019-11-23 20:57:40,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141467 to 141465. [2019-11-23 20:57:40,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141465 states. [2019-11-23 20:57:40,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141465 states to 141465 states and 158679 transitions. [2019-11-23 20:57:40,967 INFO L78 Accepts]: Start accepts. Automaton has 141465 states and 158679 transitions. Word has length 300 [2019-11-23 20:57:40,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:57:40,967 INFO L462 AbstractCegarLoop]: Abstraction has 141465 states and 158679 transitions. [2019-11-23 20:57:40,967 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:57:40,967 INFO L276 IsEmpty]: Start isEmpty. Operand 141465 states and 158679 transitions. [2019-11-23 20:57:41,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 368 [2019-11-23 20:57:41,015 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:57:41,016 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:57:41,016 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:57:41,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:57:41,016 INFO L82 PathProgramCache]: Analyzing trace with hash 871529716, now seen corresponding path program 1 times [2019-11-23 20:57:41,016 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:57:41,017 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33635552] [2019-11-23 20:57:41,017 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:57:41,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:57:41,727 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 217 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2019-11-23 20:57:41,727 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33635552] [2019-11-23 20:57:41,727 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:57:41,727 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:57:41,728 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190588363] [2019-11-23 20:57:41,729 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:57:41,729 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:57:41,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:57:41,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:57:41,730 INFO L87 Difference]: Start difference. First operand 141465 states and 158679 transitions. Second operand 3 states. [2019-11-23 20:57:43,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:57:43,508 INFO L93 Difference]: Finished difference Result 321518 states and 362081 transitions. [2019-11-23 20:57:43,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:57:43,509 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 367 [2019-11-23 20:57:43,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:57:43,509 INFO L225 Difference]: With dead ends: 321518 [2019-11-23 20:57:43,510 INFO L226 Difference]: Without dead ends: 0 [2019-11-23 20:57:43,602 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 3 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:57:43,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-23 20:57:43,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-23 20:57:43,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-23 20:57:43,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-23 20:57:43,602 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 367 [2019-11-23 20:57:43,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:57:43,603 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-23 20:57:43,603 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:57:43,603 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-23 20:57:43,603 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-23 20:57:43,607 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-23 20:57:49,424 WARN L192 SmtUtils]: Spent 5.80 s on a formula simplification. DAG size of input: 969 DAG size of output: 339 [2019-11-23 20:57:52,683 WARN L192 SmtUtils]: Spent 3.25 s on a formula simplification. DAG size of input: 969 DAG size of output: 339 [2019-11-23 20:57:55,929 WARN L192 SmtUtils]: Spent 3.24 s on a formula simplification. DAG size of input: 334 DAG size of output: 57 [2019-11-23 20:57:59,169 WARN L192 SmtUtils]: Spent 3.24 s on a formula simplification. DAG size of input: 334 DAG size of output: 57 [2019-11-23 20:57:59,173 INFO L444 ceAbstractionStarter]: For program point L498(lines 498 511) no Hoare annotation was computed. [2019-11-23 20:57:59,173 INFO L444 ceAbstractionStarter]: For program point L498-2(lines 498 511) no Hoare annotation was computed. [2019-11-23 20:57:59,173 INFO L444 ceAbstractionStarter]: For program point L1423(lines 1423 1465) no Hoare annotation was computed. [2019-11-23 20:57:59,173 INFO L444 ceAbstractionStarter]: For program point L366(lines 366 1465) no Hoare annotation was computed. [2019-11-23 20:57:59,174 INFO L444 ceAbstractionStarter]: For program point L1622-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:57:59,174 INFO L444 ceAbstractionStarter]: For program point L1556-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:57:59,174 INFO L444 ceAbstractionStarter]: For program point L1490-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:57:59,174 INFO L444 ceAbstractionStarter]: For program point L301(lines 301 1465) no Hoare annotation was computed. [2019-11-23 20:57:59,174 INFO L444 ceAbstractionStarter]: For program point L1226(lines 1226 1465) no Hoare annotation was computed. [2019-11-23 20:57:59,174 INFO L444 ceAbstractionStarter]: For program point L1623(line 1623) no Hoare annotation was computed. [2019-11-23 20:57:59,174 INFO L444 ceAbstractionStarter]: For program point L566(lines 566 1465) no Hoare annotation was computed. [2019-11-23 20:57:59,174 INFO L444 ceAbstractionStarter]: For program point L1557(line 1557) no Hoare annotation was computed. [2019-11-23 20:57:59,175 INFO L444 ceAbstractionStarter]: For program point L1491(line 1491) no Hoare annotation was computed. [2019-11-23 20:57:59,175 INFO L444 ceAbstractionStarter]: For program point L434(lines 434 1465) no Hoare annotation was computed. [2019-11-23 20:57:59,175 INFO L444 ceAbstractionStarter]: For program point L1359(lines 1359 1465) no Hoare annotation was computed. [2019-11-23 20:57:59,175 INFO L444 ceAbstractionStarter]: For program point L1095(lines 1095 1465) no Hoare annotation was computed. [2019-11-23 20:57:59,175 INFO L444 ceAbstractionStarter]: For program point L633(lines 633 1465) no Hoare annotation was computed. [2019-11-23 20:57:59,175 INFO L444 ceAbstractionStarter]: For program point L1360(lines 1360 1379) no Hoare annotation was computed. [2019-11-23 20:57:59,175 INFO L444 ceAbstractionStarter]: For program point L1360-2(lines 1360 1379) no Hoare annotation was computed. [2019-11-23 20:57:59,175 INFO L444 ceAbstractionStarter]: For program point L1162(lines 1162 1465) no Hoare annotation was computed. [2019-11-23 20:57:59,176 INFO L444 ceAbstractionStarter]: For program point L105(lines 105 1465) no Hoare annotation was computed. [2019-11-23 20:57:59,176 INFO L444 ceAbstractionStarter]: For program point L1625-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:57:59,176 INFO L444 ceAbstractionStarter]: For program point L1559-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:57:59,176 INFO L444 ceAbstractionStarter]: For program point L1493-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:57:59,176 INFO L444 ceAbstractionStarter]: For program point L238(lines 238 1465) no Hoare annotation was computed. [2019-11-23 20:57:59,176 INFO L444 ceAbstractionStarter]: For program point L172(lines 172 1465) no Hoare annotation was computed. [2019-11-23 20:57:59,176 INFO L444 ceAbstractionStarter]: For program point L1031(lines 1031 1465) no Hoare annotation was computed. [2019-11-23 20:57:59,176 INFO L444 ceAbstractionStarter]: For program point L899(lines 899 1465) no Hoare annotation was computed. [2019-11-23 20:57:59,177 INFO L444 ceAbstractionStarter]: For program point L701(lines 701 1465) no Hoare annotation was computed. [2019-11-23 20:57:59,177 INFO L444 ceAbstractionStarter]: For program point L1626(line 1626) no Hoare annotation was computed. [2019-11-23 20:57:59,177 INFO L444 ceAbstractionStarter]: For program point L1560(line 1560) no Hoare annotation was computed. [2019-11-23 20:57:59,177 INFO L444 ceAbstractionStarter]: For program point L1494(line 1494) no Hoare annotation was computed. [2019-11-23 20:57:59,177 INFO L444 ceAbstractionStarter]: For program point L966(lines 966 1465) no Hoare annotation was computed. [2019-11-23 20:57:59,177 INFO L444 ceAbstractionStarter]: For program point L769(lines 769 1465) no Hoare annotation was computed. [2019-11-23 20:57:59,177 INFO L444 ceAbstractionStarter]: For program point L1628-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:57:59,177 INFO L444 ceAbstractionStarter]: For program point L1562-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:57:59,177 INFO L444 ceAbstractionStarter]: For program point L1496-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:57:59,177 INFO L444 ceAbstractionStarter]: For program point L836(lines 836 1465) no Hoare annotation was computed. [2019-11-23 20:57:59,177 INFO L444 ceAbstractionStarter]: For program point L1629(line 1629) no Hoare annotation was computed. [2019-11-23 20:57:59,177 INFO L444 ceAbstractionStarter]: For program point L1563(line 1563) no Hoare annotation was computed. [2019-11-23 20:57:59,177 INFO L444 ceAbstractionStarter]: For program point L1497(line 1497) no Hoare annotation was computed. [2019-11-23 20:57:59,178 INFO L444 ceAbstractionStarter]: For program point L441(lines 441 1465) no Hoare annotation was computed. [2019-11-23 20:57:59,178 INFO L444 ceAbstractionStarter]: For program point L1432(lines 1432 1465) no Hoare annotation was computed. [2019-11-23 20:57:59,178 INFO L444 ceAbstractionStarter]: For program point L574(lines 574 1465) no Hoare annotation was computed. [2019-11-23 20:57:59,178 INFO L444 ceAbstractionStarter]: For program point L1631-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:57:59,178 INFO L444 ceAbstractionStarter]: For program point L1565-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:57:59,178 INFO L444 ceAbstractionStarter]: For program point L1499-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:57:59,178 INFO L444 ceAbstractionStarter]: For program point L1632(line 1632) no Hoare annotation was computed. [2019-11-23 20:57:59,178 INFO L444 ceAbstractionStarter]: For program point L1566(line 1566) no Hoare annotation was computed. [2019-11-23 20:57:59,178 INFO L444 ceAbstractionStarter]: For program point L1500(line 1500) no Hoare annotation was computed. [2019-11-23 20:57:59,178 INFO L444 ceAbstractionStarter]: For program point L377(lines 377 1465) no Hoare annotation was computed. [2019-11-23 20:57:59,178 INFO L444 ceAbstractionStarter]: For program point L1104(lines 1104 1465) no Hoare annotation was computed. [2019-11-23 20:57:59,179 INFO L444 ceAbstractionStarter]: For program point L1038(lines 1038 1465) no Hoare annotation was computed. [2019-11-23 20:57:59,179 INFO L444 ceAbstractionStarter]: For program point L378(lines 378 395) no Hoare annotation was computed. [2019-11-23 20:57:59,179 INFO L444 ceAbstractionStarter]: For program point L312(lines 312 1465) no Hoare annotation was computed. [2019-11-23 20:57:59,179 INFO L444 ceAbstractionStarter]: For program point L378-2(lines 378 395) no Hoare annotation was computed. [2019-11-23 20:57:59,179 INFO L444 ceAbstractionStarter]: For program point L1237(lines 1237 1465) no Hoare annotation was computed. [2019-11-23 20:57:59,179 INFO L444 ceAbstractionStarter]: For program point L114(lines 114 1465) no Hoare annotation was computed. [2019-11-23 20:57:59,179 INFO L444 ceAbstractionStarter]: For program point L1039(lines 1039 1059) no Hoare annotation was computed. [2019-11-23 20:57:59,179 INFO L444 ceAbstractionStarter]: For program point L1039-2(lines 1039 1059) no Hoare annotation was computed. [2019-11-23 20:57:59,179 INFO L444 ceAbstractionStarter]: For program point L907(lines 907 1465) no Hoare annotation was computed. [2019-11-23 20:57:59,180 INFO L444 ceAbstractionStarter]: For program point L709(lines 709 1465) no Hoare annotation was computed. [2019-11-23 20:57:59,180 INFO L444 ceAbstractionStarter]: For program point L643(lines 643 1465) no Hoare annotation was computed. [2019-11-23 20:57:59,180 INFO L444 ceAbstractionStarter]: For program point L1634-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:57:59,180 INFO L444 ceAbstractionStarter]: For program point L1568-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:57:59,180 INFO L444 ceAbstractionStarter]: For program point L1502-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:57:59,180 INFO L444 ceAbstractionStarter]: For program point L181(lines 181 1465) no Hoare annotation was computed. [2019-11-23 20:57:59,180 INFO L444 ceAbstractionStarter]: For program point L710(lines 710 731) no Hoare annotation was computed. [2019-11-23 20:57:59,180 INFO L444 ceAbstractionStarter]: For program point L710-2(lines 710 731) no Hoare annotation was computed. [2019-11-23 20:57:59,180 INFO L444 ceAbstractionStarter]: For program point L1635(line 1635) no Hoare annotation was computed. [2019-11-23 20:57:59,180 INFO L444 ceAbstractionStarter]: For program point L1569(line 1569) no Hoare annotation was computed. [2019-11-23 20:57:59,181 INFO L444 ceAbstractionStarter]: For program point L1503(line 1503) no Hoare annotation was computed. [2019-11-23 20:57:59,181 INFO L444 ceAbstractionStarter]: For program point L1305(lines 1305 1465) no Hoare annotation was computed. [2019-11-23 20:57:59,181 INFO L444 ceAbstractionStarter]: For program point L248(lines 248 1465) no Hoare annotation was computed. [2019-11-23 20:57:59,181 INFO L444 ceAbstractionStarter]: For program point L1173(lines 1173 1465) no Hoare annotation was computed. [2019-11-23 20:57:59,181 INFO L444 ceAbstractionStarter]: For program point L975(lines 975 1465) no Hoare annotation was computed. [2019-11-23 20:57:59,181 INFO L444 ceAbstractionStarter]: For program point L777(lines 777 1465) no Hoare annotation was computed. [2019-11-23 20:57:59,181 INFO L444 ceAbstractionStarter]: For program point L513(lines 513 1465) no Hoare annotation was computed. [2019-11-23 20:57:59,181 INFO L444 ceAbstractionStarter]: For program point L844(lines 844 1465) no Hoare annotation was computed. [2019-11-23 20:57:59,181 INFO L444 ceAbstractionStarter]: For program point L1637-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:57:59,181 INFO L444 ceAbstractionStarter]: For program point L1571-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:57:59,182 INFO L444 ceAbstractionStarter]: For program point L1505-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:57:59,182 INFO L444 ceAbstractionStarter]: For program point L1638(line 1638) no Hoare annotation was computed. [2019-11-23 20:57:59,182 INFO L444 ceAbstractionStarter]: For program point L1572(line 1572) no Hoare annotation was computed. [2019-11-23 20:57:59,182 INFO L444 ceAbstractionStarter]: For program point L1506(line 1506) no Hoare annotation was computed. [2019-11-23 20:57:59,182 INFO L444 ceAbstractionStarter]: For program point L450(lines 450 1465) no Hoare annotation was computed. [2019-11-23 20:57:59,182 INFO L444 ceAbstractionStarter]: For program point L583(lines 583 1465) no Hoare annotation was computed. [2019-11-23 20:57:59,182 INFO L444 ceAbstractionStarter]: For program point L1640-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:57:59,182 INFO L444 ceAbstractionStarter]: For program point L1574-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:57:59,182 INFO L444 ceAbstractionStarter]: For program point L1508-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:57:59,183 INFO L444 ceAbstractionStarter]: For program point L1442(lines 1442 1465) no Hoare annotation was computed. [2019-11-23 20:57:59,183 INFO L444 ceAbstractionStarter]: For program point L319(lines 319 1465) no Hoare annotation was computed. [2019-11-23 20:57:59,183 INFO L444 ceAbstractionStarter]: For program point L1112(lines 1112 1465) no Hoare annotation was computed. [2019-11-23 20:57:59,183 INFO L444 ceAbstractionStarter]: For program point L55(lines 55 1465) no Hoare annotation was computed. [2019-11-23 20:57:59,183 INFO L444 ceAbstractionStarter]: For program point L1641(line 1641) no Hoare annotation was computed. [2019-11-23 20:57:59,183 INFO L444 ceAbstractionStarter]: For program point L1575(line 1575) no Hoare annotation was computed. [2019-11-23 20:57:59,183 INFO L444 ceAbstractionStarter]: For program point L1509(line 1509) no Hoare annotation was computed. [2019-11-23 20:57:59,183 INFO L444 ceAbstractionStarter]: For program point L56(lines 56 71) no Hoare annotation was computed. [2019-11-23 20:57:59,183 INFO L444 ceAbstractionStarter]: For program point L56-2(lines 56 71) no Hoare annotation was computed. [2019-11-23 20:57:59,184 INFO L444 ceAbstractionStarter]: For program point L784(lines 784 1465) no Hoare annotation was computed. [2019-11-23 20:57:59,184 INFO L444 ceAbstractionStarter]: For program point L1643-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:57:59,184 INFO L444 ceAbstractionStarter]: For program point L1577-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:57:59,184 INFO L444 ceAbstractionStarter]: For program point L1511-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:57:59,184 INFO L444 ceAbstractionStarter]: For program point L1313(lines 1313 1465) no Hoare annotation was computed. [2019-11-23 20:57:59,184 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-23 20:57:59,184 INFO L444 ceAbstractionStarter]: For program point L983(lines 983 1465) no Hoare annotation was computed. [2019-11-23 20:57:59,184 INFO L444 ceAbstractionStarter]: For program point L917(lines 917 1465) no Hoare annotation was computed. [2019-11-23 20:57:59,184 INFO L444 ceAbstractionStarter]: For program point L653(lines 653 1465) no Hoare annotation was computed. [2019-11-23 20:57:59,184 INFO L444 ceAbstractionStarter]: For program point L1644(line 1644) no Hoare annotation was computed. [2019-11-23 20:57:59,184 INFO L444 ceAbstractionStarter]: For program point L1578(line 1578) no Hoare annotation was computed. [2019-11-23 20:57:59,184 INFO L444 ceAbstractionStarter]: For program point L1512(line 1512) no Hoare annotation was computed. [2019-11-23 20:57:59,184 INFO L444 ceAbstractionStarter]: For program point L257(lines 257 1465) no Hoare annotation was computed. [2019-11-23 20:57:59,184 INFO L444 ceAbstractionStarter]: For program point L191(lines 191 1465) no Hoare annotation was computed. [2019-11-23 20:57:59,185 INFO L444 ceAbstractionStarter]: For program point L1182(lines 1182 1465) no Hoare annotation was computed. [2019-11-23 20:57:59,185 INFO L444 ceAbstractionStarter]: For program point L918(lines 918 935) no Hoare annotation was computed. [2019-11-23 20:57:59,185 INFO L444 ceAbstractionStarter]: For program point L918-2(lines 918 935) no Hoare annotation was computed. [2019-11-23 20:57:59,185 INFO L444 ceAbstractionStarter]: For program point L522(lines 522 1465) no Hoare annotation was computed. [2019-11-23 20:57:59,185 INFO L444 ceAbstractionStarter]: For program point L1381(lines 1381 1465) no Hoare annotation was computed. [2019-11-23 20:57:59,185 INFO L444 ceAbstractionStarter]: For program point L1249(lines 1249 1465) no Hoare annotation was computed. [2019-11-23 20:57:59,185 INFO L444 ceAbstractionStarter]: For program point L192(lines 192 211) no Hoare annotation was computed. [2019-11-23 20:57:59,185 INFO L444 ceAbstractionStarter]: For program point L126(lines 126 1465) no Hoare annotation was computed. [2019-11-23 20:57:59,185 INFO L444 ceAbstractionStarter]: For program point L192-2(lines 192 211) no Hoare annotation was computed. [2019-11-23 20:57:59,185 INFO L444 ceAbstractionStarter]: For program point L853(lines 853 1465) no Hoare annotation was computed. [2019-11-23 20:57:59,185 INFO L444 ceAbstractionStarter]: For program point L1646-1(lines 1646 1648) no Hoare annotation was computed. [2019-11-23 20:57:59,185 INFO L444 ceAbstractionStarter]: For program point L1580-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:57:59,186 INFO L444 ceAbstractionStarter]: For program point L1514-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:57:59,186 INFO L444 ceAbstractionStarter]: For program point L1382(lines 1382 1400) no Hoare annotation was computed. [2019-11-23 20:57:59,186 INFO L444 ceAbstractionStarter]: For program point L1382-2(lines 1382 1400) no Hoare annotation was computed. [2019-11-23 20:57:59,186 INFO L444 ceAbstractionStarter]: For program point L1250(lines 1250 1272) no Hoare annotation was computed. [2019-11-23 20:57:59,186 INFO L444 ceAbstractionStarter]: For program point L1250-2(lines 1250 1272) no Hoare annotation was computed. [2019-11-23 20:57:59,186 INFO L444 ceAbstractionStarter]: For program point L1647(line 1647) no Hoare annotation was computed. [2019-11-23 20:57:59,186 INFO L444 ceAbstractionStarter]: For program point L1581(line 1581) no Hoare annotation was computed. [2019-11-23 20:57:59,186 INFO L444 ceAbstractionStarter]: For program point L1515(line 1515) no Hoare annotation was computed. [2019-11-23 20:57:59,186 INFO L444 ceAbstractionStarter]: For program point L458(lines 458 1465) no Hoare annotation was computed. [2019-11-23 20:57:59,186 INFO L444 ceAbstractionStarter]: For program point L1120(lines 1120 1465) no Hoare annotation was computed. [2019-11-23 20:57:59,186 INFO L444 ceAbstractionStarter]: For program point L658(lines 658 1465) no Hoare annotation was computed. [2019-11-23 20:57:59,187 INFO L440 ceAbstractionStarter]: At program point L1649(lines 54 1650) the Hoare annotation is: (let ((.cse10 (= 1 ~a6~0))) (let ((.cse7 (= 2 ~a3~0)) (.cse12 (not (= 1 ~a7~0))) (.cse6 (= ~a10~0 1)) (.cse5 (<= ~a11~0 0)) (.cse2 (not .cse10)) (.cse8 (<= ~a3~0 0)) (.cse3 (= ~a26~0 1)) (.cse9 (= ~a16~0 1)) (.cse0 (= 1 ~a5~0)) (.cse4 (= ~a27~0 1)) (.cse11 (not (= ~a12~0 1))) (.cse1 (= ~a11~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse0 .cse5 .cse3) (and .cse6 .cse4 .cse0 .cse5 .cse7) (and .cse8 .cse0 .cse5 .cse9) (and .cse0 .cse10 .cse11 .cse5 .cse7) (and .cse4 .cse0 .cse7 .cse1 .cse3 .cse9) (and .cse4 .cse0 .cse5 .cse7 .cse2) (and .cse0 .cse5 .cse7 .cse2 .cse3) (and .cse8 .cse4 .cse0 .cse10 .cse1) (and .cse6 .cse0 .cse11 .cse5 .cse2) (and .cse0 .cse11 .cse1 .cse3) (and .cse0 .cse11 .cse7 .cse2 .cse1) (and .cse0 .cse4 .cse5 .cse11) (and .cse6 .cse0 .cse4 .cse10 .cse12 .cse1 .cse9) (and .cse6 .cse0 .cse10 .cse12 .cse5) (and .cse0 .cse11 .cse5 .cse2 .cse3) (and .cse0 .cse10 .cse5 .cse3) (and .cse6 .cse4 .cse0 .cse1 .cse3 .cse9) (and .cse8 .cse0 .cse5 .cse2) (and .cse8 .cse0 .cse1 .cse3) (and (= ~a13~0 1) .cse0 .cse10 .cse1 .cse9) (and .cse0 .cse4 .cse11 .cse1)))) [2019-11-23 20:57:59,187 INFO L444 ceAbstractionStarter]: For program point L592(lines 592 1465) no Hoare annotation was computed. [2019-11-23 20:57:59,187 INFO L444 ceAbstractionStarter]: For program point L1583-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:57:59,187 INFO L444 ceAbstractionStarter]: For program point L1517-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:57:59,187 INFO L444 ceAbstractionStarter]: For program point L1584(line 1584) no Hoare annotation was computed. [2019-11-23 20:57:59,187 INFO L444 ceAbstractionStarter]: For program point L1518(line 1518) no Hoare annotation was computed. [2019-11-23 20:57:59,188 INFO L444 ceAbstractionStarter]: For program point L1452(lines 1452 1465) no Hoare annotation was computed. [2019-11-23 20:57:59,188 INFO L444 ceAbstractionStarter]: For program point L329(lines 329 1465) no Hoare annotation was computed. [2019-11-23 20:57:59,188 INFO L444 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-23 20:57:59,188 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 1515) no Hoare annotation was computed. [2019-11-23 20:57:59,188 INFO L444 ceAbstractionStarter]: For program point L1321(lines 1321 1465) no Hoare annotation was computed. [2019-11-23 20:57:59,188 INFO L447 ceAbstractionStarter]: At program point L1652(lines 1652 1669) the Hoare annotation is: true [2019-11-23 20:57:59,188 INFO L444 ceAbstractionStarter]: For program point L529(lines 529 1465) no Hoare annotation was computed. [2019-11-23 20:57:59,188 INFO L444 ceAbstractionStarter]: For program point L1586-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:57:59,188 INFO L444 ceAbstractionStarter]: For program point L1520-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:57:59,188 INFO L444 ceAbstractionStarter]: For program point L397(lines 397 1465) no Hoare annotation was computed. [2019-11-23 20:57:59,188 INFO L444 ceAbstractionStarter]: For program point L265(lines 265 1465) no Hoare annotation was computed. [2019-11-23 20:57:59,188 INFO L444 ceAbstractionStarter]: For program point L1190(lines 1190 1465) no Hoare annotation was computed. [2019-11-23 20:57:59,188 INFO L444 ceAbstractionStarter]: For program point L1587(line 1587) no Hoare annotation was computed. [2019-11-23 20:57:59,189 INFO L444 ceAbstractionStarter]: For program point L1521(line 1521) no Hoare annotation was computed. [2019-11-23 20:57:59,189 INFO L444 ceAbstractionStarter]: For program point L795(lines 795 1465) no Hoare annotation was computed. [2019-11-23 20:57:59,189 INFO L444 ceAbstractionStarter]: For program point L135(lines 135 1465) no Hoare annotation was computed. [2019-11-23 20:57:59,189 INFO L444 ceAbstractionStarter]: For program point L994(lines 994 1465) no Hoare annotation was computed. [2019-11-23 20:57:59,189 INFO L444 ceAbstractionStarter]: For program point L1589-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:57:59,189 INFO L444 ceAbstractionStarter]: For program point L1523-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:57:59,189 INFO L444 ceAbstractionStarter]: For program point L1127(lines 1127 1465) no Hoare annotation was computed. [2019-11-23 20:57:59,189 INFO L444 ceAbstractionStarter]: For program point L1061(lines 1061 1465) no Hoare annotation was computed. [2019-11-23 20:57:59,189 INFO L444 ceAbstractionStarter]: For program point L863(lines 863 1465) no Hoare annotation was computed. [2019-11-23 20:57:59,189 INFO L444 ceAbstractionStarter]: For program point L665(lines 665 1465) no Hoare annotation was computed. [2019-11-23 20:57:59,190 INFO L444 ceAbstractionStarter]: For program point L1590(line 1590) no Hoare annotation was computed. [2019-11-23 20:57:59,190 INFO L444 ceAbstractionStarter]: For program point L1524(line 1524) no Hoare annotation was computed. [2019-11-23 20:57:59,190 INFO L444 ceAbstractionStarter]: For program point L467(lines 467 1465) no Hoare annotation was computed. [2019-11-23 20:57:59,190 INFO L444 ceAbstractionStarter]: For program point L1326(lines 1326 1465) no Hoare annotation was computed. [2019-11-23 20:57:59,190 INFO L444 ceAbstractionStarter]: For program point L468(lines 468 478) no Hoare annotation was computed. [2019-11-23 20:57:59,190 INFO L444 ceAbstractionStarter]: For program point L468-2(lines 468 478) no Hoare annotation was computed. [2019-11-23 20:57:59,190 INFO L444 ceAbstractionStarter]: For program point L733(lines 733 1465) no Hoare annotation was computed. [2019-11-23 20:57:59,190 INFO L440 ceAbstractionStarter]: At program point L1658-2(lines 1658 1668) the Hoare annotation is: (let ((.cse10 (= 1 ~a6~0))) (let ((.cse7 (= 2 ~a3~0)) (.cse12 (not (= 1 ~a7~0))) (.cse6 (= ~a10~0 1)) (.cse5 (<= ~a11~0 0)) (.cse2 (not .cse10)) (.cse8 (<= ~a3~0 0)) (.cse3 (= ~a26~0 1)) (.cse9 (= ~a16~0 1)) (.cse0 (= 1 ~a5~0)) (.cse4 (= ~a27~0 1)) (.cse11 (not (= ~a12~0 1))) (.cse1 (= ~a11~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse0 .cse5 .cse3) (and .cse6 .cse4 .cse0 .cse5 .cse7) (and .cse8 .cse0 .cse5 .cse9) (and .cse0 .cse10 .cse11 .cse5 .cse7) (and .cse4 .cse0 .cse7 .cse1 .cse3 .cse9) (and .cse4 .cse0 .cse5 .cse7 .cse2) (and .cse0 .cse5 .cse7 .cse2 .cse3) (and .cse8 .cse4 .cse0 .cse10 .cse1) (and .cse6 .cse0 .cse11 .cse5 .cse2) (and .cse0 .cse11 .cse1 .cse3) (and .cse0 .cse11 .cse7 .cse2 .cse1) (and .cse0 .cse4 .cse5 .cse11) (and .cse6 .cse0 .cse4 .cse10 .cse12 .cse1 .cse9) (and .cse6 .cse0 .cse10 .cse12 .cse5) (and .cse0 .cse11 .cse5 .cse2 .cse3) (and .cse0 .cse10 .cse5 .cse3) (and .cse6 .cse4 .cse0 .cse1 .cse3 .cse9) (and .cse8 .cse0 .cse5 .cse2) (and .cse8 .cse0 .cse1 .cse3) (and (= ~a13~0 1) .cse0 .cse10 .cse1 .cse9) (and .cse0 .cse4 .cse11 .cse1)))) [2019-11-23 20:57:59,190 INFO L444 ceAbstractionStarter]: For program point L1592-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:57:59,190 INFO L444 ceAbstractionStarter]: For program point L1526-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:57:59,190 INFO L444 ceAbstractionStarter]: For program point L1460(lines 1460 1465) no Hoare annotation was computed. [2019-11-23 20:57:59,191 INFO L444 ceAbstractionStarter]: For program point L73(lines 73 1465) no Hoare annotation was computed. [2019-11-23 20:57:59,191 INFO L444 ceAbstractionStarter]: For program point L1593(line 1593) no Hoare annotation was computed. [2019-11-23 20:57:59,191 INFO L444 ceAbstractionStarter]: For program point L1527(line 1527) no Hoare annotation was computed. [2019-11-23 20:57:59,191 INFO L444 ceAbstractionStarter]: For program point L603(lines 603 1465) no Hoare annotation was computed. [2019-11-23 20:57:59,191 INFO L444 ceAbstractionStarter]: For program point L405(lines 405 1465) no Hoare annotation was computed. [2019-11-23 20:57:59,191 INFO L444 ceAbstractionStarter]: For program point L339(lines 339 1465) no Hoare annotation was computed. [2019-11-23 20:57:59,191 INFO L444 ceAbstractionStarter]: For program point L1132(lines 1132 1465) no Hoare annotation was computed. [2019-11-23 20:57:59,191 INFO L444 ceAbstractionStarter]: For program point L1066(lines 1066 1465) no Hoare annotation was computed. [2019-11-23 20:57:59,191 INFO L444 ceAbstractionStarter]: For program point L868(lines 868 1465) no Hoare annotation was computed. [2019-11-23 20:57:59,191 INFO L444 ceAbstractionStarter]: For program point L1595-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:57:59,191 INFO L444 ceAbstractionStarter]: For program point L1529-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:57:59,191 INFO L444 ceAbstractionStarter]: For program point L869(lines 869 887) no Hoare annotation was computed. [2019-11-23 20:57:59,191 INFO L444 ceAbstractionStarter]: For program point L869-2(lines 869 887) no Hoare annotation was computed. [2019-11-23 20:57:59,191 INFO L444 ceAbstractionStarter]: For program point L1596(line 1596) no Hoare annotation was computed. [2019-11-23 20:57:59,191 INFO L444 ceAbstractionStarter]: For program point L539(lines 539 1465) no Hoare annotation was computed. [2019-11-23 20:57:59,192 INFO L444 ceAbstractionStarter]: For program point L1530(line 1530) no Hoare annotation was computed. [2019-11-23 20:57:59,192 INFO L444 ceAbstractionStarter]: For program point L1200(lines 1200 1465) no Hoare annotation was computed. [2019-11-23 20:57:59,192 INFO L444 ceAbstractionStarter]: For program point L804(lines 804 1465) no Hoare annotation was computed. [2019-11-23 20:57:59,192 INFO L444 ceAbstractionStarter]: For program point L1663(line 1663) no Hoare annotation was computed. [2019-11-23 20:57:59,192 INFO L444 ceAbstractionStarter]: For program point L276(lines 276 1465) no Hoare annotation was computed. [2019-11-23 20:57:59,192 INFO L444 ceAbstractionStarter]: For program point L1003(lines 1003 1465) no Hoare annotation was computed. [2019-11-23 20:57:59,192 INFO L444 ceAbstractionStarter]: For program point L937(lines 937 1465) no Hoare annotation was computed. [2019-11-23 20:57:59,192 INFO L444 ceAbstractionStarter]: For program point L1598-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:57:59,192 INFO L444 ceAbstractionStarter]: For program point L1532-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:57:59,192 INFO L444 ceAbstractionStarter]: For program point L1466(lines 1466 1468) no Hoare annotation was computed. [2019-11-23 20:57:59,192 INFO L444 ceAbstractionStarter]: For program point L1466-2(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:57:59,192 INFO L444 ceAbstractionStarter]: For program point L1599(line 1599) no Hoare annotation was computed. [2019-11-23 20:57:59,192 INFO L444 ceAbstractionStarter]: For program point L1533(line 1533) no Hoare annotation was computed. [2019-11-23 20:57:59,192 INFO L444 ceAbstractionStarter]: For program point L1467(line 1467) no Hoare annotation was computed. [2019-11-23 20:57:59,192 INFO L444 ceAbstractionStarter]: For program point L146(lines 146 1465) no Hoare annotation was computed. [2019-11-23 20:57:59,193 INFO L444 ceAbstractionStarter]: For program point L675(lines 675 1465) no Hoare annotation was computed. [2019-11-23 20:57:59,193 INFO L444 ceAbstractionStarter]: For program point L1402(lines 1402 1465) no Hoare annotation was computed. [2019-11-23 20:57:59,193 INFO L444 ceAbstractionStarter]: For program point L1336(lines 1336 1465) no Hoare annotation was computed. [2019-11-23 20:57:59,193 INFO L444 ceAbstractionStarter]: For program point L213(lines 213 1465) no Hoare annotation was computed. [2019-11-23 20:57:59,193 INFO L444 ceAbstractionStarter]: For program point L1601-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:57:59,193 INFO L444 ceAbstractionStarter]: For program point L1535-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:57:59,193 INFO L444 ceAbstractionStarter]: For program point L1469-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:57:59,193 INFO L444 ceAbstractionStarter]: For program point L1403(lines 1403 1421) no Hoare annotation was computed. [2019-11-23 20:57:59,193 INFO L444 ceAbstractionStarter]: For program point L1403-2(lines 1403 1421) no Hoare annotation was computed. [2019-11-23 20:57:59,193 INFO L444 ceAbstractionStarter]: For program point L82(lines 82 1465) no Hoare annotation was computed. [2019-11-23 20:57:59,193 INFO L444 ceAbstractionStarter]: For program point L743(lines 743 1465) no Hoare annotation was computed. [2019-11-23 20:57:59,193 INFO L444 ceAbstractionStarter]: For program point L1602(line 1602) no Hoare annotation was computed. [2019-11-23 20:57:59,193 INFO L444 ceAbstractionStarter]: For program point L1536(line 1536) no Hoare annotation was computed. [2019-11-23 20:57:59,193 INFO L444 ceAbstractionStarter]: For program point L1470(line 1470) no Hoare annotation was computed. [2019-11-23 20:57:59,193 INFO L444 ceAbstractionStarter]: For program point L1074(lines 1074 1465) no Hoare annotation was computed. [2019-11-23 20:57:59,194 INFO L444 ceAbstractionStarter]: For program point L546(lines 546 1465) no Hoare annotation was computed. [2019-11-23 20:57:59,194 INFO L444 ceAbstractionStarter]: For program point L480(lines 480 1465) no Hoare annotation was computed. [2019-11-23 20:57:59,194 INFO L444 ceAbstractionStarter]: For program point L414(lines 414 1465) no Hoare annotation was computed. [2019-11-23 20:57:59,194 INFO L444 ceAbstractionStarter]: For program point L348(lines 348 1465) no Hoare annotation was computed. [2019-11-23 20:57:59,194 INFO L444 ceAbstractionStarter]: For program point L1604-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:57:59,194 INFO L444 ceAbstractionStarter]: For program point L1538-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:57:59,194 INFO L444 ceAbstractionStarter]: For program point L1472-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:57:59,194 INFO L444 ceAbstractionStarter]: For program point L1274(lines 1274 1465) no Hoare annotation was computed. [2019-11-23 20:57:59,194 INFO L444 ceAbstractionStarter]: For program point L1142(lines 1142 1465) no Hoare annotation was computed. [2019-11-23 20:57:59,194 INFO L444 ceAbstractionStarter]: For program point L614(lines 614 1465) no Hoare annotation was computed. [2019-11-23 20:57:59,194 INFO L444 ceAbstractionStarter]: For program point L1605(line 1605) no Hoare annotation was computed. [2019-11-23 20:57:59,194 INFO L444 ceAbstractionStarter]: For program point L1539(line 1539) no Hoare annotation was computed. [2019-11-23 20:57:59,194 INFO L444 ceAbstractionStarter]: For program point L1473(line 1473) no Hoare annotation was computed. [2019-11-23 20:57:59,194 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-23 20:57:59,195 INFO L444 ceAbstractionStarter]: For program point L284(lines 284 1465) no Hoare annotation was computed. [2019-11-23 20:57:59,195 INFO L444 ceAbstractionStarter]: For program point L1011(lines 1011 1465) no Hoare annotation was computed. [2019-11-23 20:57:59,195 INFO L444 ceAbstractionStarter]: For program point L813(lines 813 1465) no Hoare annotation was computed. [2019-11-23 20:57:59,195 INFO L444 ceAbstractionStarter]: For program point L1210(lines 1210 1465) no Hoare annotation was computed. [2019-11-23 20:57:59,195 INFO L444 ceAbstractionStarter]: For program point L1607-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:57:59,195 INFO L444 ceAbstractionStarter]: For program point L1541-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:57:59,195 INFO L444 ceAbstractionStarter]: For program point L1475-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:57:59,195 INFO L444 ceAbstractionStarter]: For program point L1211(lines 1211 1224) no Hoare annotation was computed. [2019-11-23 20:57:59,195 INFO L444 ceAbstractionStarter]: For program point L1211-2(lines 1211 1224) no Hoare annotation was computed. [2019-11-23 20:57:59,195 INFO L444 ceAbstractionStarter]: For program point L947(lines 947 1465) no Hoare annotation was computed. [2019-11-23 20:57:59,195 INFO L444 ceAbstractionStarter]: For program point L1608(line 1608) no Hoare annotation was computed. [2019-11-23 20:57:59,195 INFO L444 ceAbstractionStarter]: For program point L1542(line 1542) no Hoare annotation was computed. [2019-11-23 20:57:59,196 INFO L444 ceAbstractionStarter]: For program point L1476(line 1476) no Hoare annotation was computed. [2019-11-23 20:57:59,196 INFO L444 ceAbstractionStarter]: For program point L1344(lines 1344 1465) no Hoare annotation was computed. [2019-11-23 20:57:59,196 INFO L444 ceAbstractionStarter]: For program point L155(lines 155 1465) no Hoare annotation was computed. [2019-11-23 20:57:59,196 INFO L444 ceAbstractionStarter]: For program point L89(lines 89 1465) no Hoare annotation was computed. [2019-11-23 20:57:59,196 INFO L444 ceAbstractionStarter]: For program point L684(lines 684 1465) no Hoare annotation was computed. [2019-11-23 20:57:59,196 INFO L444 ceAbstractionStarter]: For program point L222(lines 222 1465) no Hoare annotation was computed. [2019-11-23 20:57:59,196 INFO L444 ceAbstractionStarter]: For program point L685(lines 685 699) no Hoare annotation was computed. [2019-11-23 20:57:59,196 INFO L444 ceAbstractionStarter]: For program point L685-2(lines 685 699) no Hoare annotation was computed. [2019-11-23 20:57:59,196 INFO L444 ceAbstractionStarter]: For program point L1610-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:57:59,197 INFO L444 ceAbstractionStarter]: For program point L1544-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:57:59,197 INFO L444 ceAbstractionStarter]: For program point L1478-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:57:59,197 INFO L444 ceAbstractionStarter]: For program point L1611(line 1611) no Hoare annotation was computed. [2019-11-23 20:57:59,197 INFO L444 ceAbstractionStarter]: For program point L1545(line 1545) no Hoare annotation was computed. [2019-11-23 20:57:59,197 INFO L444 ceAbstractionStarter]: For program point L488(lines 488 1465) no Hoare annotation was computed. [2019-11-23 20:57:59,197 INFO L444 ceAbstractionStarter]: For program point L1479(line 1479) no Hoare annotation was computed. [2019-11-23 20:57:59,197 INFO L444 ceAbstractionStarter]: For program point L422(lines 422 1465) no Hoare annotation was computed. [2019-11-23 20:57:59,197 INFO L444 ceAbstractionStarter]: For program point L356(lines 356 1465) no Hoare annotation was computed. [2019-11-23 20:57:59,198 INFO L444 ceAbstractionStarter]: For program point L753(lines 753 1465) no Hoare annotation was computed. [2019-11-23 20:57:59,198 INFO L444 ceAbstractionStarter]: For program point L622(lines 622 1465) no Hoare annotation was computed. [2019-11-23 20:57:59,198 INFO L444 ceAbstractionStarter]: For program point L556(lines 556 1465) no Hoare annotation was computed. [2019-11-23 20:57:59,198 INFO L444 ceAbstractionStarter]: For program point L1613-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:57:59,198 INFO L444 ceAbstractionStarter]: For program point L1547-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:57:59,198 INFO L444 ceAbstractionStarter]: For program point L1481-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:57:59,198 INFO L444 ceAbstractionStarter]: For program point L292(lines 292 1465) no Hoare annotation was computed. [2019-11-23 20:57:59,198 INFO L444 ceAbstractionStarter]: For program point L1283(lines 1283 1465) no Hoare annotation was computed. [2019-11-23 20:57:59,198 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-23 20:57:59,198 INFO L444 ceAbstractionStarter]: For program point L1614(line 1614) no Hoare annotation was computed. [2019-11-23 20:57:59,199 INFO L444 ceAbstractionStarter]: For program point L1548(line 1548) no Hoare annotation was computed. [2019-11-23 20:57:59,199 INFO L444 ceAbstractionStarter]: For program point L1482(line 1482) no Hoare annotation was computed. [2019-11-23 20:57:59,199 INFO L444 ceAbstractionStarter]: For program point L1350(lines 1350 1465) no Hoare annotation was computed. [2019-11-23 20:57:59,199 INFO L444 ceAbstractionStarter]: For program point L1284(lines 1284 1303) no Hoare annotation was computed. [2019-11-23 20:57:59,199 INFO L444 ceAbstractionStarter]: For program point L1284-2(lines 1284 1303) no Hoare annotation was computed. [2019-11-23 20:57:59,199 INFO L444 ceAbstractionStarter]: For program point L1152(lines 1152 1465) no Hoare annotation was computed. [2019-11-23 20:57:59,199 INFO L444 ceAbstractionStarter]: For program point L95(lines 95 1465) no Hoare annotation was computed. [2019-11-23 20:57:59,199 INFO L444 ceAbstractionStarter]: For program point L1086(lines 1086 1465) no Hoare annotation was computed. [2019-11-23 20:57:59,199 INFO L444 ceAbstractionStarter]: For program point L1021(lines 1021 1465) no Hoare annotation was computed. [2019-11-23 20:57:59,200 INFO L444 ceAbstractionStarter]: For program point L955(lines 955 1465) no Hoare annotation was computed. [2019-11-23 20:57:59,200 INFO L444 ceAbstractionStarter]: For program point L889(lines 889 1465) no Hoare annotation was computed. [2019-11-23 20:57:59,200 INFO L444 ceAbstractionStarter]: For program point L1616-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:57:59,200 INFO L444 ceAbstractionStarter]: For program point L1550-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:57:59,200 INFO L444 ceAbstractionStarter]: For program point L1484-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:57:59,200 INFO L444 ceAbstractionStarter]: For program point L1617(line 1617) no Hoare annotation was computed. [2019-11-23 20:57:59,200 INFO L444 ceAbstractionStarter]: For program point L1551(line 1551) no Hoare annotation was computed. [2019-11-23 20:57:59,200 INFO L444 ceAbstractionStarter]: For program point L1485(line 1485) no Hoare annotation was computed. [2019-11-23 20:57:59,200 INFO L444 ceAbstractionStarter]: For program point L164(lines 164 1465) no Hoare annotation was computed. [2019-11-23 20:57:59,200 INFO L444 ceAbstractionStarter]: For program point L825(lines 825 1465) no Hoare annotation was computed. [2019-11-23 20:57:59,201 INFO L444 ceAbstractionStarter]: For program point L1619-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:57:59,201 INFO L444 ceAbstractionStarter]: For program point L1553-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:57:59,201 INFO L444 ceAbstractionStarter]: For program point L1487-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:57:59,201 INFO L444 ceAbstractionStarter]: For program point L761(lines 761 1465) no Hoare annotation was computed. [2019-11-23 20:57:59,201 INFO L444 ceAbstractionStarter]: For program point L1620(line 1620) no Hoare annotation was computed. [2019-11-23 20:57:59,201 INFO L444 ceAbstractionStarter]: For program point L1554(line 1554) no Hoare annotation was computed. [2019-11-23 20:57:59,201 INFO L444 ceAbstractionStarter]: For program point L497(lines 497 1465) no Hoare annotation was computed. [2019-11-23 20:57:59,201 INFO L444 ceAbstractionStarter]: For program point L1488(line 1488) no Hoare annotation was computed. [2019-11-23 20:57:59,201 INFO L444 ceAbstractionStarter]: For program point L233(lines 233 1465) no Hoare annotation was computed. [2019-11-23 20:57:59,234 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 08:57:59 BoogieIcfgContainer [2019-11-23 20:57:59,234 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-23 20:57:59,236 INFO L168 Benchmark]: Toolchain (without parser) took 52736.70 ms. Allocated memory was 142.1 MB in the beginning and 2.1 GB in the end (delta: 2.0 GB). Free memory was 98.5 MB in the beginning and 990.1 MB in the end (delta: -891.6 MB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. [2019-11-23 20:57:59,237 INFO L168 Benchmark]: CDTParser took 1.41 ms. Allocated memory is still 142.1 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-11-23 20:57:59,237 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1245.43 ms. Allocated memory was 142.1 MB in the beginning and 232.3 MB in the end (delta: 90.2 MB). Free memory was 98.3 MB in the beginning and 181.0 MB in the end (delta: -82.7 MB). Peak memory consumption was 49.8 MB. Max. memory is 7.1 GB. [2019-11-23 20:57:59,238 INFO L168 Benchmark]: Boogie Procedure Inliner took 135.01 ms. Allocated memory is still 232.3 MB. Free memory was 180.0 MB in the beginning and 164.4 MB in the end (delta: 15.6 MB). Peak memory consumption was 15.6 MB. Max. memory is 7.1 GB. [2019-11-23 20:57:59,239 INFO L168 Benchmark]: Boogie Preprocessor took 109.17 ms. Allocated memory is still 232.3 MB. Free memory was 164.4 MB in the beginning and 153.2 MB in the end (delta: 11.2 MB). Peak memory consumption was 11.2 MB. Max. memory is 7.1 GB. [2019-11-23 20:57:59,239 INFO L168 Benchmark]: RCFGBuilder took 2466.07 ms. Allocated memory was 232.3 MB in the beginning and 266.9 MB in the end (delta: 34.6 MB). Free memory was 153.2 MB in the beginning and 181.9 MB in the end (delta: -28.7 MB). Peak memory consumption was 103.7 MB. Max. memory is 7.1 GB. [2019-11-23 20:57:59,240 INFO L168 Benchmark]: TraceAbstraction took 48776.55 ms. Allocated memory was 266.9 MB in the beginning and 2.1 GB in the end (delta: 1.9 GB). Free memory was 181.9 MB in the beginning and 990.1 MB in the end (delta: -808.2 MB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. [2019-11-23 20:57:59,244 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.41 ms. Allocated memory is still 142.1 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1245.43 ms. Allocated memory was 142.1 MB in the beginning and 232.3 MB in the end (delta: 90.2 MB). Free memory was 98.3 MB in the beginning and 181.0 MB in the end (delta: -82.7 MB). Peak memory consumption was 49.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 135.01 ms. Allocated memory is still 232.3 MB. Free memory was 180.0 MB in the beginning and 164.4 MB in the end (delta: 15.6 MB). Peak memory consumption was 15.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 109.17 ms. Allocated memory is still 232.3 MB. Free memory was 164.4 MB in the beginning and 153.2 MB in the end (delta: 11.2 MB). Peak memory consumption was 11.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2466.07 ms. Allocated memory was 232.3 MB in the beginning and 266.9 MB in the end (delta: 34.6 MB). Free memory was 153.2 MB in the beginning and 181.9 MB in the end (delta: -28.7 MB). Peak memory consumption was 103.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 48776.55 ms. Allocated memory was 266.9 MB in the beginning and 2.1 GB in the end (delta: 1.9 GB). Free memory was 181.9 MB in the beginning and 990.1 MB in the end (delta: -808.2 MB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1515]: 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: 1652]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1658]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((1 == a5 && a11 == 1) && !(1 == a6)) && a26 == 1) || (((a27 == 1 && 1 == a5) && a11 <= 0) && a26 == 1)) || ((((a10 == 1 && a27 == 1) && 1 == a5) && a11 <= 0) && 2 == a3)) || (((a3 <= 0 && 1 == a5) && a11 <= 0) && a16 == 1)) || ((((1 == a5 && 1 == a6) && !(a12 == 1)) && a11 <= 0) && 2 == a3)) || (((((a27 == 1 && 1 == a5) && 2 == a3) && a11 == 1) && a26 == 1) && a16 == 1)) || ((((a27 == 1 && 1 == a5) && a11 <= 0) && 2 == a3) && !(1 == a6))) || ((((1 == a5 && a11 <= 0) && 2 == a3) && !(1 == a6)) && a26 == 1)) || ((((a3 <= 0 && a27 == 1) && 1 == a5) && 1 == a6) && a11 == 1)) || ((((a10 == 1 && 1 == a5) && !(a12 == 1)) && a11 <= 0) && !(1 == a6))) || (((1 == a5 && !(a12 == 1)) && a11 == 1) && a26 == 1)) || ((((1 == a5 && !(a12 == 1)) && 2 == a3) && !(1 == a6)) && a11 == 1)) || (((1 == a5 && a27 == 1) && a11 <= 0) && !(a12 == 1))) || ((((((a10 == 1 && 1 == a5) && a27 == 1) && 1 == a6) && !(1 == a7)) && a11 == 1) && a16 == 1)) || ((((a10 == 1 && 1 == a5) && 1 == a6) && !(1 == a7)) && a11 <= 0)) || ((((1 == a5 && !(a12 == 1)) && a11 <= 0) && !(1 == a6)) && a26 == 1)) || (((1 == a5 && 1 == a6) && a11 <= 0) && a26 == 1)) || (((((a10 == 1 && a27 == 1) && 1 == a5) && a11 == 1) && a26 == 1) && a16 == 1)) || (((a3 <= 0 && 1 == a5) && a11 <= 0) && !(1 == a6))) || (((a3 <= 0 && 1 == a5) && a11 == 1) && a26 == 1)) || ((((a13 == 1 && 1 == a5) && 1 == a6) && a11 == 1) && a16 == 1)) || (((1 == a5 && a27 == 1) && !(a12 == 1)) && a11 == 1) - InvariantResult [Line: 54]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((1 == a5 && a11 == 1) && !(1 == a6)) && a26 == 1) || (((a27 == 1 && 1 == a5) && a11 <= 0) && a26 == 1)) || ((((a10 == 1 && a27 == 1) && 1 == a5) && a11 <= 0) && 2 == a3)) || (((a3 <= 0 && 1 == a5) && a11 <= 0) && a16 == 1)) || ((((1 == a5 && 1 == a6) && !(a12 == 1)) && a11 <= 0) && 2 == a3)) || (((((a27 == 1 && 1 == a5) && 2 == a3) && a11 == 1) && a26 == 1) && a16 == 1)) || ((((a27 == 1 && 1 == a5) && a11 <= 0) && 2 == a3) && !(1 == a6))) || ((((1 == a5 && a11 <= 0) && 2 == a3) && !(1 == a6)) && a26 == 1)) || ((((a3 <= 0 && a27 == 1) && 1 == a5) && 1 == a6) && a11 == 1)) || ((((a10 == 1 && 1 == a5) && !(a12 == 1)) && a11 <= 0) && !(1 == a6))) || (((1 == a5 && !(a12 == 1)) && a11 == 1) && a26 == 1)) || ((((1 == a5 && !(a12 == 1)) && 2 == a3) && !(1 == a6)) && a11 == 1)) || (((1 == a5 && a27 == 1) && a11 <= 0) && !(a12 == 1))) || ((((((a10 == 1 && 1 == a5) && a27 == 1) && 1 == a6) && !(1 == a7)) && a11 == 1) && a16 == 1)) || ((((a10 == 1 && 1 == a5) && 1 == a6) && !(1 == a7)) && a11 <= 0)) || ((((1 == a5 && !(a12 == 1)) && a11 <= 0) && !(1 == a6)) && a26 == 1)) || (((1 == a5 && 1 == a6) && a11 <= 0) && a26 == 1)) || (((((a10 == 1 && a27 == 1) && 1 == a5) && a11 == 1) && a26 == 1) && a16 == 1)) || (((a3 <= 0 && 1 == a5) && a11 <= 0) && !(1 == a6))) || (((a3 <= 0 && 1 == a5) && a11 == 1) && a26 == 1)) || ((((a13 == 1 && 1 == a5) && 1 == a6) && a11 == 1) && a16 == 1)) || (((1 == a5 && a27 == 1) && !(a12 == 1)) && a11 == 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 302 locations, 1 error locations. Result: SAFE, OverallTime: 48.6s, OverallIterations: 14, TraceHistogramMax: 5, AutomataDifference: 19.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 15.5s, HoareTripleCheckerStatistics: 2775 SDtfs, 5164 SDslu, 1379 SDs, 0 SdLazy, 7938 SolverSat, 1753 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 11.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 283 GetRequests, 255 SyntacticMatches, 5 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=141465occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 9.6s AutomataMinimizationTime, 14 MinimizatonAttempts, 7237 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 1735 NumberOfFragments, 709 HoareAnnotationTreeSize, 3 FomulaSimplifications, 56110 FormulaSimplificationTreeSizeReduction, 9.0s HoareSimplificationTime, 3 FomulaSimplificationsInter, 25792 FormulaSimplificationTreeSizeReductionInter, 6.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 3197 NumberOfCodeBlocks, 3197 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 3182 ConstructedInterpolants, 0 QuantifiedInterpolants, 1080766 SizeOfPredicates, 0 NumberOfNonLiveVariables, 452 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 15 InterpolantComputations, 14 PerfectInterpolantSequences, 1102/1105 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...