/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_label06.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 20:55:11,269 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 20:55:11,272 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 20:55:11,284 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 20:55:11,284 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 20:55:11,286 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 20:55:11,288 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 20:55:11,290 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 20:55:11,293 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 20:55:11,296 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 20:55:11,299 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 20:55:11,306 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 20:55:11,307 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 20:55:11,310 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 20:55:11,311 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 20:55:11,312 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 20:55:11,314 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 20:55:11,315 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 20:55:11,319 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 20:55:11,320 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 20:55:11,325 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 20:55:11,328 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 20:55:11,329 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 20:55:11,330 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 20:55:11,333 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 20:55:11,334 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 20:55:11,334 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 20:55:11,336 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 20:55:11,337 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 20:55:11,339 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 20:55:11,339 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 20:55:11,340 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 20:55:11,341 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 20:55:11,342 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 20:55:11,343 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 20:55:11,344 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 20:55:11,344 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 20:55:11,345 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 20:55:11,345 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 20:55:11,347 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 20:55:11,349 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 20:55:11,350 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:55:11,379 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 20:55:11,385 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 20:55:11,386 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-23 20:55:11,387 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-23 20:55:11,387 INFO L138 SettingsManager]: * Use SBE=true [2019-11-23 20:55:11,387 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 20:55:11,387 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 20:55:11,387 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 20:55:11,388 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 20:55:11,391 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 20:55:11,391 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 20:55:11,391 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 20:55:11,391 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 20:55:11,392 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-23 20:55:11,392 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 20:55:11,392 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 20:55:11,392 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-23 20:55:11,392 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 20:55:11,393 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 20:55:11,394 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-23 20:55:11,394 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 20:55:11,395 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 20:55:11,396 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 20:55:11,396 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 20:55:11,396 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 20:55:11,397 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 20:55:11,397 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-23 20:55:11,397 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 20:55:11,397 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 20:55:11,398 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 20:55:11,678 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 20:55:11,691 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 20:55:11,695 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 20:55:11,696 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 20:55:11,697 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 20:55:11,698 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem03_label06.c [2019-11-23 20:55:11,774 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3080a987b/0116899111764b46870116ca49acb0cc/FLAG05c6995ea [2019-11-23 20:55:12,430 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 20:55:12,430 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem03_label06.c [2019-11-23 20:55:12,447 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3080a987b/0116899111764b46870116ca49acb0cc/FLAG05c6995ea [2019-11-23 20:55:12,593 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3080a987b/0116899111764b46870116ca49acb0cc [2019-11-23 20:55:12,602 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 20:55:12,604 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 20:55:12,605 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 20:55:12,605 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 20:55:12,608 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 20:55:12,609 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:55:12" (1/1) ... [2019-11-23 20:55:12,612 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f6a1297 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:55:12, skipping insertion in model container [2019-11-23 20:55:12,613 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:55:12" (1/1) ... [2019-11-23 20:55:12,620 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 20:55:12,708 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 20:55:13,389 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 20:55:13,568 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 20:55:13,852 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 20:55:13,880 INFO L208 MainTranslator]: Completed translation [2019-11-23 20:55:13,880 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:55:13 WrapperNode [2019-11-23 20:55:13,881 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 20:55:13,882 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 20:55:13,882 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 20:55:13,882 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 20:55:13,892 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:55:13" (1/1) ... [2019-11-23 20:55:13,938 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:55:13" (1/1) ... [2019-11-23 20:55:14,046 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 20:55:14,047 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 20:55:14,047 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 20:55:14,047 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 20:55:14,057 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:55:13" (1/1) ... [2019-11-23 20:55:14,057 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:55:13" (1/1) ... [2019-11-23 20:55:14,063 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:55:13" (1/1) ... [2019-11-23 20:55:14,064 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:55:13" (1/1) ... [2019-11-23 20:55:14,114 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:55:13" (1/1) ... [2019-11-23 20:55:14,148 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:55:13" (1/1) ... [2019-11-23 20:55:14,169 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:55:13" (1/1) ... [2019-11-23 20:55:14,186 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 20:55:14,187 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 20:55:14,187 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 20:55:14,187 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 20:55:14,188 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:55:13" (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:55:14,251 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 20:55:14,252 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 20:55:16,352 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 20:55:16,353 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-23 20:55:16,354 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:55:16 BoogieIcfgContainer [2019-11-23 20:55:16,354 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 20:55:16,355 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 20:55:16,356 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 20:55:16,359 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 20:55:16,359 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 08:55:12" (1/3) ... [2019-11-23 20:55:16,360 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6415d67c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:55:16, skipping insertion in model container [2019-11-23 20:55:16,361 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:55:13" (2/3) ... [2019-11-23 20:55:16,361 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6415d67c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:55:16, skipping insertion in model container [2019-11-23 20:55:16,361 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:55:16" (3/3) ... [2019-11-23 20:55:16,363 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem03_label06.c [2019-11-23 20:55:16,373 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 20:55:16,381 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 20:55:16,393 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 20:55:16,422 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 20:55:16,422 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 20:55:16,422 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 20:55:16,422 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 20:55:16,422 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 20:55:16,423 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 20:55:16,423 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 20:55:16,423 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 20:55:16,445 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states. [2019-11-23 20:55:16,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-11-23 20:55:16,460 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:55:16,462 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:55:16,462 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:55:16,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:55:16,468 INFO L82 PathProgramCache]: Analyzing trace with hash 1533533723, now seen corresponding path program 1 times [2019-11-23 20:55:16,477 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:55:16,478 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381472568] [2019-11-23 20:55:16,478 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:55:16,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:55:17,061 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:55:17,061 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381472568] [2019-11-23 20:55:17,062 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:55:17,063 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:55:17,064 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789883736] [2019-11-23 20:55:17,070 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 20:55:17,070 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:55:17,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 20:55:17,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:55:17,132 INFO L87 Difference]: Start difference. First operand 302 states. Second operand 4 states. [2019-11-23 20:55:19,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:55:19,424 INFO L93 Difference]: Finished difference Result 1023 states and 1861 transitions. [2019-11-23 20:55:19,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 20:55:19,427 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 169 [2019-11-23 20:55:19,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:55:19,449 INFO L225 Difference]: With dead ends: 1023 [2019-11-23 20:55:19,449 INFO L226 Difference]: Without dead ends: 654 [2019-11-23 20:55:19,454 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:55:19,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 654 states. [2019-11-23 20:55:19,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 654 to 652. [2019-11-23 20:55:19,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 652 states. [2019-11-23 20:55:19,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 652 states to 652 states and 964 transitions. [2019-11-23 20:55:19,542 INFO L78 Accepts]: Start accepts. Automaton has 652 states and 964 transitions. Word has length 169 [2019-11-23 20:55:19,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:55:19,543 INFO L462 AbstractCegarLoop]: Abstraction has 652 states and 964 transitions. [2019-11-23 20:55:19,543 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 20:55:19,544 INFO L276 IsEmpty]: Start isEmpty. Operand 652 states and 964 transitions. [2019-11-23 20:55:19,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-11-23 20:55:19,549 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:55:19,550 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:55:19,550 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:55:19,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:55:19,551 INFO L82 PathProgramCache]: Analyzing trace with hash 728541020, now seen corresponding path program 1 times [2019-11-23 20:55:19,551 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:55:19,551 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137296621] [2019-11-23 20:55:19,552 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:55:19,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:55:19,688 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:55:19,688 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137296621] [2019-11-23 20:55:19,688 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:55:19,689 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 20:55:19,689 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120713591] [2019-11-23 20:55:19,691 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:55:19,691 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:55:19,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:55:19,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:55:19,692 INFO L87 Difference]: Start difference. First operand 652 states and 964 transitions. Second operand 3 states. [2019-11-23 20:55:20,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:55:20,863 INFO L93 Difference]: Finished difference Result 1929 states and 2864 transitions. [2019-11-23 20:55:20,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:55:20,864 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 177 [2019-11-23 20:55:20,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:55:20,871 INFO L225 Difference]: With dead ends: 1929 [2019-11-23 20:55:20,871 INFO L226 Difference]: Without dead ends: 1279 [2019-11-23 20:55:20,875 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:55:20,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1279 states. [2019-11-23 20:55:20,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1279 to 1265. [2019-11-23 20:55:20,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1265 states. [2019-11-23 20:55:20,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1265 states to 1265 states and 1831 transitions. [2019-11-23 20:55:20,931 INFO L78 Accepts]: Start accepts. Automaton has 1265 states and 1831 transitions. Word has length 177 [2019-11-23 20:55:20,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:55:20,931 INFO L462 AbstractCegarLoop]: Abstraction has 1265 states and 1831 transitions. [2019-11-23 20:55:20,931 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:55:20,932 INFO L276 IsEmpty]: Start isEmpty. Operand 1265 states and 1831 transitions. [2019-11-23 20:55:20,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-11-23 20:55:20,941 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:55:20,941 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:55:20,942 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:55:20,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:55:20,942 INFO L82 PathProgramCache]: Analyzing trace with hash -1433788651, now seen corresponding path program 1 times [2019-11-23 20:55:20,943 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:55:20,943 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493780172] [2019-11-23 20:55:20,943 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:55:21,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:55:21,080 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:55:21,080 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493780172] [2019-11-23 20:55:21,082 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:55:21,082 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 20:55:21,083 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081635280] [2019-11-23 20:55:21,083 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:55:21,084 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:55:21,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:55:21,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:55:21,085 INFO L87 Difference]: Start difference. First operand 1265 states and 1831 transitions. Second operand 3 states. [2019-11-23 20:55:21,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:55:21,585 INFO L93 Difference]: Finished difference Result 3779 states and 5474 transitions. [2019-11-23 20:55:21,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:55:21,586 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 189 [2019-11-23 20:55:21,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:55:21,598 INFO L225 Difference]: With dead ends: 3779 [2019-11-23 20:55:21,598 INFO L226 Difference]: Without dead ends: 2516 [2019-11-23 20:55:21,601 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:55:21,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2516 states. [2019-11-23 20:55:21,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2516 to 2513. [2019-11-23 20:55:21,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2513 states. [2019-11-23 20:55:21,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2513 states to 2513 states and 3630 transitions. [2019-11-23 20:55:21,675 INFO L78 Accepts]: Start accepts. Automaton has 2513 states and 3630 transitions. Word has length 189 [2019-11-23 20:55:21,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:55:21,676 INFO L462 AbstractCegarLoop]: Abstraction has 2513 states and 3630 transitions. [2019-11-23 20:55:21,677 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:55:21,682 INFO L276 IsEmpty]: Start isEmpty. Operand 2513 states and 3630 transitions. [2019-11-23 20:55:21,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2019-11-23 20:55:21,689 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:55:21,690 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:21,690 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:55:21,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:55:21,690 INFO L82 PathProgramCache]: Analyzing trace with hash 413925161, now seen corresponding path program 1 times [2019-11-23 20:55:21,691 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:55:21,691 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293612976] [2019-11-23 20:55:21,691 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:55:21,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:55:21,830 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-11-23 20:55:21,831 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293612976] [2019-11-23 20:55:21,831 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:55:21,831 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 20:55:21,831 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169288696] [2019-11-23 20:55:21,832 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:55:21,832 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:55:21,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:55:21,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:55:21,833 INFO L87 Difference]: Start difference. First operand 2513 states and 3630 transitions. Second operand 3 states. [2019-11-23 20:55:22,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:55:22,374 INFO L93 Difference]: Finished difference Result 4986 states and 7206 transitions. [2019-11-23 20:55:22,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:55:22,375 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 197 [2019-11-23 20:55:22,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:55:22,387 INFO L225 Difference]: With dead ends: 4986 [2019-11-23 20:55:22,387 INFO L226 Difference]: Without dead ends: 2475 [2019-11-23 20:55:22,391 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:55:22,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2475 states. [2019-11-23 20:55:22,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2475 to 2475. [2019-11-23 20:55:22,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2475 states. [2019-11-23 20:55:22,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2475 states to 2475 states and 3502 transitions. [2019-11-23 20:55:22,446 INFO L78 Accepts]: Start accepts. Automaton has 2475 states and 3502 transitions. Word has length 197 [2019-11-23 20:55:22,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:55:22,447 INFO L462 AbstractCegarLoop]: Abstraction has 2475 states and 3502 transitions. [2019-11-23 20:55:22,447 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:55:22,447 INFO L276 IsEmpty]: Start isEmpty. Operand 2475 states and 3502 transitions. [2019-11-23 20:55:22,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2019-11-23 20:55:22,452 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:55:22,452 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:22,452 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:55:22,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:55:22,453 INFO L82 PathProgramCache]: Analyzing trace with hash 1595982807, now seen corresponding path program 1 times [2019-11-23 20:55:22,453 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:55:22,453 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911309180] [2019-11-23 20:55:22,454 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:55:22,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:55:22,653 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:55:22,654 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911309180] [2019-11-23 20:55:22,654 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:55:22,654 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 20:55:22,655 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794136901] [2019-11-23 20:55:22,655 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 20:55:22,655 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:55:22,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 20:55:22,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 20:55:22,656 INFO L87 Difference]: Start difference. First operand 2475 states and 3502 transitions. Second operand 5 states. [2019-11-23 20:55:24,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:55:24,569 INFO L93 Difference]: Finished difference Result 5981 states and 8557 transitions. [2019-11-23 20:55:24,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 20:55:24,570 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 207 [2019-11-23 20:55:24,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:55:24,586 INFO L225 Difference]: With dead ends: 5981 [2019-11-23 20:55:24,586 INFO L226 Difference]: Without dead ends: 3508 [2019-11-23 20:55:24,589 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 20:55:24,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3508 states. [2019-11-23 20:55:24,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3508 to 2881. [2019-11-23 20:55:24,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2881 states. [2019-11-23 20:55:24,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2881 states to 2881 states and 4092 transitions. [2019-11-23 20:55:24,650 INFO L78 Accepts]: Start accepts. Automaton has 2881 states and 4092 transitions. Word has length 207 [2019-11-23 20:55:24,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:55:24,651 INFO L462 AbstractCegarLoop]: Abstraction has 2881 states and 4092 transitions. [2019-11-23 20:55:24,651 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 20:55:24,651 INFO L276 IsEmpty]: Start isEmpty. Operand 2881 states and 4092 transitions. [2019-11-23 20:55:24,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2019-11-23 20:55:24,657 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:55:24,657 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:24,658 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:55:24,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:55:24,658 INFO L82 PathProgramCache]: Analyzing trace with hash -161225717, now seen corresponding path program 1 times [2019-11-23 20:55:24,658 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:55:24,659 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641232294] [2019-11-23 20:55:24,659 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:55:24,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:55:24,762 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 56 proven. 8 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-11-23 20:55:24,763 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641232294] [2019-11-23 20:55:24,763 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2123339949] [2019-11-23 20:55:24,763 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:55:24,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:55:24,986 INFO L255 TraceCheckSpWp]: Trace formula consists of 524 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-23 20:55:25,002 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:55:25,122 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2019-11-23 20:55:25,123 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-23 20:55:25,123 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 3 [2019-11-23 20:55:25,124 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757977988] [2019-11-23 20:55:25,124 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:55:25,124 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:55:25,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:55:25,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:55:25,125 INFO L87 Difference]: Start difference. First operand 2881 states and 4092 transitions. Second operand 3 states. [2019-11-23 20:55:25,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:55:25,514 INFO L93 Difference]: Finished difference Result 8637 states and 12270 transitions. [2019-11-23 20:55:25,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:55:25,514 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 241 [2019-11-23 20:55:25,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:55:25,541 INFO L225 Difference]: With dead ends: 8637 [2019-11-23 20:55:25,542 INFO L226 Difference]: Without dead ends: 5758 [2019-11-23 20:55:25,547 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 241 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:55:25,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5758 states. [2019-11-23 20:55:25,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5758 to 5756. [2019-11-23 20:55:25,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5756 states. [2019-11-23 20:55:25,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5756 states to 5756 states and 8155 transitions. [2019-11-23 20:55:25,740 INFO L78 Accepts]: Start accepts. Automaton has 5756 states and 8155 transitions. Word has length 241 [2019-11-23 20:55:25,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:55:25,741 INFO L462 AbstractCegarLoop]: Abstraction has 5756 states and 8155 transitions. [2019-11-23 20:55:25,741 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:55:25,741 INFO L276 IsEmpty]: Start isEmpty. Operand 5756 states and 8155 transitions. [2019-11-23 20:55:25,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2019-11-23 20:55:25,754 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:55:25,762 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:25,978 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:55:25,978 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:55:25,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:55:25,979 INFO L82 PathProgramCache]: Analyzing trace with hash -1637825347, now seen corresponding path program 1 times [2019-11-23 20:55:25,980 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:55:25,981 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46034684] [2019-11-23 20:55:25,981 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:55:26,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:55:26,136 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-23 20:55:26,137 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46034684] [2019-11-23 20:55:26,138 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:55:26,138 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:55:26,138 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448846673] [2019-11-23 20:55:26,139 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:55:26,139 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:55:26,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:55:26,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:55:26,140 INFO L87 Difference]: Start difference. First operand 5756 states and 8155 transitions. Second operand 3 states. [2019-11-23 20:55:27,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:55:27,272 INFO L93 Difference]: Finished difference Result 16806 states and 23749 transitions. [2019-11-23 20:55:27,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:55:27,272 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 242 [2019-11-23 20:55:27,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:55:27,315 INFO L225 Difference]: With dead ends: 16806 [2019-11-23 20:55:27,315 INFO L226 Difference]: Without dead ends: 11052 [2019-11-23 20:55:27,325 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:55:27,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11052 states. [2019-11-23 20:55:27,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11052 to 11048. [2019-11-23 20:55:27,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11048 states. [2019-11-23 20:55:27,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11048 states to 11048 states and 14561 transitions. [2019-11-23 20:55:27,533 INFO L78 Accepts]: Start accepts. Automaton has 11048 states and 14561 transitions. Word has length 242 [2019-11-23 20:55:27,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:55:27,533 INFO L462 AbstractCegarLoop]: Abstraction has 11048 states and 14561 transitions. [2019-11-23 20:55:27,533 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:55:27,533 INFO L276 IsEmpty]: Start isEmpty. Operand 11048 states and 14561 transitions. [2019-11-23 20:55:27,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2019-11-23 20:55:27,635 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:55:27,635 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-23 20:55:27,635 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:55:27,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:55:27,636 INFO L82 PathProgramCache]: Analyzing trace with hash 759817113, now seen corresponding path program 1 times [2019-11-23 20:55:27,636 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:55:27,636 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352112490] [2019-11-23 20:55:27,637 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:55:27,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:55:27,869 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:55:27,869 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352112490] [2019-11-23 20:55:27,869 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:55:27,869 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:55:27,870 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708326045] [2019-11-23 20:55:27,870 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 20:55:27,871 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:55:27,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 20:55:27,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:55:27,872 INFO L87 Difference]: Start difference. First operand 11048 states and 14561 transitions. Second operand 4 states. [2019-11-23 20:55:29,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:55:29,597 INFO L93 Difference]: Finished difference Result 38772 states and 50858 transitions. [2019-11-23 20:55:29,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 20:55:29,597 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 247 [2019-11-23 20:55:29,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:55:29,663 INFO L225 Difference]: With dead ends: 38772 [2019-11-23 20:55:29,663 INFO L226 Difference]: Without dead ends: 27726 [2019-11-23 20:55:29,675 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:55:29,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27726 states. [2019-11-23 20:55:29,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27726 to 20792. [2019-11-23 20:55:29,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20792 states. [2019-11-23 20:55:30,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20792 states to 20792 states and 26361 transitions. [2019-11-23 20:55:30,019 INFO L78 Accepts]: Start accepts. Automaton has 20792 states and 26361 transitions. Word has length 247 [2019-11-23 20:55:30,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:55:30,019 INFO L462 AbstractCegarLoop]: Abstraction has 20792 states and 26361 transitions. [2019-11-23 20:55:30,019 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 20:55:30,019 INFO L276 IsEmpty]: Start isEmpty. Operand 20792 states and 26361 transitions. [2019-11-23 20:55:30,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2019-11-23 20:55:30,053 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:55:30,053 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:30,054 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:55:30,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:55:30,054 INFO L82 PathProgramCache]: Analyzing trace with hash -1063142085, now seen corresponding path program 1 times [2019-11-23 20:55:30,055 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:55:30,055 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78237448] [2019-11-23 20:55:30,055 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:55:30,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:55:30,170 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2019-11-23 20:55:30,170 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78237448] [2019-11-23 20:55:30,170 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:55:30,171 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:55:30,171 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087327431] [2019-11-23 20:55:30,172 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:55:30,172 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:55:30,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:55:30,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:55:30,172 INFO L87 Difference]: Start difference. First operand 20792 states and 26361 transitions. Second operand 3 states. [2019-11-23 20:55:31,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:55:31,211 INFO L93 Difference]: Finished difference Result 41590 states and 52734 transitions. [2019-11-23 20:55:31,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:55:31,211 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 251 [2019-11-23 20:55:31,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:55:31,259 INFO L225 Difference]: With dead ends: 41590 [2019-11-23 20:55:31,260 INFO L226 Difference]: Without dead ends: 20800 [2019-11-23 20:55:31,282 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 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:55:31,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20800 states. [2019-11-23 20:55:31,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20800 to 20792. [2019-11-23 20:55:31,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20792 states. [2019-11-23 20:55:31,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20792 states to 20792 states and 24482 transitions. [2019-11-23 20:55:31,730 INFO L78 Accepts]: Start accepts. Automaton has 20792 states and 24482 transitions. Word has length 251 [2019-11-23 20:55:31,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:55:31,730 INFO L462 AbstractCegarLoop]: Abstraction has 20792 states and 24482 transitions. [2019-11-23 20:55:31,730 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:55:31,731 INFO L276 IsEmpty]: Start isEmpty. Operand 20792 states and 24482 transitions. [2019-11-23 20:55:31,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2019-11-23 20:55:31,747 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:55:31,748 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:31,748 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:55:31,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:55:31,749 INFO L82 PathProgramCache]: Analyzing trace with hash 1663998635, now seen corresponding path program 1 times [2019-11-23 20:55:31,749 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:55:31,749 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19463792] [2019-11-23 20:55:31,750 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:55:31,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:55:31,853 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-11-23 20:55:31,854 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19463792] [2019-11-23 20:55:31,854 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:55:31,854 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:55:31,855 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37380389] [2019-11-23 20:55:31,855 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 20:55:31,855 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:55:31,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 20:55:31,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:55:31,856 INFO L87 Difference]: Start difference. First operand 20792 states and 24482 transitions. Second operand 4 states. [2019-11-23 20:55:33,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:55:33,017 INFO L93 Difference]: Finished difference Result 41176 states and 48504 transitions. [2019-11-23 20:55:33,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 20:55:33,017 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 268 [2019-11-23 20:55:33,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:55:33,049 INFO L225 Difference]: With dead ends: 41176 [2019-11-23 20:55:33,051 INFO L226 Difference]: Without dead ends: 20386 [2019-11-23 20:55:33,070 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:55:33,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20386 states. [2019-11-23 20:55:33,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20386 to 20386. [2019-11-23 20:55:33,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20386 states. [2019-11-23 20:55:33,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20386 states to 20386 states and 23032 transitions. [2019-11-23 20:55:33,491 INFO L78 Accepts]: Start accepts. Automaton has 20386 states and 23032 transitions. Word has length 268 [2019-11-23 20:55:33,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:55:33,492 INFO L462 AbstractCegarLoop]: Abstraction has 20386 states and 23032 transitions. [2019-11-23 20:55:33,492 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 20:55:33,492 INFO L276 IsEmpty]: Start isEmpty. Operand 20386 states and 23032 transitions. [2019-11-23 20:55:33,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2019-11-23 20:55:33,506 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:55:33,507 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:33,507 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:55:33,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:55:33,507 INFO L82 PathProgramCache]: Analyzing trace with hash -1558817520, now seen corresponding path program 1 times [2019-11-23 20:55:33,508 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:55:33,508 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321577969] [2019-11-23 20:55:33,508 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:55:33,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:55:33,645 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-11-23 20:55:33,646 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321577969] [2019-11-23 20:55:33,646 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:55:33,647 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:55:33,647 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462218951] [2019-11-23 20:55:33,647 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 20:55:33,648 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:55:33,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 20:55:33,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:55:33,648 INFO L87 Difference]: Start difference. First operand 20386 states and 23032 transitions. Second operand 4 states. [2019-11-23 20:55:36,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:55:36,529 INFO L93 Difference]: Finished difference Result 79281 states and 89718 transitions. [2019-11-23 20:55:36,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 20:55:36,529 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 270 [2019-11-23 20:55:36,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:55:36,598 INFO L225 Difference]: With dead ends: 79281 [2019-11-23 20:55:36,598 INFO L226 Difference]: Without dead ends: 58897 [2019-11-23 20:55:36,616 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:55:36,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58897 states. [2019-11-23 20:55:37,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58897 to 58893. [2019-11-23 20:55:37,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58893 states. [2019-11-23 20:55:37,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58893 states to 58893 states and 66550 transitions. [2019-11-23 20:55:37,189 INFO L78 Accepts]: Start accepts. Automaton has 58893 states and 66550 transitions. Word has length 270 [2019-11-23 20:55:37,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:55:37,190 INFO L462 AbstractCegarLoop]: Abstraction has 58893 states and 66550 transitions. [2019-11-23 20:55:37,190 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 20:55:37,190 INFO L276 IsEmpty]: Start isEmpty. Operand 58893 states and 66550 transitions. [2019-11-23 20:55:37,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2019-11-23 20:55:37,204 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:55:37,204 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:55:37,204 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:55:37,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:55:37,205 INFO L82 PathProgramCache]: Analyzing trace with hash -187630124, now seen corresponding path program 1 times [2019-11-23 20:55:37,205 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:55:37,205 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116604057] [2019-11-23 20:55:37,205 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:55:37,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:55:37,556 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-11-23 20:55:37,557 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116604057] [2019-11-23 20:55:37,557 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:55:37,557 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:55:37,557 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838238921] [2019-11-23 20:55:37,558 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:55:37,558 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:55:37,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:55:37,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:55:37,559 INFO L87 Difference]: Start difference. First operand 58893 states and 66550 transitions. Second operand 3 states. [2019-11-23 20:55:39,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:55:39,196 INFO L93 Difference]: Finished difference Result 154384 states and 173941 transitions. [2019-11-23 20:55:39,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:55:39,196 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 302 [2019-11-23 20:55:39,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:55:39,282 INFO L225 Difference]: With dead ends: 154384 [2019-11-23 20:55:39,282 INFO L226 Difference]: Without dead ends: 95493 [2019-11-23 20:55:39,323 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:55:39,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95493 states. [2019-11-23 20:55:41,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95493 to 95457. [2019-11-23 20:55:41,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95457 states. [2019-11-23 20:55:41,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95457 states to 95457 states and 105696 transitions. [2019-11-23 20:55:41,631 INFO L78 Accepts]: Start accepts. Automaton has 95457 states and 105696 transitions. Word has length 302 [2019-11-23 20:55:41,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:55:41,631 INFO L462 AbstractCegarLoop]: Abstraction has 95457 states and 105696 transitions. [2019-11-23 20:55:41,631 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:55:41,631 INFO L276 IsEmpty]: Start isEmpty. Operand 95457 states and 105696 transitions. [2019-11-23 20:55:41,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2019-11-23 20:55:41,648 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:55:41,648 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:41,648 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:55:41,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:55:41,649 INFO L82 PathProgramCache]: Analyzing trace with hash 1679996946, now seen corresponding path program 1 times [2019-11-23 20:55:41,649 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:55:41,649 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312104758] [2019-11-23 20:55:41,649 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:55:41,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:55:41,814 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2019-11-23 20:55:41,815 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312104758] [2019-11-23 20:55:41,815 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:55:41,815 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 20:55:41,816 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318115998] [2019-11-23 20:55:41,816 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:55:41,816 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:55:41,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:55:41,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:55:41,821 INFO L87 Difference]: Start difference. First operand 95457 states and 105696 transitions. Second operand 3 states. [2019-11-23 20:55:43,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:55:43,798 INFO L93 Difference]: Finished difference Result 234303 states and 259782 transitions. [2019-11-23 20:55:43,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:55:43,799 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 305 [2019-11-23 20:55:43,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:55:43,930 INFO L225 Difference]: With dead ends: 234303 [2019-11-23 20:55:43,930 INFO L226 Difference]: Without dead ends: 138848 [2019-11-23 20:55:43,987 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:55:44,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138848 states. [2019-11-23 20:55:47,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138848 to 138830. [2019-11-23 20:55:47,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138830 states. [2019-11-23 20:55:47,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138830 states to 138830 states and 153929 transitions. [2019-11-23 20:55:47,329 INFO L78 Accepts]: Start accepts. Automaton has 138830 states and 153929 transitions. Word has length 305 [2019-11-23 20:55:47,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:55:47,329 INFO L462 AbstractCegarLoop]: Abstraction has 138830 states and 153929 transitions. [2019-11-23 20:55:47,329 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:55:47,329 INFO L276 IsEmpty]: Start isEmpty. Operand 138830 states and 153929 transitions. [2019-11-23 20:55:47,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2019-11-23 20:55:47,344 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:55:47,344 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:47,345 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:55:47,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:55:47,345 INFO L82 PathProgramCache]: Analyzing trace with hash -1262892857, now seen corresponding path program 1 times [2019-11-23 20:55:47,345 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:55:47,345 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113604220] [2019-11-23 20:55:47,346 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:55:47,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:55:47,507 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 105 proven. 3 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2019-11-23 20:55:47,507 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113604220] [2019-11-23 20:55:47,508 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [943880909] [2019-11-23 20:55:47,508 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:55:48,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:55:48,063 INFO L255 TraceCheckSpWp]: Trace formula consists of 558 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-23 20:55:48,082 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:55:48,271 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2019-11-23 20:55:48,271 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-23 20:55:48,272 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2019-11-23 20:55:48,276 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055490261] [2019-11-23 20:55:48,277 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:55:48,277 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:55:48,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:55:48,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-23 20:55:48,278 INFO L87 Difference]: Start difference. First operand 138830 states and 153929 transitions. Second operand 3 states. [2019-11-23 20:55:49,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:55:49,838 INFO L93 Difference]: Finished difference Result 276870 states and 307050 transitions. [2019-11-23 20:55:49,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:55:49,838 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 312 [2019-11-23 20:55:49,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:55:49,986 INFO L225 Difference]: With dead ends: 276870 [2019-11-23 20:55:49,986 INFO L226 Difference]: Without dead ends: 138042 [2019-11-23 20:55:50,044 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 311 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-23 20:55:50,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138042 states. [2019-11-23 20:55:51,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138042 to 134364. [2019-11-23 20:55:51,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134364 states. [2019-11-23 20:55:51,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134364 states to 134364 states and 147445 transitions. [2019-11-23 20:55:51,807 INFO L78 Accepts]: Start accepts. Automaton has 134364 states and 147445 transitions. Word has length 312 [2019-11-23 20:55:51,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:55:51,808 INFO L462 AbstractCegarLoop]: Abstraction has 134364 states and 147445 transitions. [2019-11-23 20:55:51,808 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:55:51,808 INFO L276 IsEmpty]: Start isEmpty. Operand 134364 states and 147445 transitions. [2019-11-23 20:55:51,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 365 [2019-11-23 20:55:51,838 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:55:51,838 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-23 20:55:52,042 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:55:52,042 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:55:52,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:55:52,043 INFO L82 PathProgramCache]: Analyzing trace with hash -406259352, now seen corresponding path program 1 times [2019-11-23 20:55:52,043 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:55:52,044 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49664418] [2019-11-23 20:55:52,044 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:55:52,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:55:55,016 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 105 proven. 3 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2019-11-23 20:55:55,016 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49664418] [2019-11-23 20:55:55,016 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1303118910] [2019-11-23 20:55:55,019 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:55:55,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:55:55,195 INFO L255 TraceCheckSpWp]: Trace formula consists of 616 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-23 20:55:55,200 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:55:55,297 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 192 proven. 0 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2019-11-23 20:55:55,298 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-23 20:55:55,298 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2019-11-23 20:55:55,298 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156068451] [2019-11-23 20:55:55,299 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:55:55,299 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:55:55,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:55:55,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-23 20:55:55,300 INFO L87 Difference]: Start difference. First operand 134364 states and 147445 transitions. Second operand 3 states. [2019-11-23 20:55:56,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:55:56,878 INFO L93 Difference]: Finished difference Result 308004 states and 339041 transitions. [2019-11-23 20:55:56,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:55:56,878 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 364 [2019-11-23 20:55:56,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:55:56,879 INFO L225 Difference]: With dead ends: 308004 [2019-11-23 20:55:56,879 INFO L226 Difference]: Without dead ends: 0 [2019-11-23 20:55:56,981 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 367 GetRequests, 363 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-23 20:55:56,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-23 20:55:56,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-23 20:55:56,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-23 20:55:56,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-23 20:55:56,982 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 364 [2019-11-23 20:55:56,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:55:56,982 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-23 20:55:56,982 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:55:56,982 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-23 20:55:56,983 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-23 20:55:57,186 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:55:57,192 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-23 20:56:00,653 WARN L192 SmtUtils]: Spent 3.44 s on a formula simplification. DAG size of input: 1054 DAG size of output: 383 [2019-11-23 20:56:03,193 WARN L192 SmtUtils]: Spent 2.53 s on a formula simplification. DAG size of input: 1054 DAG size of output: 383 [2019-11-23 20:56:06,516 WARN L192 SmtUtils]: Spent 3.32 s on a formula simplification. DAG size of input: 383 DAG size of output: 50 [2019-11-23 20:56:09,779 WARN L192 SmtUtils]: Spent 3.26 s on a formula simplification. DAG size of input: 383 DAG size of output: 50 [2019-11-23 20:56:09,782 INFO L444 ceAbstractionStarter]: For program point L498(lines 498 511) no Hoare annotation was computed. [2019-11-23 20:56:09,783 INFO L444 ceAbstractionStarter]: For program point L498-2(lines 498 511) no Hoare annotation was computed. [2019-11-23 20:56:09,783 INFO L444 ceAbstractionStarter]: For program point L1423(lines 1423 1465) no Hoare annotation was computed. [2019-11-23 20:56:09,783 INFO L444 ceAbstractionStarter]: For program point L366(lines 366 1465) no Hoare annotation was computed. [2019-11-23 20:56:09,783 INFO L444 ceAbstractionStarter]: For program point L1622-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:56:09,783 INFO L444 ceAbstractionStarter]: For program point L1556-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:56:09,783 INFO L444 ceAbstractionStarter]: For program point L1490-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:56:09,783 INFO L444 ceAbstractionStarter]: For program point L301(lines 301 1465) no Hoare annotation was computed. [2019-11-23 20:56:09,783 INFO L444 ceAbstractionStarter]: For program point L1226(lines 1226 1465) no Hoare annotation was computed. [2019-11-23 20:56:09,783 INFO L444 ceAbstractionStarter]: For program point L1623(line 1623) no Hoare annotation was computed. [2019-11-23 20:56:09,783 INFO L444 ceAbstractionStarter]: For program point L566(lines 566 1465) no Hoare annotation was computed. [2019-11-23 20:56:09,783 INFO L444 ceAbstractionStarter]: For program point L1557(line 1557) no Hoare annotation was computed. [2019-11-23 20:56:09,784 INFO L444 ceAbstractionStarter]: For program point L1491(line 1491) no Hoare annotation was computed. [2019-11-23 20:56:09,784 INFO L444 ceAbstractionStarter]: For program point L434(lines 434 1465) no Hoare annotation was computed. [2019-11-23 20:56:09,784 INFO L444 ceAbstractionStarter]: For program point L1359(lines 1359 1465) no Hoare annotation was computed. [2019-11-23 20:56:09,784 INFO L444 ceAbstractionStarter]: For program point L1095(lines 1095 1465) no Hoare annotation was computed. [2019-11-23 20:56:09,784 INFO L444 ceAbstractionStarter]: For program point L633(lines 633 1465) no Hoare annotation was computed. [2019-11-23 20:56:09,784 INFO L444 ceAbstractionStarter]: For program point L1360(lines 1360 1379) no Hoare annotation was computed. [2019-11-23 20:56:09,784 INFO L444 ceAbstractionStarter]: For program point L1360-2(lines 1360 1379) no Hoare annotation was computed. [2019-11-23 20:56:09,784 INFO L444 ceAbstractionStarter]: For program point L1162(lines 1162 1465) no Hoare annotation was computed. [2019-11-23 20:56:09,784 INFO L444 ceAbstractionStarter]: For program point L105(lines 105 1465) no Hoare annotation was computed. [2019-11-23 20:56:09,784 INFO L444 ceAbstractionStarter]: For program point L1625-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:56:09,784 INFO L444 ceAbstractionStarter]: For program point L1559-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:56:09,784 INFO L444 ceAbstractionStarter]: For program point L1493-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:56:09,784 INFO L444 ceAbstractionStarter]: For program point L238(lines 238 1465) no Hoare annotation was computed. [2019-11-23 20:56:09,785 INFO L444 ceAbstractionStarter]: For program point L172(lines 172 1465) no Hoare annotation was computed. [2019-11-23 20:56:09,785 INFO L444 ceAbstractionStarter]: For program point L1031(lines 1031 1465) no Hoare annotation was computed. [2019-11-23 20:56:09,785 INFO L444 ceAbstractionStarter]: For program point L899(lines 899 1465) no Hoare annotation was computed. [2019-11-23 20:56:09,785 INFO L444 ceAbstractionStarter]: For program point L701(lines 701 1465) no Hoare annotation was computed. [2019-11-23 20:56:09,785 INFO L444 ceAbstractionStarter]: For program point L1626(line 1626) no Hoare annotation was computed. [2019-11-23 20:56:09,785 INFO L444 ceAbstractionStarter]: For program point L1560(line 1560) no Hoare annotation was computed. [2019-11-23 20:56:09,785 INFO L444 ceAbstractionStarter]: For program point L1494(line 1494) no Hoare annotation was computed. [2019-11-23 20:56:09,785 INFO L444 ceAbstractionStarter]: For program point L966(lines 966 1465) no Hoare annotation was computed. [2019-11-23 20:56:09,785 INFO L444 ceAbstractionStarter]: For program point L769(lines 769 1465) no Hoare annotation was computed. [2019-11-23 20:56:09,786 INFO L444 ceAbstractionStarter]: For program point L1628-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:56:09,786 INFO L444 ceAbstractionStarter]: For program point L1562-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:56:09,786 INFO L444 ceAbstractionStarter]: For program point L1496-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:56:09,786 INFO L444 ceAbstractionStarter]: For program point L836(lines 836 1465) no Hoare annotation was computed. [2019-11-23 20:56:09,786 INFO L444 ceAbstractionStarter]: For program point L1629(line 1629) no Hoare annotation was computed. [2019-11-23 20:56:09,786 INFO L444 ceAbstractionStarter]: For program point L1563(line 1563) no Hoare annotation was computed. [2019-11-23 20:56:09,786 INFO L444 ceAbstractionStarter]: For program point L1497(line 1497) no Hoare annotation was computed. [2019-11-23 20:56:09,786 INFO L444 ceAbstractionStarter]: For program point L441(lines 441 1465) no Hoare annotation was computed. [2019-11-23 20:56:09,786 INFO L444 ceAbstractionStarter]: For program point L1432(lines 1432 1465) no Hoare annotation was computed. [2019-11-23 20:56:09,787 INFO L444 ceAbstractionStarter]: For program point L574(lines 574 1465) no Hoare annotation was computed. [2019-11-23 20:56:09,787 INFO L444 ceAbstractionStarter]: For program point L1631-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:56:09,787 INFO L444 ceAbstractionStarter]: For program point L1565-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:56:09,787 INFO L444 ceAbstractionStarter]: For program point L1499-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:56:09,787 INFO L444 ceAbstractionStarter]: For program point L1632(line 1632) no Hoare annotation was computed. [2019-11-23 20:56:09,787 INFO L444 ceAbstractionStarter]: For program point L1566(line 1566) no Hoare annotation was computed. [2019-11-23 20:56:09,787 INFO L444 ceAbstractionStarter]: For program point L1500(line 1500) no Hoare annotation was computed. [2019-11-23 20:56:09,787 INFO L444 ceAbstractionStarter]: For program point L377(lines 377 1465) no Hoare annotation was computed. [2019-11-23 20:56:09,787 INFO L444 ceAbstractionStarter]: For program point L1104(lines 1104 1465) no Hoare annotation was computed. [2019-11-23 20:56:09,788 INFO L444 ceAbstractionStarter]: For program point L1038(lines 1038 1465) no Hoare annotation was computed. [2019-11-23 20:56:09,788 INFO L444 ceAbstractionStarter]: For program point L378(lines 378 395) no Hoare annotation was computed. [2019-11-23 20:56:09,788 INFO L444 ceAbstractionStarter]: For program point L312(lines 312 1465) no Hoare annotation was computed. [2019-11-23 20:56:09,788 INFO L444 ceAbstractionStarter]: For program point L378-2(lines 378 395) no Hoare annotation was computed. [2019-11-23 20:56:09,788 INFO L444 ceAbstractionStarter]: For program point L1237(lines 1237 1465) no Hoare annotation was computed. [2019-11-23 20:56:09,788 INFO L444 ceAbstractionStarter]: For program point L114(lines 114 1465) no Hoare annotation was computed. [2019-11-23 20:56:09,788 INFO L444 ceAbstractionStarter]: For program point L1039(lines 1039 1059) no Hoare annotation was computed. [2019-11-23 20:56:09,788 INFO L444 ceAbstractionStarter]: For program point L1039-2(lines 1039 1059) no Hoare annotation was computed. [2019-11-23 20:56:09,788 INFO L444 ceAbstractionStarter]: For program point L907(lines 907 1465) no Hoare annotation was computed. [2019-11-23 20:56:09,788 INFO L444 ceAbstractionStarter]: For program point L709(lines 709 1465) no Hoare annotation was computed. [2019-11-23 20:56:09,788 INFO L444 ceAbstractionStarter]: For program point L643(lines 643 1465) no Hoare annotation was computed. [2019-11-23 20:56:09,788 INFO L444 ceAbstractionStarter]: For program point L1634-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:56:09,788 INFO L444 ceAbstractionStarter]: For program point L1568-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:56:09,788 INFO L444 ceAbstractionStarter]: For program point L1502-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:56:09,788 INFO L444 ceAbstractionStarter]: For program point L181(lines 181 1465) no Hoare annotation was computed. [2019-11-23 20:56:09,789 INFO L444 ceAbstractionStarter]: For program point L710(lines 710 731) no Hoare annotation was computed. [2019-11-23 20:56:09,789 INFO L444 ceAbstractionStarter]: For program point L710-2(lines 710 731) no Hoare annotation was computed. [2019-11-23 20:56:09,789 INFO L444 ceAbstractionStarter]: For program point L1635(line 1635) no Hoare annotation was computed. [2019-11-23 20:56:09,789 INFO L444 ceAbstractionStarter]: For program point L1569(line 1569) no Hoare annotation was computed. [2019-11-23 20:56:09,789 INFO L444 ceAbstractionStarter]: For program point L1503(line 1503) no Hoare annotation was computed. [2019-11-23 20:56:09,789 INFO L444 ceAbstractionStarter]: For program point L1305(lines 1305 1465) no Hoare annotation was computed. [2019-11-23 20:56:09,789 INFO L444 ceAbstractionStarter]: For program point L248(lines 248 1465) no Hoare annotation was computed. [2019-11-23 20:56:09,789 INFO L444 ceAbstractionStarter]: For program point L1173(lines 1173 1465) no Hoare annotation was computed. [2019-11-23 20:56:09,789 INFO L444 ceAbstractionStarter]: For program point L975(lines 975 1465) no Hoare annotation was computed. [2019-11-23 20:56:09,789 INFO L444 ceAbstractionStarter]: For program point L777(lines 777 1465) no Hoare annotation was computed. [2019-11-23 20:56:09,789 INFO L444 ceAbstractionStarter]: For program point L513(lines 513 1465) no Hoare annotation was computed. [2019-11-23 20:56:09,789 INFO L444 ceAbstractionStarter]: For program point L844(lines 844 1465) no Hoare annotation was computed. [2019-11-23 20:56:09,789 INFO L444 ceAbstractionStarter]: For program point L1637-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:56:09,789 INFO L444 ceAbstractionStarter]: For program point L1571-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:56:09,789 INFO L444 ceAbstractionStarter]: For program point L1505-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:56:09,790 INFO L444 ceAbstractionStarter]: For program point L1638(line 1638) no Hoare annotation was computed. [2019-11-23 20:56:09,790 INFO L444 ceAbstractionStarter]: For program point L1572(line 1572) no Hoare annotation was computed. [2019-11-23 20:56:09,790 INFO L444 ceAbstractionStarter]: For program point L1506(line 1506) no Hoare annotation was computed. [2019-11-23 20:56:09,790 INFO L444 ceAbstractionStarter]: For program point L450(lines 450 1465) no Hoare annotation was computed. [2019-11-23 20:56:09,790 INFO L444 ceAbstractionStarter]: For program point L583(lines 583 1465) no Hoare annotation was computed. [2019-11-23 20:56:09,790 INFO L444 ceAbstractionStarter]: For program point L1640-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:56:09,790 INFO L444 ceAbstractionStarter]: For program point L1574-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:56:09,790 INFO L444 ceAbstractionStarter]: For program point L1508-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:56:09,790 INFO L444 ceAbstractionStarter]: For program point L1442(lines 1442 1465) no Hoare annotation was computed. [2019-11-23 20:56:09,790 INFO L444 ceAbstractionStarter]: For program point L319(lines 319 1465) no Hoare annotation was computed. [2019-11-23 20:56:09,790 INFO L444 ceAbstractionStarter]: For program point L1112(lines 1112 1465) no Hoare annotation was computed. [2019-11-23 20:56:09,790 INFO L444 ceAbstractionStarter]: For program point L55(lines 55 1465) no Hoare annotation was computed. [2019-11-23 20:56:09,791 INFO L444 ceAbstractionStarter]: For program point L1641(line 1641) no Hoare annotation was computed. [2019-11-23 20:56:09,791 INFO L444 ceAbstractionStarter]: For program point L1575(line 1575) no Hoare annotation was computed. [2019-11-23 20:56:09,791 INFO L444 ceAbstractionStarter]: For program point L1509(line 1509) no Hoare annotation was computed. [2019-11-23 20:56:09,791 INFO L444 ceAbstractionStarter]: For program point L56(lines 56 71) no Hoare annotation was computed. [2019-11-23 20:56:09,791 INFO L444 ceAbstractionStarter]: For program point L56-2(lines 56 71) no Hoare annotation was computed. [2019-11-23 20:56:09,791 INFO L444 ceAbstractionStarter]: For program point L784(lines 784 1465) no Hoare annotation was computed. [2019-11-23 20:56:09,791 INFO L444 ceAbstractionStarter]: For program point L1643-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:56:09,791 INFO L444 ceAbstractionStarter]: For program point L1577-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:56:09,791 INFO L444 ceAbstractionStarter]: For program point L1511-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:56:09,792 INFO L444 ceAbstractionStarter]: For program point L1313(lines 1313 1465) no Hoare annotation was computed. [2019-11-23 20:56:09,792 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-23 20:56:09,792 INFO L444 ceAbstractionStarter]: For program point L983(lines 983 1465) no Hoare annotation was computed. [2019-11-23 20:56:09,792 INFO L444 ceAbstractionStarter]: For program point L917(lines 917 1465) no Hoare annotation was computed. [2019-11-23 20:56:09,792 INFO L444 ceAbstractionStarter]: For program point L653(lines 653 1465) no Hoare annotation was computed. [2019-11-23 20:56:09,792 INFO L444 ceAbstractionStarter]: For program point L1644(line 1644) no Hoare annotation was computed. [2019-11-23 20:56:09,792 INFO L444 ceAbstractionStarter]: For program point L1578(line 1578) no Hoare annotation was computed. [2019-11-23 20:56:09,792 INFO L444 ceAbstractionStarter]: For program point L1512(line 1512) no Hoare annotation was computed. [2019-11-23 20:56:09,792 INFO L444 ceAbstractionStarter]: For program point L257(lines 257 1465) no Hoare annotation was computed. [2019-11-23 20:56:09,792 INFO L444 ceAbstractionStarter]: For program point L191(lines 191 1465) no Hoare annotation was computed. [2019-11-23 20:56:09,792 INFO L444 ceAbstractionStarter]: For program point L1182(lines 1182 1465) no Hoare annotation was computed. [2019-11-23 20:56:09,792 INFO L444 ceAbstractionStarter]: For program point L918(lines 918 935) no Hoare annotation was computed. [2019-11-23 20:56:09,792 INFO L444 ceAbstractionStarter]: For program point L918-2(lines 918 935) no Hoare annotation was computed. [2019-11-23 20:56:09,792 INFO L444 ceAbstractionStarter]: For program point L522(lines 522 1465) no Hoare annotation was computed. [2019-11-23 20:56:09,793 INFO L444 ceAbstractionStarter]: For program point L1381(lines 1381 1465) no Hoare annotation was computed. [2019-11-23 20:56:09,793 INFO L444 ceAbstractionStarter]: For program point L1249(lines 1249 1465) no Hoare annotation was computed. [2019-11-23 20:56:09,793 INFO L444 ceAbstractionStarter]: For program point L192(lines 192 211) no Hoare annotation was computed. [2019-11-23 20:56:09,793 INFO L444 ceAbstractionStarter]: For program point L126(lines 126 1465) no Hoare annotation was computed. [2019-11-23 20:56:09,793 INFO L444 ceAbstractionStarter]: For program point L192-2(lines 192 211) no Hoare annotation was computed. [2019-11-23 20:56:09,793 INFO L444 ceAbstractionStarter]: For program point L853(lines 853 1465) no Hoare annotation was computed. [2019-11-23 20:56:09,793 INFO L444 ceAbstractionStarter]: For program point L1646-1(lines 1646 1648) no Hoare annotation was computed. [2019-11-23 20:56:09,793 INFO L444 ceAbstractionStarter]: For program point L1580-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:56:09,793 INFO L444 ceAbstractionStarter]: For program point L1514-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:56:09,793 INFO L444 ceAbstractionStarter]: For program point L1382(lines 1382 1400) no Hoare annotation was computed. [2019-11-23 20:56:09,793 INFO L444 ceAbstractionStarter]: For program point L1382-2(lines 1382 1400) no Hoare annotation was computed. [2019-11-23 20:56:09,793 INFO L444 ceAbstractionStarter]: For program point L1250(lines 1250 1272) no Hoare annotation was computed. [2019-11-23 20:56:09,793 INFO L444 ceAbstractionStarter]: For program point L1250-2(lines 1250 1272) no Hoare annotation was computed. [2019-11-23 20:56:09,793 INFO L444 ceAbstractionStarter]: For program point L1647(line 1647) no Hoare annotation was computed. [2019-11-23 20:56:09,793 INFO L444 ceAbstractionStarter]: For program point L1581(line 1581) no Hoare annotation was computed. [2019-11-23 20:56:09,794 INFO L444 ceAbstractionStarter]: For program point L1515(line 1515) no Hoare annotation was computed. [2019-11-23 20:56:09,794 INFO L444 ceAbstractionStarter]: For program point L458(lines 458 1465) no Hoare annotation was computed. [2019-11-23 20:56:09,794 INFO L444 ceAbstractionStarter]: For program point L1120(lines 1120 1465) no Hoare annotation was computed. [2019-11-23 20:56:09,794 INFO L444 ceAbstractionStarter]: For program point L658(lines 658 1465) no Hoare annotation was computed. [2019-11-23 20:56:09,794 INFO L440 ceAbstractionStarter]: At program point L1649(lines 54 1650) the Hoare annotation is: (let ((.cse4 (= ~a27~0 1))) (let ((.cse10 (not .cse4)) (.cse11 (= ~a16~0 1)) (.cse2 (= 1 ~a6~0)) (.cse8 (<= ~a6~0 0)) (.cse5 (= ~a11~0 1)) (.cse12 (= 1 ~a3~0)) (.cse13 (<= ~a20~0 0)) (.cse7 (<= ~a3~0 0)) (.cse0 (not (= 0 ~a3~0))) (.cse1 (= 1 ~a5~0)) (.cse9 (= ~a12~0 1)) (.cse3 (<= ~a11~0 0)) (.cse6 (= ~a26~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse1 .cse5) (and .cse1 .cse2 .cse5 .cse6) (and .cse7 .cse8 .cse1 .cse9 .cse3) (and .cse8 .cse1 .cse10 .cse5 .cse6 .cse11) (and .cse12 .cse1 .cse3 .cse6) (and .cse7 .cse1 .cse9 .cse10 .cse3 .cse11) (and .cse12 .cse1 .cse2 .cse9 .cse5 .cse11) (and .cse1 .cse12 .cse9 .cse3) (and .cse1 .cse4 .cse9 .cse3) (and .cse1 .cse2 .cse3 .cse6) (and .cse0 .cse8 .cse1 .cse5) (and .cse1 .cse4 .cse3 .cse13) (and .cse8 (= ~a10~0 1) .cse1 .cse9 .cse5 .cse6) (and .cse1 .cse12 .cse3 .cse13) (and .cse7 .cse4 .cse1 .cse3) (and .cse0 .cse1 .cse9 .cse3 .cse6)))) [2019-11-23 20:56:09,794 INFO L444 ceAbstractionStarter]: For program point L592(lines 592 1465) no Hoare annotation was computed. [2019-11-23 20:56:09,794 INFO L444 ceAbstractionStarter]: For program point L1583-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:56:09,795 INFO L444 ceAbstractionStarter]: For program point L1517-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:56:09,795 INFO L444 ceAbstractionStarter]: For program point L1584(line 1584) no Hoare annotation was computed. [2019-11-23 20:56:09,795 INFO L444 ceAbstractionStarter]: For program point L1518(line 1518) no Hoare annotation was computed. [2019-11-23 20:56:09,795 INFO L444 ceAbstractionStarter]: For program point L1452(lines 1452 1465) no Hoare annotation was computed. [2019-11-23 20:56:09,795 INFO L444 ceAbstractionStarter]: For program point L329(lines 329 1465) no Hoare annotation was computed. [2019-11-23 20:56:09,795 INFO L444 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-23 20:56:09,795 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 1542) no Hoare annotation was computed. [2019-11-23 20:56:09,795 INFO L444 ceAbstractionStarter]: For program point L1321(lines 1321 1465) no Hoare annotation was computed. [2019-11-23 20:56:09,795 INFO L447 ceAbstractionStarter]: At program point L1652(lines 1652 1669) the Hoare annotation is: true [2019-11-23 20:56:09,795 INFO L444 ceAbstractionStarter]: For program point L529(lines 529 1465) no Hoare annotation was computed. [2019-11-23 20:56:09,795 INFO L444 ceAbstractionStarter]: For program point L1586-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:56:09,795 INFO L444 ceAbstractionStarter]: For program point L1520-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:56:09,795 INFO L444 ceAbstractionStarter]: For program point L397(lines 397 1465) no Hoare annotation was computed. [2019-11-23 20:56:09,795 INFO L444 ceAbstractionStarter]: For program point L265(lines 265 1465) no Hoare annotation was computed. [2019-11-23 20:56:09,796 INFO L444 ceAbstractionStarter]: For program point L1190(lines 1190 1465) no Hoare annotation was computed. [2019-11-23 20:56:09,796 INFO L444 ceAbstractionStarter]: For program point L1587(line 1587) no Hoare annotation was computed. [2019-11-23 20:56:09,796 INFO L444 ceAbstractionStarter]: For program point L1521(line 1521) no Hoare annotation was computed. [2019-11-23 20:56:09,796 INFO L444 ceAbstractionStarter]: For program point L795(lines 795 1465) no Hoare annotation was computed. [2019-11-23 20:56:09,796 INFO L444 ceAbstractionStarter]: For program point L135(lines 135 1465) no Hoare annotation was computed. [2019-11-23 20:56:09,796 INFO L444 ceAbstractionStarter]: For program point L994(lines 994 1465) no Hoare annotation was computed. [2019-11-23 20:56:09,796 INFO L444 ceAbstractionStarter]: For program point L1589-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:56:09,796 INFO L444 ceAbstractionStarter]: For program point L1523-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:56:09,796 INFO L444 ceAbstractionStarter]: For program point L1127(lines 1127 1465) no Hoare annotation was computed. [2019-11-23 20:56:09,796 INFO L444 ceAbstractionStarter]: For program point L1061(lines 1061 1465) no Hoare annotation was computed. [2019-11-23 20:56:09,796 INFO L444 ceAbstractionStarter]: For program point L863(lines 863 1465) no Hoare annotation was computed. [2019-11-23 20:56:09,796 INFO L444 ceAbstractionStarter]: For program point L665(lines 665 1465) no Hoare annotation was computed. [2019-11-23 20:56:09,796 INFO L444 ceAbstractionStarter]: For program point L1590(line 1590) no Hoare annotation was computed. [2019-11-23 20:56:09,797 INFO L444 ceAbstractionStarter]: For program point L1524(line 1524) no Hoare annotation was computed. [2019-11-23 20:56:09,797 INFO L444 ceAbstractionStarter]: For program point L467(lines 467 1465) no Hoare annotation was computed. [2019-11-23 20:56:09,797 INFO L444 ceAbstractionStarter]: For program point L1326(lines 1326 1465) no Hoare annotation was computed. [2019-11-23 20:56:09,797 INFO L444 ceAbstractionStarter]: For program point L468(lines 468 478) no Hoare annotation was computed. [2019-11-23 20:56:09,797 INFO L444 ceAbstractionStarter]: For program point L468-2(lines 468 478) no Hoare annotation was computed. [2019-11-23 20:56:09,797 INFO L444 ceAbstractionStarter]: For program point L733(lines 733 1465) no Hoare annotation was computed. [2019-11-23 20:56:09,797 INFO L440 ceAbstractionStarter]: At program point L1658-2(lines 1658 1668) the Hoare annotation is: (let ((.cse4 (= ~a27~0 1))) (let ((.cse10 (not .cse4)) (.cse11 (= ~a16~0 1)) (.cse2 (= 1 ~a6~0)) (.cse8 (<= ~a6~0 0)) (.cse5 (= ~a11~0 1)) (.cse12 (= 1 ~a3~0)) (.cse13 (<= ~a20~0 0)) (.cse7 (<= ~a3~0 0)) (.cse0 (not (= 0 ~a3~0))) (.cse1 (= 1 ~a5~0)) (.cse9 (= ~a12~0 1)) (.cse3 (<= ~a11~0 0)) (.cse6 (= ~a26~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse1 .cse5) (and .cse1 .cse2 .cse5 .cse6) (and .cse7 .cse8 .cse1 .cse9 .cse3) (and .cse8 .cse1 .cse10 .cse5 .cse6 .cse11) (and .cse12 .cse1 .cse3 .cse6) (and .cse7 .cse1 .cse9 .cse10 .cse3 .cse11) (and .cse12 .cse1 .cse2 .cse9 .cse5 .cse11) (and .cse1 .cse12 .cse9 .cse3) (and .cse1 .cse4 .cse9 .cse3) (and .cse1 .cse2 .cse3 .cse6) (and .cse0 .cse8 .cse1 .cse5) (and .cse1 .cse4 .cse3 .cse13) (and .cse8 (= ~a10~0 1) .cse1 .cse9 .cse5 .cse6) (and .cse1 .cse12 .cse3 .cse13) (and .cse7 .cse4 .cse1 .cse3) (and .cse0 .cse1 .cse9 .cse3 .cse6)))) [2019-11-23 20:56:09,797 INFO L444 ceAbstractionStarter]: For program point L1592-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:56:09,797 INFO L444 ceAbstractionStarter]: For program point L1526-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:56:09,797 INFO L444 ceAbstractionStarter]: For program point L1460(lines 1460 1465) no Hoare annotation was computed. [2019-11-23 20:56:09,797 INFO L444 ceAbstractionStarter]: For program point L73(lines 73 1465) no Hoare annotation was computed. [2019-11-23 20:56:09,797 INFO L444 ceAbstractionStarter]: For program point L1593(line 1593) no Hoare annotation was computed. [2019-11-23 20:56:09,797 INFO L444 ceAbstractionStarter]: For program point L1527(line 1527) no Hoare annotation was computed. [2019-11-23 20:56:09,798 INFO L444 ceAbstractionStarter]: For program point L603(lines 603 1465) no Hoare annotation was computed. [2019-11-23 20:56:09,798 INFO L444 ceAbstractionStarter]: For program point L405(lines 405 1465) no Hoare annotation was computed. [2019-11-23 20:56:09,798 INFO L444 ceAbstractionStarter]: For program point L339(lines 339 1465) no Hoare annotation was computed. [2019-11-23 20:56:09,798 INFO L444 ceAbstractionStarter]: For program point L1132(lines 1132 1465) no Hoare annotation was computed. [2019-11-23 20:56:09,798 INFO L444 ceAbstractionStarter]: For program point L1066(lines 1066 1465) no Hoare annotation was computed. [2019-11-23 20:56:09,798 INFO L444 ceAbstractionStarter]: For program point L868(lines 868 1465) no Hoare annotation was computed. [2019-11-23 20:56:09,798 INFO L444 ceAbstractionStarter]: For program point L1595-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:56:09,798 INFO L444 ceAbstractionStarter]: For program point L1529-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:56:09,798 INFO L444 ceAbstractionStarter]: For program point L869(lines 869 887) no Hoare annotation was computed. [2019-11-23 20:56:09,798 INFO L444 ceAbstractionStarter]: For program point L869-2(lines 869 887) no Hoare annotation was computed. [2019-11-23 20:56:09,798 INFO L444 ceAbstractionStarter]: For program point L1596(line 1596) no Hoare annotation was computed. [2019-11-23 20:56:09,798 INFO L444 ceAbstractionStarter]: For program point L539(lines 539 1465) no Hoare annotation was computed. [2019-11-23 20:56:09,798 INFO L444 ceAbstractionStarter]: For program point L1530(line 1530) no Hoare annotation was computed. [2019-11-23 20:56:09,798 INFO L444 ceAbstractionStarter]: For program point L1200(lines 1200 1465) no Hoare annotation was computed. [2019-11-23 20:56:09,798 INFO L444 ceAbstractionStarter]: For program point L804(lines 804 1465) no Hoare annotation was computed. [2019-11-23 20:56:09,799 INFO L444 ceAbstractionStarter]: For program point L1663(line 1663) no Hoare annotation was computed. [2019-11-23 20:56:09,799 INFO L444 ceAbstractionStarter]: For program point L276(lines 276 1465) no Hoare annotation was computed. [2019-11-23 20:56:09,799 INFO L444 ceAbstractionStarter]: For program point L1003(lines 1003 1465) no Hoare annotation was computed. [2019-11-23 20:56:09,799 INFO L444 ceAbstractionStarter]: For program point L937(lines 937 1465) no Hoare annotation was computed. [2019-11-23 20:56:09,799 INFO L444 ceAbstractionStarter]: For program point L1598-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:56:09,799 INFO L444 ceAbstractionStarter]: For program point L1532-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:56:09,799 INFO L444 ceAbstractionStarter]: For program point L1466(lines 1466 1468) no Hoare annotation was computed. [2019-11-23 20:56:09,799 INFO L444 ceAbstractionStarter]: For program point L1466-2(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:56:09,799 INFO L444 ceAbstractionStarter]: For program point L1599(line 1599) no Hoare annotation was computed. [2019-11-23 20:56:09,800 INFO L444 ceAbstractionStarter]: For program point L1533(line 1533) no Hoare annotation was computed. [2019-11-23 20:56:09,800 INFO L444 ceAbstractionStarter]: For program point L1467(line 1467) no Hoare annotation was computed. [2019-11-23 20:56:09,800 INFO L444 ceAbstractionStarter]: For program point L146(lines 146 1465) no Hoare annotation was computed. [2019-11-23 20:56:09,800 INFO L444 ceAbstractionStarter]: For program point L675(lines 675 1465) no Hoare annotation was computed. [2019-11-23 20:56:09,800 INFO L444 ceAbstractionStarter]: For program point L1402(lines 1402 1465) no Hoare annotation was computed. [2019-11-23 20:56:09,800 INFO L444 ceAbstractionStarter]: For program point L1336(lines 1336 1465) no Hoare annotation was computed. [2019-11-23 20:56:09,800 INFO L444 ceAbstractionStarter]: For program point L213(lines 213 1465) no Hoare annotation was computed. [2019-11-23 20:56:09,800 INFO L444 ceAbstractionStarter]: For program point L1601-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:56:09,800 INFO L444 ceAbstractionStarter]: For program point L1535-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:56:09,800 INFO L444 ceAbstractionStarter]: For program point L1469-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:56:09,801 INFO L444 ceAbstractionStarter]: For program point L1403(lines 1403 1421) no Hoare annotation was computed. [2019-11-23 20:56:09,801 INFO L444 ceAbstractionStarter]: For program point L1403-2(lines 1403 1421) no Hoare annotation was computed. [2019-11-23 20:56:09,801 INFO L444 ceAbstractionStarter]: For program point L82(lines 82 1465) no Hoare annotation was computed. [2019-11-23 20:56:09,801 INFO L444 ceAbstractionStarter]: For program point L743(lines 743 1465) no Hoare annotation was computed. [2019-11-23 20:56:09,801 INFO L444 ceAbstractionStarter]: For program point L1602(line 1602) no Hoare annotation was computed. [2019-11-23 20:56:09,801 INFO L444 ceAbstractionStarter]: For program point L1536(line 1536) no Hoare annotation was computed. [2019-11-23 20:56:09,801 INFO L444 ceAbstractionStarter]: For program point L1470(line 1470) no Hoare annotation was computed. [2019-11-23 20:56:09,801 INFO L444 ceAbstractionStarter]: For program point L1074(lines 1074 1465) no Hoare annotation was computed. [2019-11-23 20:56:09,801 INFO L444 ceAbstractionStarter]: For program point L546(lines 546 1465) no Hoare annotation was computed. [2019-11-23 20:56:09,801 INFO L444 ceAbstractionStarter]: For program point L480(lines 480 1465) no Hoare annotation was computed. [2019-11-23 20:56:09,801 INFO L444 ceAbstractionStarter]: For program point L414(lines 414 1465) no Hoare annotation was computed. [2019-11-23 20:56:09,802 INFO L444 ceAbstractionStarter]: For program point L348(lines 348 1465) no Hoare annotation was computed. [2019-11-23 20:56:09,802 INFO L444 ceAbstractionStarter]: For program point L1604-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:56:09,802 INFO L444 ceAbstractionStarter]: For program point L1538-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:56:09,802 INFO L444 ceAbstractionStarter]: For program point L1472-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:56:09,802 INFO L444 ceAbstractionStarter]: For program point L1274(lines 1274 1465) no Hoare annotation was computed. [2019-11-23 20:56:09,802 INFO L444 ceAbstractionStarter]: For program point L1142(lines 1142 1465) no Hoare annotation was computed. [2019-11-23 20:56:09,802 INFO L444 ceAbstractionStarter]: For program point L614(lines 614 1465) no Hoare annotation was computed. [2019-11-23 20:56:09,802 INFO L444 ceAbstractionStarter]: For program point L1605(line 1605) no Hoare annotation was computed. [2019-11-23 20:56:09,802 INFO L444 ceAbstractionStarter]: For program point L1539(line 1539) no Hoare annotation was computed. [2019-11-23 20:56:09,802 INFO L444 ceAbstractionStarter]: For program point L1473(line 1473) no Hoare annotation was computed. [2019-11-23 20:56:09,803 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-23 20:56:09,803 INFO L444 ceAbstractionStarter]: For program point L284(lines 284 1465) no Hoare annotation was computed. [2019-11-23 20:56:09,803 INFO L444 ceAbstractionStarter]: For program point L1011(lines 1011 1465) no Hoare annotation was computed. [2019-11-23 20:56:09,803 INFO L444 ceAbstractionStarter]: For program point L813(lines 813 1465) no Hoare annotation was computed. [2019-11-23 20:56:09,803 INFO L444 ceAbstractionStarter]: For program point L1210(lines 1210 1465) no Hoare annotation was computed. [2019-11-23 20:56:09,803 INFO L444 ceAbstractionStarter]: For program point L1607-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:56:09,803 INFO L444 ceAbstractionStarter]: For program point L1541-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:56:09,803 INFO L444 ceAbstractionStarter]: For program point L1475-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:56:09,803 INFO L444 ceAbstractionStarter]: For program point L1211(lines 1211 1224) no Hoare annotation was computed. [2019-11-23 20:56:09,803 INFO L444 ceAbstractionStarter]: For program point L1211-2(lines 1211 1224) no Hoare annotation was computed. [2019-11-23 20:56:09,803 INFO L444 ceAbstractionStarter]: For program point L947(lines 947 1465) no Hoare annotation was computed. [2019-11-23 20:56:09,804 INFO L444 ceAbstractionStarter]: For program point L1608(line 1608) no Hoare annotation was computed. [2019-11-23 20:56:09,804 INFO L444 ceAbstractionStarter]: For program point L1542(line 1542) no Hoare annotation was computed. [2019-11-23 20:56:09,804 INFO L444 ceAbstractionStarter]: For program point L1476(line 1476) no Hoare annotation was computed. [2019-11-23 20:56:09,804 INFO L444 ceAbstractionStarter]: For program point L1344(lines 1344 1465) no Hoare annotation was computed. [2019-11-23 20:56:09,804 INFO L444 ceAbstractionStarter]: For program point L155(lines 155 1465) no Hoare annotation was computed. [2019-11-23 20:56:09,804 INFO L444 ceAbstractionStarter]: For program point L89(lines 89 1465) no Hoare annotation was computed. [2019-11-23 20:56:09,804 INFO L444 ceAbstractionStarter]: For program point L684(lines 684 1465) no Hoare annotation was computed. [2019-11-23 20:56:09,804 INFO L444 ceAbstractionStarter]: For program point L222(lines 222 1465) no Hoare annotation was computed. [2019-11-23 20:56:09,804 INFO L444 ceAbstractionStarter]: For program point L685(lines 685 699) no Hoare annotation was computed. [2019-11-23 20:56:09,804 INFO L444 ceAbstractionStarter]: For program point L685-2(lines 685 699) no Hoare annotation was computed. [2019-11-23 20:56:09,804 INFO L444 ceAbstractionStarter]: For program point L1610-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:56:09,805 INFO L444 ceAbstractionStarter]: For program point L1544-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:56:09,805 INFO L444 ceAbstractionStarter]: For program point L1478-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:56:09,805 INFO L444 ceAbstractionStarter]: For program point L1611(line 1611) no Hoare annotation was computed. [2019-11-23 20:56:09,805 INFO L444 ceAbstractionStarter]: For program point L1545(line 1545) no Hoare annotation was computed. [2019-11-23 20:56:09,805 INFO L444 ceAbstractionStarter]: For program point L488(lines 488 1465) no Hoare annotation was computed. [2019-11-23 20:56:09,805 INFO L444 ceAbstractionStarter]: For program point L1479(line 1479) no Hoare annotation was computed. [2019-11-23 20:56:09,805 INFO L444 ceAbstractionStarter]: For program point L422(lines 422 1465) no Hoare annotation was computed. [2019-11-23 20:56:09,805 INFO L444 ceAbstractionStarter]: For program point L356(lines 356 1465) no Hoare annotation was computed. [2019-11-23 20:56:09,805 INFO L444 ceAbstractionStarter]: For program point L753(lines 753 1465) no Hoare annotation was computed. [2019-11-23 20:56:09,805 INFO L444 ceAbstractionStarter]: For program point L622(lines 622 1465) no Hoare annotation was computed. [2019-11-23 20:56:09,805 INFO L444 ceAbstractionStarter]: For program point L556(lines 556 1465) no Hoare annotation was computed. [2019-11-23 20:56:09,806 INFO L444 ceAbstractionStarter]: For program point L1613-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:56:09,806 INFO L444 ceAbstractionStarter]: For program point L1547-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:56:09,806 INFO L444 ceAbstractionStarter]: For program point L1481-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:56:09,806 INFO L444 ceAbstractionStarter]: For program point L292(lines 292 1465) no Hoare annotation was computed. [2019-11-23 20:56:09,806 INFO L444 ceAbstractionStarter]: For program point L1283(lines 1283 1465) no Hoare annotation was computed. [2019-11-23 20:56:09,806 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-23 20:56:09,806 INFO L444 ceAbstractionStarter]: For program point L1614(line 1614) no Hoare annotation was computed. [2019-11-23 20:56:09,806 INFO L444 ceAbstractionStarter]: For program point L1548(line 1548) no Hoare annotation was computed. [2019-11-23 20:56:09,806 INFO L444 ceAbstractionStarter]: For program point L1482(line 1482) no Hoare annotation was computed. [2019-11-23 20:56:09,806 INFO L444 ceAbstractionStarter]: For program point L1350(lines 1350 1465) no Hoare annotation was computed. [2019-11-23 20:56:09,807 INFO L444 ceAbstractionStarter]: For program point L1284(lines 1284 1303) no Hoare annotation was computed. [2019-11-23 20:56:09,807 INFO L444 ceAbstractionStarter]: For program point L1284-2(lines 1284 1303) no Hoare annotation was computed. [2019-11-23 20:56:09,807 INFO L444 ceAbstractionStarter]: For program point L1152(lines 1152 1465) no Hoare annotation was computed. [2019-11-23 20:56:09,807 INFO L444 ceAbstractionStarter]: For program point L95(lines 95 1465) no Hoare annotation was computed. [2019-11-23 20:56:09,807 INFO L444 ceAbstractionStarter]: For program point L1086(lines 1086 1465) no Hoare annotation was computed. [2019-11-23 20:56:09,807 INFO L444 ceAbstractionStarter]: For program point L1021(lines 1021 1465) no Hoare annotation was computed. [2019-11-23 20:56:09,807 INFO L444 ceAbstractionStarter]: For program point L955(lines 955 1465) no Hoare annotation was computed. [2019-11-23 20:56:09,807 INFO L444 ceAbstractionStarter]: For program point L889(lines 889 1465) no Hoare annotation was computed. [2019-11-23 20:56:09,807 INFO L444 ceAbstractionStarter]: For program point L1616-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:56:09,808 INFO L444 ceAbstractionStarter]: For program point L1550-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:56:09,808 INFO L444 ceAbstractionStarter]: For program point L1484-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:56:09,808 INFO L444 ceAbstractionStarter]: For program point L1617(line 1617) no Hoare annotation was computed. [2019-11-23 20:56:09,808 INFO L444 ceAbstractionStarter]: For program point L1551(line 1551) no Hoare annotation was computed. [2019-11-23 20:56:09,808 INFO L444 ceAbstractionStarter]: For program point L1485(line 1485) no Hoare annotation was computed. [2019-11-23 20:56:09,808 INFO L444 ceAbstractionStarter]: For program point L164(lines 164 1465) no Hoare annotation was computed. [2019-11-23 20:56:09,808 INFO L444 ceAbstractionStarter]: For program point L825(lines 825 1465) no Hoare annotation was computed. [2019-11-23 20:56:09,808 INFO L444 ceAbstractionStarter]: For program point L1619-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:56:09,808 INFO L444 ceAbstractionStarter]: For program point L1553-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:56:09,809 INFO L444 ceAbstractionStarter]: For program point L1487-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:56:09,809 INFO L444 ceAbstractionStarter]: For program point L761(lines 761 1465) no Hoare annotation was computed. [2019-11-23 20:56:09,809 INFO L444 ceAbstractionStarter]: For program point L1620(line 1620) no Hoare annotation was computed. [2019-11-23 20:56:09,809 INFO L444 ceAbstractionStarter]: For program point L1554(line 1554) no Hoare annotation was computed. [2019-11-23 20:56:09,809 INFO L444 ceAbstractionStarter]: For program point L497(lines 497 1465) no Hoare annotation was computed. [2019-11-23 20:56:09,809 INFO L444 ceAbstractionStarter]: For program point L1488(line 1488) no Hoare annotation was computed. [2019-11-23 20:56:09,809 INFO L444 ceAbstractionStarter]: For program point L233(lines 233 1465) no Hoare annotation was computed. [2019-11-23 20:56:09,836 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 08:56:09 BoogieIcfgContainer [2019-11-23 20:56:09,836 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-23 20:56:09,838 INFO L168 Benchmark]: Toolchain (without parser) took 57234.78 ms. Allocated memory was 146.3 MB in the beginning and 2.4 GB in the end (delta: 2.3 GB). Free memory was 99.1 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2019-11-23 20:56:09,839 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 146.3 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-11-23 20:56:09,840 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1276.66 ms. Allocated memory was 146.3 MB in the beginning and 237.0 MB in the end (delta: 90.7 MB). Free memory was 98.9 MB in the beginning and 185.7 MB in the end (delta: -86.8 MB). Peak memory consumption was 49.3 MB. Max. memory is 7.1 GB. [2019-11-23 20:56:09,840 INFO L168 Benchmark]: Boogie Procedure Inliner took 164.76 ms. Allocated memory is still 237.0 MB. Free memory was 185.7 MB in the beginning and 170.7 MB in the end (delta: 15.0 MB). Peak memory consumption was 15.0 MB. Max. memory is 7.1 GB. [2019-11-23 20:56:09,841 INFO L168 Benchmark]: Boogie Preprocessor took 139.29 ms. Allocated memory is still 237.0 MB. Free memory was 170.7 MB in the beginning and 159.5 MB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 7.1 GB. [2019-11-23 20:56:09,842 INFO L168 Benchmark]: RCFGBuilder took 2167.97 ms. Allocated memory was 237.0 MB in the beginning and 270.5 MB in the end (delta: 33.6 MB). Free memory was 159.5 MB in the beginning and 183.4 MB in the end (delta: -23.9 MB). Peak memory consumption was 105.3 MB. Max. memory is 7.1 GB. [2019-11-23 20:56:09,843 INFO L168 Benchmark]: TraceAbstraction took 53480.89 ms. Allocated memory was 270.5 MB in the beginning and 2.4 GB in the end (delta: 2.2 GB). Free memory was 183.4 MB in the beginning and 1.4 GB in the end (delta: -1.2 GB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2019-11-23 20:56:09,847 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 146.3 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1276.66 ms. Allocated memory was 146.3 MB in the beginning and 237.0 MB in the end (delta: 90.7 MB). Free memory was 98.9 MB in the beginning and 185.7 MB in the end (delta: -86.8 MB). Peak memory consumption was 49.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 164.76 ms. Allocated memory is still 237.0 MB. Free memory was 185.7 MB in the beginning and 170.7 MB in the end (delta: 15.0 MB). Peak memory consumption was 15.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 139.29 ms. Allocated memory is still 237.0 MB. Free memory was 170.7 MB in the beginning and 159.5 MB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2167.97 ms. Allocated memory was 237.0 MB in the beginning and 270.5 MB in the end (delta: 33.6 MB). Free memory was 159.5 MB in the beginning and 183.4 MB in the end (delta: -23.9 MB). Peak memory consumption was 105.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 53480.89 ms. Allocated memory was 270.5 MB in the beginning and 2.4 GB in the end (delta: 2.2 GB). Free memory was 183.4 MB in the beginning and 1.4 GB in the end (delta: -1.2 GB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1542]: 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: ((((((((((((((((((!(0 == a3) && 1 == a5) && 1 == a6) && a11 <= 0) || ((a27 == 1 && 1 == a5) && a11 == 1)) || (((1 == a5 && 1 == a6) && a11 == 1) && a26 == 1)) || ((((a3 <= 0 && a6 <= 0) && 1 == a5) && a12 == 1) && a11 <= 0)) || (((((a6 <= 0 && 1 == a5) && !(a27 == 1)) && a11 == 1) && a26 == 1) && a16 == 1)) || (((1 == a3 && 1 == a5) && a11 <= 0) && a26 == 1)) || (((((a3 <= 0 && 1 == a5) && a12 == 1) && !(a27 == 1)) && a11 <= 0) && a16 == 1)) || (((((1 == a3 && 1 == a5) && 1 == a6) && a12 == 1) && a11 == 1) && a16 == 1)) || (((1 == a5 && 1 == a3) && a12 == 1) && a11 <= 0)) || (((1 == a5 && a27 == 1) && a12 == 1) && a11 <= 0)) || (((1 == a5 && 1 == a6) && a11 <= 0) && a26 == 1)) || (((!(0 == a3) && a6 <= 0) && 1 == a5) && a11 == 1)) || (((1 == a5 && a27 == 1) && a11 <= 0) && a20 <= 0)) || (((((a6 <= 0 && a10 == 1) && 1 == a5) && a12 == 1) && a11 == 1) && a26 == 1)) || (((1 == a5 && 1 == a3) && a11 <= 0) && a20 <= 0)) || (((a3 <= 0 && a27 == 1) && 1 == a5) && a11 <= 0)) || ((((!(0 == a3) && 1 == a5) && a12 == 1) && a11 <= 0) && a26 == 1) - InvariantResult [Line: 54]: Loop Invariant Derived loop invariant: ((((((((((((((((((!(0 == a3) && 1 == a5) && 1 == a6) && a11 <= 0) || ((a27 == 1 && 1 == a5) && a11 == 1)) || (((1 == a5 && 1 == a6) && a11 == 1) && a26 == 1)) || ((((a3 <= 0 && a6 <= 0) && 1 == a5) && a12 == 1) && a11 <= 0)) || (((((a6 <= 0 && 1 == a5) && !(a27 == 1)) && a11 == 1) && a26 == 1) && a16 == 1)) || (((1 == a3 && 1 == a5) && a11 <= 0) && a26 == 1)) || (((((a3 <= 0 && 1 == a5) && a12 == 1) && !(a27 == 1)) && a11 <= 0) && a16 == 1)) || (((((1 == a3 && 1 == a5) && 1 == a6) && a12 == 1) && a11 == 1) && a16 == 1)) || (((1 == a5 && 1 == a3) && a12 == 1) && a11 <= 0)) || (((1 == a5 && a27 == 1) && a12 == 1) && a11 <= 0)) || (((1 == a5 && 1 == a6) && a11 <= 0) && a26 == 1)) || (((!(0 == a3) && a6 <= 0) && 1 == a5) && a11 == 1)) || (((1 == a5 && a27 == 1) && a11 <= 0) && a20 <= 0)) || (((((a6 <= 0 && a10 == 1) && 1 == a5) && a12 == 1) && a11 == 1) && a26 == 1)) || (((1 == a5 && 1 == a3) && a11 <= 0) && a20 <= 0)) || (((a3 <= 0 && a27 == 1) && 1 == a5) && a11 <= 0)) || ((((!(0 == a3) && 1 == a5) && a12 == 1) && a11 <= 0) && a26 == 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 302 locations, 1 error locations. Result: SAFE, OverallTime: 53.3s, OverallIterations: 15, TraceHistogramMax: 6, AutomataDifference: 22.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 12.5s, HoareTripleCheckerStatistics: 2820 SDtfs, 4930 SDslu, 1073 SDs, 0 SdLazy, 10499 SolverSat, 1911 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 14.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 960 GetRequests, 930 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=138830occurred 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.9s AutomataMinimizationTime, 15 MinimizatonAttempts, 11330 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 1712 NumberOfFragments, 509 HoareAnnotationTreeSize, 3 FomulaSimplifications, 46046 FormulaSimplificationTreeSizeReduction, 5.9s HoareSimplificationTime, 3 FomulaSimplificationsInter, 22536 FormulaSimplificationTreeSizeReductionInter, 6.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.7s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 4658 NumberOfCodeBlocks, 4658 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 4640 ConstructedInterpolants, 0 QuantifiedInterpolants, 2137200 SizeOfPredicates, 2 NumberOfNonLiveVariables, 1698 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 18 InterpolantComputations, 15 PerfectInterpolantSequences, 2479/2493 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...