/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem01_label04.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 20:51:13,337 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 20:51:13,340 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 20:51:13,357 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 20:51:13,358 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 20:51:13,360 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 20:51:13,362 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 20:51:13,375 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 20:51:13,377 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 20:51:13,377 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 20:51:13,380 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 20:51:13,382 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 20:51:13,382 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 20:51:13,386 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 20:51:13,387 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 20:51:13,389 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 20:51:13,391 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 20:51:13,393 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 20:51:13,395 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 20:51:13,400 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 20:51:13,404 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 20:51:13,405 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 20:51:13,406 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 20:51:13,409 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 20:51:13,412 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 20:51:13,412 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 20:51:13,412 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 20:51:13,414 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 20:51:13,415 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 20:51:13,417 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 20:51:13,417 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 20:51:13,418 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 20:51:13,418 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 20:51:13,419 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 20:51:13,421 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 20:51:13,421 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 20:51:13,422 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 20:51:13,422 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 20:51:13,422 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 20:51:13,424 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 20:51:13,425 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 20:51:13,426 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-23 20:51:13,444 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 20:51:13,444 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 20:51:13,446 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-23 20:51:13,446 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-23 20:51:13,447 INFO L138 SettingsManager]: * Use SBE=true [2019-11-23 20:51:13,447 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 20:51:13,447 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 20:51:13,447 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 20:51:13,447 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 20:51:13,448 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 20:51:13,449 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 20:51:13,449 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 20:51:13,449 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 20:51:13,449 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-23 20:51:13,450 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 20:51:13,450 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 20:51:13,450 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-23 20:51:13,450 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 20:51:13,450 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 20:51:13,451 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-23 20:51:13,451 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 20:51:13,451 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 20:51:13,451 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 20:51:13,452 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 20:51:13,452 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 20:51:13,453 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 20:51:13,453 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-23 20:51:13,453 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 20:51:13,453 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 20:51:13,453 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 20:51:13,731 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 20:51:13,745 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 20:51:13,749 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 20:51:13,750 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 20:51:13,750 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 20:51:13,751 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label04.c [2019-11-23 20:51:13,823 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0e174ce6/8654a804d5f34d6dacddd415c89295d4/FLAG71bff592d [2019-11-23 20:51:14,409 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 20:51:14,409 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label04.c [2019-11-23 20:51:14,423 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0e174ce6/8654a804d5f34d6dacddd415c89295d4/FLAG71bff592d [2019-11-23 20:51:14,778 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0e174ce6/8654a804d5f34d6dacddd415c89295d4 [2019-11-23 20:51:14,786 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 20:51:14,788 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 20:51:14,789 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 20:51:14,789 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 20:51:14,793 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 20:51:14,794 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:51:14" (1/1) ... [2019-11-23 20:51:14,797 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3764c2d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:51:14, skipping insertion in model container [2019-11-23 20:51:14,797 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:51:14" (1/1) ... [2019-11-23 20:51:14,804 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 20:51:14,869 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 20:51:15,354 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 20:51:15,359 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 20:51:15,481 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 20:51:15,500 INFO L208 MainTranslator]: Completed translation [2019-11-23 20:51:15,500 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:51:15 WrapperNode [2019-11-23 20:51:15,501 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 20:51:15,501 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 20:51:15,502 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 20:51:15,502 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 20:51:15,511 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:51:15" (1/1) ... [2019-11-23 20:51:15,535 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:51:15" (1/1) ... [2019-11-23 20:51:15,600 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 20:51:15,600 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 20:51:15,600 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 20:51:15,601 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 20:51:15,610 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:51:15" (1/1) ... [2019-11-23 20:51:15,611 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:51:15" (1/1) ... [2019-11-23 20:51:15,614 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:51:15" (1/1) ... [2019-11-23 20:51:15,614 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:51:15" (1/1) ... [2019-11-23 20:51:15,634 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:51:15" (1/1) ... [2019-11-23 20:51:15,659 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:51:15" (1/1) ... [2019-11-23 20:51:15,663 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:51:15" (1/1) ... [2019-11-23 20:51:15,670 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 20:51:15,670 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 20:51:15,671 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 20:51:15,671 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 20:51:15,672 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:51:15" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 20:51:15,762 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 20:51:15,762 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 20:51:16,915 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 20:51:16,916 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-23 20:51:16,917 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:51:16 BoogieIcfgContainer [2019-11-23 20:51:16,917 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 20:51:16,918 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 20:51:16,918 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 20:51:16,921 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 20:51:16,922 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 08:51:14" (1/3) ... [2019-11-23 20:51:16,923 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6352e6d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:51:16, skipping insertion in model container [2019-11-23 20:51:16,923 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:51:15" (2/3) ... [2019-11-23 20:51:16,923 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6352e6d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:51:16, skipping insertion in model container [2019-11-23 20:51:16,923 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:51:16" (3/3) ... [2019-11-23 20:51:16,925 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem01_label04.c [2019-11-23 20:51:16,934 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 20:51:16,942 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 20:51:16,953 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 20:51:16,979 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 20:51:16,979 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 20:51:16,979 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 20:51:16,979 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 20:51:16,979 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 20:51:16,980 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 20:51:16,980 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 20:51:16,980 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 20:51:16,999 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states. [2019-11-23 20:51:17,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-23 20:51:17,008 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:51:17,010 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] [2019-11-23 20:51:17,010 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:51:17,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:51:17,016 INFO L82 PathProgramCache]: Analyzing trace with hash 857742575, now seen corresponding path program 1 times [2019-11-23 20:51:17,025 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:51:17,025 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456671201] [2019-11-23 20:51:17,026 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:51:17,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:51:17,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:51:17,492 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456671201] [2019-11-23 20:51:17,493 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:51:17,494 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:51:17,496 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797085257] [2019-11-23 20:51:17,504 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 20:51:17,504 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:51:17,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 20:51:17,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:51:17,521 INFO L87 Difference]: Start difference. First operand 198 states. Second operand 4 states. [2019-11-23 20:51:18,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:51:18,905 INFO L93 Difference]: Finished difference Result 662 states and 1178 transitions. [2019-11-23 20:51:18,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 20:51:18,908 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2019-11-23 20:51:18,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:51:18,927 INFO L225 Difference]: With dead ends: 662 [2019-11-23 20:51:18,927 INFO L226 Difference]: Without dead ends: 397 [2019-11-23 20:51:18,932 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:51:18,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2019-11-23 20:51:19,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 397. [2019-11-23 20:51:19,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2019-11-23 20:51:19,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 559 transitions. [2019-11-23 20:51:19,012 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 559 transitions. Word has length 96 [2019-11-23 20:51:19,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:51:19,013 INFO L462 AbstractCegarLoop]: Abstraction has 397 states and 559 transitions. [2019-11-23 20:51:19,013 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 20:51:19,013 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 559 transitions. [2019-11-23 20:51:19,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-11-23 20:51:19,018 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:51:19,019 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:51:19,019 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:51:19,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:51:19,019 INFO L82 PathProgramCache]: Analyzing trace with hash 2104593095, now seen corresponding path program 1 times [2019-11-23 20:51:19,020 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:51:19,020 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522145268] [2019-11-23 20:51:19,020 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:51:19,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:51:19,109 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:51:19,110 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522145268] [2019-11-23 20:51:19,110 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:51:19,110 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:51:19,111 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89872896] [2019-11-23 20:51:19,114 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 20:51:19,114 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:51:19,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 20:51:19,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:51:19,115 INFO L87 Difference]: Start difference. First operand 397 states and 559 transitions. Second operand 4 states. [2019-11-23 20:51:19,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:51:19,713 INFO L93 Difference]: Finished difference Result 1185 states and 1672 transitions. [2019-11-23 20:51:19,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:51:19,713 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2019-11-23 20:51:19,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:51:19,719 INFO L225 Difference]: With dead ends: 1185 [2019-11-23 20:51:19,720 INFO L226 Difference]: Without dead ends: 790 [2019-11-23 20:51:19,725 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:51:19,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2019-11-23 20:51:19,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 790. [2019-11-23 20:51:19,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2019-11-23 20:51:19,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 1066 transitions. [2019-11-23 20:51:19,790 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 1066 transitions. Word has length 101 [2019-11-23 20:51:19,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:51:19,790 INFO L462 AbstractCegarLoop]: Abstraction has 790 states and 1066 transitions. [2019-11-23 20:51:19,791 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 20:51:19,791 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 1066 transitions. [2019-11-23 20:51:19,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-11-23 20:51:19,796 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:51:19,796 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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] [2019-11-23 20:51:19,797 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:51:19,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:51:19,797 INFO L82 PathProgramCache]: Analyzing trace with hash -2133421455, now seen corresponding path program 1 times [2019-11-23 20:51:19,797 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:51:19,798 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473380574] [2019-11-23 20:51:19,798 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:51:19,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:51:19,934 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-23 20:51:19,935 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473380574] [2019-11-23 20:51:19,936 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:51:19,936 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 20:51:19,937 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214702292] [2019-11-23 20:51:19,938 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:51:19,939 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:51:19,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:51:19,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:51:19,940 INFO L87 Difference]: Start difference. First operand 790 states and 1066 transitions. Second operand 3 states. [2019-11-23 20:51:20,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:51:20,494 INFO L93 Difference]: Finished difference Result 1971 states and 2686 transitions. [2019-11-23 20:51:20,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:51:20,494 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 122 [2019-11-23 20:51:20,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:51:20,500 INFO L225 Difference]: With dead ends: 1971 [2019-11-23 20:51:20,500 INFO L226 Difference]: Without dead ends: 1183 [2019-11-23 20:51:20,502 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:51:20,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1183 states. [2019-11-23 20:51:20,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1183 to 921. [2019-11-23 20:51:20,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 921 states. [2019-11-23 20:51:20,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 921 states to 921 states and 1246 transitions. [2019-11-23 20:51:20,527 INFO L78 Accepts]: Start accepts. Automaton has 921 states and 1246 transitions. Word has length 122 [2019-11-23 20:51:20,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:51:20,528 INFO L462 AbstractCegarLoop]: Abstraction has 921 states and 1246 transitions. [2019-11-23 20:51:20,528 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:51:20,528 INFO L276 IsEmpty]: Start isEmpty. Operand 921 states and 1246 transitions. [2019-11-23 20:51:20,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-11-23 20:51:20,531 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:51:20,532 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:51:20,532 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:51:20,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:51:20,532 INFO L82 PathProgramCache]: Analyzing trace with hash -1539851884, now seen corresponding path program 1 times [2019-11-23 20:51:20,533 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:51:20,533 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810820282] [2019-11-23 20:51:20,533 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:51:20,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:51:20,623 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-11-23 20:51:20,624 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810820282] [2019-11-23 20:51:20,624 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:51:20,624 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 20:51:20,625 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568763682] [2019-11-23 20:51:20,625 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:51:20,626 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:51:20,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:51:20,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:51:20,626 INFO L87 Difference]: Start difference. First operand 921 states and 1246 transitions. Second operand 3 states. [2019-11-23 20:51:21,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:51:21,123 INFO L93 Difference]: Finished difference Result 2233 states and 2997 transitions. [2019-11-23 20:51:21,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:51:21,124 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 158 [2019-11-23 20:51:21,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:51:21,130 INFO L225 Difference]: With dead ends: 2233 [2019-11-23 20:51:21,130 INFO L226 Difference]: Without dead ends: 1314 [2019-11-23 20:51:21,132 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:51:21,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1314 states. [2019-11-23 20:51:21,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1314 to 1183. [2019-11-23 20:51:21,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1183 states. [2019-11-23 20:51:21,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1183 states to 1183 states and 1508 transitions. [2019-11-23 20:51:21,158 INFO L78 Accepts]: Start accepts. Automaton has 1183 states and 1508 transitions. Word has length 158 [2019-11-23 20:51:21,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:51:21,158 INFO L462 AbstractCegarLoop]: Abstraction has 1183 states and 1508 transitions. [2019-11-23 20:51:21,158 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:51:21,158 INFO L276 IsEmpty]: Start isEmpty. Operand 1183 states and 1508 transitions. [2019-11-23 20:51:21,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-11-23 20:51:21,162 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:51:21,162 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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] [2019-11-23 20:51:21,162 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:51:21,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:51:21,163 INFO L82 PathProgramCache]: Analyzing trace with hash 2022693764, now seen corresponding path program 1 times [2019-11-23 20:51:21,163 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:51:21,163 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847831612] [2019-11-23 20:51:21,164 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:51:21,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:51:21,242 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-11-23 20:51:21,242 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847831612] [2019-11-23 20:51:21,242 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:51:21,242 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 20:51:21,243 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231129960] [2019-11-23 20:51:21,243 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:51:21,244 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:51:21,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:51:21,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:51:21,244 INFO L87 Difference]: Start difference. First operand 1183 states and 1508 transitions. Second operand 3 states. [2019-11-23 20:51:21,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:51:21,748 INFO L93 Difference]: Finished difference Result 3150 states and 4004 transitions. [2019-11-23 20:51:21,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:51:21,749 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 177 [2019-11-23 20:51:21,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:51:21,757 INFO L225 Difference]: With dead ends: 3150 [2019-11-23 20:51:21,758 INFO L226 Difference]: Without dead ends: 1969 [2019-11-23 20:51:21,760 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:51:21,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1969 states. [2019-11-23 20:51:21,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1969 to 1576. [2019-11-23 20:51:21,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2019-11-23 20:51:21,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 1990 transitions. [2019-11-23 20:51:21,797 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 1990 transitions. Word has length 177 [2019-11-23 20:51:21,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:51:21,798 INFO L462 AbstractCegarLoop]: Abstraction has 1576 states and 1990 transitions. [2019-11-23 20:51:21,798 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:51:21,798 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 1990 transitions. [2019-11-23 20:51:21,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-11-23 20:51:21,803 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:51:21,803 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:51:21,803 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:51:21,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:51:21,804 INFO L82 PathProgramCache]: Analyzing trace with hash -442422933, now seen corresponding path program 1 times [2019-11-23 20:51:21,804 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:51:21,804 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903825208] [2019-11-23 20:51:21,804 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:51:21,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:51:21,880 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2019-11-23 20:51:21,880 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903825208] [2019-11-23 20:51:21,880 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:51:21,881 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 20:51:21,881 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109536425] [2019-11-23 20:51:21,881 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:51:21,882 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:51:21,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:51:21,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:51:21,882 INFO L87 Difference]: Start difference. First operand 1576 states and 1990 transitions. Second operand 3 states. [2019-11-23 20:51:22,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:51:22,362 INFO L93 Difference]: Finished difference Result 3412 states and 4294 transitions. [2019-11-23 20:51:22,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:51:22,362 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 180 [2019-11-23 20:51:22,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:51:22,371 INFO L225 Difference]: With dead ends: 3412 [2019-11-23 20:51:22,371 INFO L226 Difference]: Without dead ends: 1838 [2019-11-23 20:51:22,374 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:51:22,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1838 states. [2019-11-23 20:51:22,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1838 to 1838. [2019-11-23 20:51:22,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1838 states. [2019-11-23 20:51:22,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 2270 transitions. [2019-11-23 20:51:22,438 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 2270 transitions. Word has length 180 [2019-11-23 20:51:22,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:51:22,438 INFO L462 AbstractCegarLoop]: Abstraction has 1838 states and 2270 transitions. [2019-11-23 20:51:22,438 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:51:22,438 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 2270 transitions. [2019-11-23 20:51:22,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-11-23 20:51:22,443 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:51:22,443 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:51:22,443 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:51:22,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:51:22,444 INFO L82 PathProgramCache]: Analyzing trace with hash 570545059, now seen corresponding path program 1 times [2019-11-23 20:51:22,444 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:51:22,444 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301706949] [2019-11-23 20:51:22,445 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:51:22,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:51:22,647 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2019-11-23 20:51:22,647 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301706949] [2019-11-23 20:51:22,648 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:51:22,648 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-23 20:51:22,648 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759903043] [2019-11-23 20:51:22,649 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-23 20:51:22,649 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:51:22,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-23 20:51:22,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-11-23 20:51:22,650 INFO L87 Difference]: Start difference. First operand 1838 states and 2270 transitions. Second operand 8 states. [2019-11-23 20:51:23,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:51:23,946 INFO L93 Difference]: Finished difference Result 3841 states and 4711 transitions. [2019-11-23 20:51:23,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-23 20:51:23,947 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 184 [2019-11-23 20:51:23,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:51:23,959 INFO L225 Difference]: With dead ends: 3841 [2019-11-23 20:51:23,959 INFO L226 Difference]: Without dead ends: 2005 [2019-11-23 20:51:23,963 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-11-23 20:51:23,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2005 states. [2019-11-23 20:51:24,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2005 to 1838. [2019-11-23 20:51:24,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1838 states. [2019-11-23 20:51:24,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 2258 transitions. [2019-11-23 20:51:24,013 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 2258 transitions. Word has length 184 [2019-11-23 20:51:24,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:51:24,014 INFO L462 AbstractCegarLoop]: Abstraction has 1838 states and 2258 transitions. [2019-11-23 20:51:24,014 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-23 20:51:24,014 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 2258 transitions. [2019-11-23 20:51:24,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-11-23 20:51:24,021 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:51:24,021 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:51:24,021 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:51:24,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:51:24,022 INFO L82 PathProgramCache]: Analyzing trace with hash 540380915, now seen corresponding path program 1 times [2019-11-23 20:51:24,022 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:51:24,023 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737755713] [2019-11-23 20:51:24,024 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:51:24,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:51:24,214 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 205 proven. 0 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-11-23 20:51:24,215 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737755713] [2019-11-23 20:51:24,215 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:51:24,215 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 20:51:24,215 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572200468] [2019-11-23 20:51:24,216 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 20:51:24,216 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:51:24,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 20:51:24,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:51:24,217 INFO L87 Difference]: Start difference. First operand 1838 states and 2258 transitions. Second operand 4 states. [2019-11-23 20:51:25,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:51:25,098 INFO L93 Difference]: Finished difference Result 3936 states and 4836 transitions. [2019-11-23 20:51:25,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 20:51:25,099 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 217 [2019-11-23 20:51:25,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:51:25,108 INFO L225 Difference]: With dead ends: 3936 [2019-11-23 20:51:25,108 INFO L226 Difference]: Without dead ends: 2100 [2019-11-23 20:51:25,111 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:51:25,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2100 states. [2019-11-23 20:51:25,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2100 to 1969. [2019-11-23 20:51:25,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1969 states. [2019-11-23 20:51:25,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1969 states to 1969 states and 2323 transitions. [2019-11-23 20:51:25,149 INFO L78 Accepts]: Start accepts. Automaton has 1969 states and 2323 transitions. Word has length 217 [2019-11-23 20:51:25,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:51:25,149 INFO L462 AbstractCegarLoop]: Abstraction has 1969 states and 2323 transitions. [2019-11-23 20:51:25,149 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 20:51:25,150 INFO L276 IsEmpty]: Start isEmpty. Operand 1969 states and 2323 transitions. [2019-11-23 20:51:25,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2019-11-23 20:51:25,156 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:51:25,156 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-23 20:51:25,156 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:51:25,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:51:25,157 INFO L82 PathProgramCache]: Analyzing trace with hash 1041196455, now seen corresponding path program 1 times [2019-11-23 20:51:25,157 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:51:25,157 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378253170] [2019-11-23 20:51:25,157 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:51:25,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:51:25,314 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 246 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-11-23 20:51:25,315 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378253170] [2019-11-23 20:51:25,315 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:51:25,315 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 20:51:25,322 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010162480] [2019-11-23 20:51:25,323 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 20:51:25,323 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:51:25,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 20:51:25,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:51:25,325 INFO L87 Difference]: Start difference. First operand 1969 states and 2323 transitions. Second operand 4 states. [2019-11-23 20:51:26,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:51:26,029 INFO L93 Difference]: Finished difference Result 4460 states and 5222 transitions. [2019-11-23 20:51:26,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 20:51:26,030 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 243 [2019-11-23 20:51:26,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:51:26,040 INFO L225 Difference]: With dead ends: 4460 [2019-11-23 20:51:26,040 INFO L226 Difference]: Without dead ends: 2493 [2019-11-23 20:51:26,043 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:51:26,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2493 states. [2019-11-23 20:51:26,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2493 to 1969. [2019-11-23 20:51:26,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1969 states. [2019-11-23 20:51:26,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1969 states to 1969 states and 2311 transitions. [2019-11-23 20:51:26,078 INFO L78 Accepts]: Start accepts. Automaton has 1969 states and 2311 transitions. Word has length 243 [2019-11-23 20:51:26,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:51:26,079 INFO L462 AbstractCegarLoop]: Abstraction has 1969 states and 2311 transitions. [2019-11-23 20:51:26,079 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 20:51:26,079 INFO L276 IsEmpty]: Start isEmpty. Operand 1969 states and 2311 transitions. [2019-11-23 20:51:26,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2019-11-23 20:51:26,085 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:51:26,086 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:51:26,086 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:51:26,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:51:26,086 INFO L82 PathProgramCache]: Analyzing trace with hash -1832313326, now seen corresponding path program 1 times [2019-11-23 20:51:26,086 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:51:26,087 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137286877] [2019-11-23 20:51:26,087 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:51:26,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:51:26,286 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 275 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2019-11-23 20:51:26,286 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137286877] [2019-11-23 20:51:26,287 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:51:26,287 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-23 20:51:26,287 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874575419] [2019-11-23 20:51:26,288 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-23 20:51:26,289 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:51:26,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-23 20:51:26,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-23 20:51:26,290 INFO L87 Difference]: Start difference. First operand 1969 states and 2311 transitions. Second operand 6 states. [2019-11-23 20:51:27,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:51:27,287 INFO L93 Difference]: Finished difference Result 4105 states and 4795 transitions. [2019-11-23 20:51:27,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 20:51:27,287 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 264 [2019-11-23 20:51:27,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:51:27,296 INFO L225 Difference]: With dead ends: 4105 [2019-11-23 20:51:27,296 INFO L226 Difference]: Without dead ends: 2138 [2019-11-23 20:51:27,299 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-23 20:51:27,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2138 states. [2019-11-23 20:51:27,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2138 to 1838. [2019-11-23 20:51:27,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1838 states. [2019-11-23 20:51:27,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 2102 transitions. [2019-11-23 20:51:27,373 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 2102 transitions. Word has length 264 [2019-11-23 20:51:27,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:51:27,373 INFO L462 AbstractCegarLoop]: Abstraction has 1838 states and 2102 transitions. [2019-11-23 20:51:27,373 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-23 20:51:27,374 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 2102 transitions. [2019-11-23 20:51:27,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2019-11-23 20:51:27,380 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:51:27,380 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:51:27,381 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:51:27,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:51:27,381 INFO L82 PathProgramCache]: Analyzing trace with hash 1089791849, now seen corresponding path program 1 times [2019-11-23 20:51:27,381 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:51:27,382 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175634546] [2019-11-23 20:51:27,382 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:51:27,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:51:28,372 INFO L134 CoverageAnalysis]: Checked inductivity of 467 backedges. 351 proven. 8 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2019-11-23 20:51:28,373 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175634546] [2019-11-23 20:51:28,373 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [23061745] [2019-11-23 20:51:28,373 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:51:28,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:51:28,506 INFO L255 TraceCheckSpWp]: Trace formula consists of 517 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-23 20:51:28,521 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:51:28,641 INFO L134 CoverageAnalysis]: Checked inductivity of 467 backedges. 291 proven. 0 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2019-11-23 20:51:28,642 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-23 20:51:28,642 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [12] total 14 [2019-11-23 20:51:28,643 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419320823] [2019-11-23 20:51:28,643 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:51:28,643 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:51:28,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:51:28,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2019-11-23 20:51:28,644 INFO L87 Difference]: Start difference. First operand 1838 states and 2102 transitions. Second operand 3 states. [2019-11-23 20:51:29,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:51:29,203 INFO L93 Difference]: Finished difference Result 3672 states and 4201 transitions. [2019-11-23 20:51:29,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:51:29,204 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 286 [2019-11-23 20:51:29,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:51:29,204 INFO L225 Difference]: With dead ends: 3672 [2019-11-23 20:51:29,205 INFO L226 Difference]: Without dead ends: 0 [2019-11-23 20:51:29,208 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 290 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2019-11-23 20:51:29,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-23 20:51:29,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-23 20:51:29,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-23 20:51:29,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-23 20:51:29,209 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 286 [2019-11-23 20:51:29,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:51:29,209 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-23 20:51:29,209 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:51:29,209 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-23 20:51:29,209 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-23 20:51:29,420 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:51:29,426 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-23 20:51:29,657 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 76 [2019-11-23 20:51:30,024 WARN L192 SmtUtils]: Spent 364.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 34 [2019-11-23 20:51:30,338 WARN L192 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 34 [2019-11-23 20:51:30,341 INFO L444 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2019-11-23 20:51:30,341 INFO L444 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2019-11-23 20:51:30,341 INFO L444 ceAbstractionStarter]: For program point L565-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:30,341 INFO L444 ceAbstractionStarter]: For program point L532-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:30,341 INFO L444 ceAbstractionStarter]: For program point L499-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:30,342 INFO L444 ceAbstractionStarter]: For program point L466-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:30,342 INFO L444 ceAbstractionStarter]: For program point L433-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:30,342 INFO L444 ceAbstractionStarter]: For program point L400-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:30,342 INFO L444 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2019-11-23 20:51:30,342 INFO L444 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2019-11-23 20:51:30,342 INFO L444 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2019-11-23 20:51:30,342 INFO L444 ceAbstractionStarter]: For program point L533(line 533) no Hoare annotation was computed. [2019-11-23 20:51:30,342 INFO L444 ceAbstractionStarter]: For program point L500(line 500) no Hoare annotation was computed. [2019-11-23 20:51:30,342 INFO L444 ceAbstractionStarter]: For program point L467(line 467) no Hoare annotation was computed. [2019-11-23 20:51:30,343 INFO L444 ceAbstractionStarter]: For program point L434(line 434) no Hoare annotation was computed. [2019-11-23 20:51:30,343 INFO L444 ceAbstractionStarter]: For program point L401(line 401) no Hoare annotation was computed. [2019-11-23 20:51:30,343 INFO L444 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2019-11-23 20:51:30,343 INFO L444 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2019-11-23 20:51:30,344 INFO L444 ceAbstractionStarter]: For program point L568-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:30,344 INFO L444 ceAbstractionStarter]: For program point L535-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:30,344 INFO L444 ceAbstractionStarter]: For program point L502-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:30,344 INFO L444 ceAbstractionStarter]: For program point L469-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:30,344 INFO L444 ceAbstractionStarter]: For program point L436-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:30,344 INFO L444 ceAbstractionStarter]: For program point L403-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:30,344 INFO L444 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2019-11-23 20:51:30,344 INFO L444 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2019-11-23 20:51:30,345 INFO L444 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2019-11-23 20:51:30,349 INFO L444 ceAbstractionStarter]: For program point L536(line 536) no Hoare annotation was computed. [2019-11-23 20:51:30,350 INFO L444 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2019-11-23 20:51:30,350 INFO L444 ceAbstractionStarter]: For program point L470(line 470) no Hoare annotation was computed. [2019-11-23 20:51:30,350 INFO L444 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2019-11-23 20:51:30,350 INFO L444 ceAbstractionStarter]: For program point L404(line 404) no Hoare annotation was computed. [2019-11-23 20:51:30,350 INFO L444 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2019-11-23 20:51:30,350 INFO L444 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2019-11-23 20:51:30,350 INFO L444 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2019-11-23 20:51:30,350 INFO L444 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2019-11-23 20:51:30,351 INFO L444 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2019-11-23 20:51:30,351 INFO L444 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2019-11-23 20:51:30,351 INFO L444 ceAbstractionStarter]: For program point L571-1(lines 571 573) no Hoare annotation was computed. [2019-11-23 20:51:30,351 INFO L444 ceAbstractionStarter]: For program point L538-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:30,351 INFO L444 ceAbstractionStarter]: For program point L505-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:30,351 INFO L444 ceAbstractionStarter]: For program point L472-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:30,351 INFO L444 ceAbstractionStarter]: For program point L439-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:30,351 INFO L444 ceAbstractionStarter]: For program point L406-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:30,351 INFO L444 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2019-11-23 20:51:30,353 INFO L444 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2019-11-23 20:51:30,353 INFO L444 ceAbstractionStarter]: For program point L572(line 572) no Hoare annotation was computed. [2019-11-23 20:51:30,353 INFO L444 ceAbstractionStarter]: For program point L539(line 539) no Hoare annotation was computed. [2019-11-23 20:51:30,353 INFO L444 ceAbstractionStarter]: For program point L506(line 506) no Hoare annotation was computed. [2019-11-23 20:51:30,353 INFO L444 ceAbstractionStarter]: For program point L473(line 473) no Hoare annotation was computed. [2019-11-23 20:51:30,353 INFO L444 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2019-11-23 20:51:30,353 INFO L444 ceAbstractionStarter]: For program point L407(line 407) no Hoare annotation was computed. [2019-11-23 20:51:30,354 INFO L444 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2019-11-23 20:51:30,354 INFO L440 ceAbstractionStarter]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse3 (= ~a16~0 6)) (.cse4 (not (= 1 ~a7~0))) (.cse2 (= ~a16~0 4)) (.cse0 (= ~a21~0 1)) (.cse1 (<= ~a21~0 0)) (.cse5 (= ~a17~0 1))) (or (and .cse0 (= ~a16~0 5)) (and .cse1 .cse2 (<= ~a17~0 0)) (and .cse1 .cse3) (and .cse4 .cse0 (= 15 ~a8~0) .cse3) (and (not .cse3) .cse4 .cse5 .cse0) (and .cse2 .cse0 (not .cse5)) (and .cse5 .cse0 (= ~a20~0 1)) (and .cse1 .cse5))) [2019-11-23 20:51:30,354 INFO L444 ceAbstractionStarter]: For program point L541-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:30,354 INFO L444 ceAbstractionStarter]: For program point L508-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:30,354 INFO L444 ceAbstractionStarter]: For program point L475-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:30,355 INFO L444 ceAbstractionStarter]: For program point L442-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:30,355 INFO L444 ceAbstractionStarter]: For program point L409-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:30,355 INFO L444 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2019-11-23 20:51:30,355 INFO L444 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2019-11-23 20:51:30,355 INFO L444 ceAbstractionStarter]: For program point L509(line 509) no Hoare annotation was computed. [2019-11-23 20:51:30,355 INFO L444 ceAbstractionStarter]: For program point L476(line 476) no Hoare annotation was computed. [2019-11-23 20:51:30,355 INFO L444 ceAbstractionStarter]: For program point L443(line 443) no Hoare annotation was computed. [2019-11-23 20:51:30,355 INFO L444 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2019-11-23 20:51:30,356 INFO L444 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2019-11-23 20:51:30,356 INFO L444 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2019-11-23 20:51:30,356 INFO L444 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2019-11-23 20:51:30,356 INFO L444 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2019-11-23 20:51:30,356 INFO L444 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2019-11-23 20:51:30,356 INFO L444 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2019-11-23 20:51:30,356 INFO L444 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2019-11-23 20:51:30,356 INFO L447 ceAbstractionStarter]: At program point L577(lines 577 594) the Hoare annotation is: true [2019-11-23 20:51:30,357 INFO L444 ceAbstractionStarter]: For program point L544-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:30,357 INFO L444 ceAbstractionStarter]: For program point L511-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:30,357 INFO L444 ceAbstractionStarter]: For program point L478-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:30,357 INFO L444 ceAbstractionStarter]: For program point L445-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:30,357 INFO L444 ceAbstractionStarter]: For program point L412-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:30,357 INFO L444 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2019-11-23 20:51:30,357 INFO L444 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2019-11-23 20:51:30,358 INFO L444 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2019-11-23 20:51:30,358 INFO L444 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2019-11-23 20:51:30,358 INFO L444 ceAbstractionStarter]: For program point L512(line 512) no Hoare annotation was computed. [2019-11-23 20:51:30,358 INFO L444 ceAbstractionStarter]: For program point L479(line 479) no Hoare annotation was computed. [2019-11-23 20:51:30,358 INFO L444 ceAbstractionStarter]: For program point L446(line 446) no Hoare annotation was computed. [2019-11-23 20:51:30,358 INFO L444 ceAbstractionStarter]: For program point L413(line 413) no Hoare annotation was computed. [2019-11-23 20:51:30,358 INFO L444 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2019-11-23 20:51:30,358 INFO L444 ceAbstractionStarter]: For program point L547-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:30,359 INFO L444 ceAbstractionStarter]: For program point L514-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:30,359 INFO L444 ceAbstractionStarter]: For program point L481-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:30,359 INFO L444 ceAbstractionStarter]: For program point L448-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:30,359 INFO L444 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2019-11-23 20:51:30,359 INFO L444 ceAbstractionStarter]: For program point L415-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:30,359 INFO L444 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2019-11-23 20:51:30,359 INFO L444 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2019-11-23 20:51:30,361 INFO L444 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2019-11-23 20:51:30,361 INFO L444 ceAbstractionStarter]: For program point L515(line 515) no Hoare annotation was computed. [2019-11-23 20:51:30,361 INFO L444 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2019-11-23 20:51:30,361 INFO L444 ceAbstractionStarter]: For program point L449(line 449) no Hoare annotation was computed. [2019-11-23 20:51:30,361 INFO L444 ceAbstractionStarter]: For program point L416(line 416) no Hoare annotation was computed. [2019-11-23 20:51:30,361 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-23 20:51:30,361 INFO L444 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2019-11-23 20:51:30,361 INFO L444 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2019-11-23 20:51:30,362 INFO L444 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2019-11-23 20:51:30,362 INFO L444 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2019-11-23 20:51:30,362 INFO L444 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2019-11-23 20:51:30,362 INFO L444 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2019-11-23 20:51:30,362 INFO L444 ceAbstractionStarter]: For program point L550-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:30,362 INFO L440 ceAbstractionStarter]: At program point L583-2(lines 583 593) the Hoare annotation is: (let ((.cse3 (= ~a16~0 6)) (.cse4 (not (= 1 ~a7~0))) (.cse2 (= ~a16~0 4)) (.cse0 (= ~a21~0 1)) (.cse1 (<= ~a21~0 0)) (.cse5 (= ~a17~0 1))) (or (and .cse0 (= ~a16~0 5)) (and .cse1 .cse2 (<= ~a17~0 0)) (and .cse1 .cse3) (and .cse4 .cse0 (= 15 ~a8~0) .cse3) (and (not .cse3) .cse4 .cse5 .cse0) (and .cse2 .cse0 (not .cse5)) (and .cse5 .cse0 (= ~a20~0 1)) (and .cse1 .cse5))) [2019-11-23 20:51:30,362 INFO L444 ceAbstractionStarter]: For program point L517-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:30,363 INFO L444 ceAbstractionStarter]: For program point L484-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:30,363 INFO L444 ceAbstractionStarter]: For program point L451-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:30,363 INFO L444 ceAbstractionStarter]: For program point L418-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:30,363 INFO L444 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2019-11-23 20:51:30,363 INFO L444 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2019-11-23 20:51:30,363 INFO L444 ceAbstractionStarter]: For program point L518(line 518) no Hoare annotation was computed. [2019-11-23 20:51:30,363 INFO L444 ceAbstractionStarter]: For program point L485(line 485) no Hoare annotation was computed. [2019-11-23 20:51:30,363 INFO L444 ceAbstractionStarter]: For program point L452(line 452) no Hoare annotation was computed. [2019-11-23 20:51:30,363 INFO L444 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2019-11-23 20:51:30,363 INFO L444 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2019-11-23 20:51:30,363 INFO L444 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2019-11-23 20:51:30,363 INFO L444 ceAbstractionStarter]: For program point L553-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:30,363 INFO L444 ceAbstractionStarter]: For program point L520-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:30,364 INFO L444 ceAbstractionStarter]: For program point L487-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:30,364 INFO L444 ceAbstractionStarter]: For program point L454-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:30,364 INFO L444 ceAbstractionStarter]: For program point L421-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:30,364 INFO L444 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2019-11-23 20:51:30,364 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-23 20:51:30,364 INFO L444 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2019-11-23 20:51:30,364 INFO L444 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2019-11-23 20:51:30,364 INFO L444 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2019-11-23 20:51:30,364 INFO L444 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2019-11-23 20:51:30,364 INFO L444 ceAbstractionStarter]: For program point L521(line 521) no Hoare annotation was computed. [2019-11-23 20:51:30,364 INFO L444 ceAbstractionStarter]: For program point L488(line 488) no Hoare annotation was computed. [2019-11-23 20:51:30,364 INFO L444 ceAbstractionStarter]: For program point L455(line 455) no Hoare annotation was computed. [2019-11-23 20:51:30,364 INFO L444 ceAbstractionStarter]: For program point L422(line 422) no Hoare annotation was computed. [2019-11-23 20:51:30,364 INFO L444 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2019-11-23 20:51:30,364 INFO L444 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2019-11-23 20:51:30,365 INFO L444 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2019-11-23 20:51:30,365 INFO L444 ceAbstractionStarter]: For program point L556-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:30,365 INFO L444 ceAbstractionStarter]: For program point L523-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:30,365 INFO L444 ceAbstractionStarter]: For program point L490-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:30,365 INFO L444 ceAbstractionStarter]: For program point L457-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:30,365 INFO L444 ceAbstractionStarter]: For program point L391(lines 391 393) no Hoare annotation was computed. [2019-11-23 20:51:30,365 INFO L444 ceAbstractionStarter]: For program point L424-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:30,365 INFO L444 ceAbstractionStarter]: For program point L391-2(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:30,365 INFO L444 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2019-11-23 20:51:30,365 INFO L444 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2019-11-23 20:51:30,365 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-23 20:51:30,365 INFO L444 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2019-11-23 20:51:30,365 INFO L444 ceAbstractionStarter]: For program point L524(line 524) no Hoare annotation was computed. [2019-11-23 20:51:30,365 INFO L444 ceAbstractionStarter]: For program point L491(line 491) no Hoare annotation was computed. [2019-11-23 20:51:30,365 INFO L444 ceAbstractionStarter]: For program point L458(line 458) no Hoare annotation was computed. [2019-11-23 20:51:30,366 INFO L444 ceAbstractionStarter]: For program point L425(line 425) no Hoare annotation was computed. [2019-11-23 20:51:30,366 INFO L444 ceAbstractionStarter]: For program point L392(line 392) no Hoare annotation was computed. [2019-11-23 20:51:30,366 INFO L444 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2019-11-23 20:51:30,366 INFO L444 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2019-11-23 20:51:30,366 INFO L444 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2019-11-23 20:51:30,366 INFO L444 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2019-11-23 20:51:30,366 INFO L444 ceAbstractionStarter]: For program point L559-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:30,366 INFO L444 ceAbstractionStarter]: For program point L526-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:30,366 INFO L444 ceAbstractionStarter]: For program point L493-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:30,366 INFO L444 ceAbstractionStarter]: For program point L460-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:30,366 INFO L444 ceAbstractionStarter]: For program point L427-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:30,366 INFO L444 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2019-11-23 20:51:30,366 INFO L444 ceAbstractionStarter]: For program point L394-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:30,366 INFO L444 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2019-11-23 20:51:30,366 INFO L444 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2019-11-23 20:51:30,367 INFO L444 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2019-11-23 20:51:30,367 INFO L444 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2019-11-23 20:51:30,367 INFO L444 ceAbstractionStarter]: For program point L494(line 494) no Hoare annotation was computed. [2019-11-23 20:51:30,367 INFO L444 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2019-11-23 20:51:30,367 INFO L444 ceAbstractionStarter]: For program point L428(line 428) no Hoare annotation was computed. [2019-11-23 20:51:30,367 INFO L444 ceAbstractionStarter]: For program point L395(line 395) no Hoare annotation was computed. [2019-11-23 20:51:30,367 INFO L444 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2019-11-23 20:51:30,367 INFO L444 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2019-11-23 20:51:30,367 INFO L444 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2019-11-23 20:51:30,367 INFO L444 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-23 20:51:30,367 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 464) no Hoare annotation was computed. [2019-11-23 20:51:30,367 INFO L444 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2019-11-23 20:51:30,367 INFO L444 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2019-11-23 20:51:30,367 INFO L444 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2019-11-23 20:51:30,368 INFO L444 ceAbstractionStarter]: For program point L562-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:30,368 INFO L444 ceAbstractionStarter]: For program point L529-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:30,368 INFO L444 ceAbstractionStarter]: For program point L496-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:30,368 INFO L444 ceAbstractionStarter]: For program point L463-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:30,368 INFO L444 ceAbstractionStarter]: For program point L430-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:30,368 INFO L444 ceAbstractionStarter]: For program point L397-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:30,368 INFO L444 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2019-11-23 20:51:30,368 INFO L444 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2019-11-23 20:51:30,368 INFO L444 ceAbstractionStarter]: For program point L530(line 530) no Hoare annotation was computed. [2019-11-23 20:51:30,368 INFO L444 ceAbstractionStarter]: For program point L497(line 497) no Hoare annotation was computed. [2019-11-23 20:51:30,368 INFO L444 ceAbstractionStarter]: For program point L464(line 464) no Hoare annotation was computed. [2019-11-23 20:51:30,368 INFO L444 ceAbstractionStarter]: For program point L431(line 431) no Hoare annotation was computed. [2019-11-23 20:51:30,369 INFO L444 ceAbstractionStarter]: For program point L398(line 398) no Hoare annotation was computed. [2019-11-23 20:51:30,369 INFO L444 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2019-11-23 20:51:30,369 INFO L444 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2019-11-23 20:51:30,369 INFO L444 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2019-11-23 20:51:30,389 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 08:51:30 BoogieIcfgContainer [2019-11-23 20:51:30,389 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-23 20:51:30,391 INFO L168 Benchmark]: Toolchain (without parser) took 15602.92 ms. Allocated memory was 146.3 MB in the beginning and 486.0 MB in the end (delta: 339.7 MB). Free memory was 102.6 MB in the beginning and 319.3 MB in the end (delta: -216.7 MB). Peak memory consumption was 357.9 MB. Max. memory is 7.1 GB. [2019-11-23 20:51:30,391 INFO L168 Benchmark]: CDTParser took 0.49 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.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-11-23 20:51:30,392 INFO L168 Benchmark]: CACSL2BoogieTranslator took 712.03 ms. Allocated memory was 146.3 MB in the beginning and 203.4 MB in the end (delta: 57.1 MB). Free memory was 102.4 MB in the beginning and 163.9 MB in the end (delta: -61.5 MB). Peak memory consumption was 25.3 MB. Max. memory is 7.1 GB. [2019-11-23 20:51:30,393 INFO L168 Benchmark]: Boogie Procedure Inliner took 98.67 ms. Allocated memory is still 203.4 MB. Free memory was 163.9 MB in the beginning and 157.8 MB in the end (delta: 6.1 MB). Peak memory consumption was 6.1 MB. Max. memory is 7.1 GB. [2019-11-23 20:51:30,394 INFO L168 Benchmark]: Boogie Preprocessor took 69.82 ms. Allocated memory is still 203.4 MB. Free memory was 157.8 MB in the beginning and 153.1 MB in the end (delta: 4.7 MB). Peak memory consumption was 4.7 MB. Max. memory is 7.1 GB. [2019-11-23 20:51:30,395 INFO L168 Benchmark]: RCFGBuilder took 1246.81 ms. Allocated memory was 203.4 MB in the beginning and 239.1 MB in the end (delta: 35.7 MB). Free memory was 153.1 MB in the beginning and 164.3 MB in the end (delta: -11.2 MB). Peak memory consumption was 70.6 MB. Max. memory is 7.1 GB. [2019-11-23 20:51:30,396 INFO L168 Benchmark]: TraceAbstraction took 13470.66 ms. Allocated memory was 239.1 MB in the beginning and 486.0 MB in the end (delta: 246.9 MB). Free memory was 164.3 MB in the beginning and 319.3 MB in the end (delta: -155.0 MB). Peak memory consumption was 326.8 MB. Max. memory is 7.1 GB. [2019-11-23 20:51:30,400 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.49 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.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 712.03 ms. Allocated memory was 146.3 MB in the beginning and 203.4 MB in the end (delta: 57.1 MB). Free memory was 102.4 MB in the beginning and 163.9 MB in the end (delta: -61.5 MB). Peak memory consumption was 25.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 98.67 ms. Allocated memory is still 203.4 MB. Free memory was 163.9 MB in the beginning and 157.8 MB in the end (delta: 6.1 MB). Peak memory consumption was 6.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 69.82 ms. Allocated memory is still 203.4 MB. Free memory was 157.8 MB in the beginning and 153.1 MB in the end (delta: 4.7 MB). Peak memory consumption was 4.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1246.81 ms. Allocated memory was 203.4 MB in the beginning and 239.1 MB in the end (delta: 35.7 MB). Free memory was 153.1 MB in the beginning and 164.3 MB in the end (delta: -11.2 MB). Peak memory consumption was 70.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 13470.66 ms. Allocated memory was 239.1 MB in the beginning and 486.0 MB in the end (delta: 246.9 MB). Free memory was 164.3 MB in the beginning and 319.3 MB in the end (delta: -155.0 MB). Peak memory consumption was 326.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 464]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: (((((((a21 == 1 && a16 == 5) || ((a21 <= 0 && a16 == 4) && a17 <= 0)) || (a21 <= 0 && a16 == 6)) || (((!(1 == a7) && a21 == 1) && 15 == a8) && a16 == 6)) || (((!(a16 == 6) && !(1 == a7)) && a17 == 1) && a21 == 1)) || ((a16 == 4 && a21 == 1) && !(a17 == 1))) || ((a17 == 1 && a21 == 1) && a20 == 1)) || (a21 <= 0 && a17 == 1) - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: (((((((a21 == 1 && a16 == 5) || ((a21 <= 0 && a16 == 4) && a17 <= 0)) || (a21 <= 0 && a16 == 6)) || (((!(1 == a7) && a21 == 1) && 15 == a8) && a16 == 6)) || (((!(a16 == 6) && !(1 == a7)) && a17 == 1) && a21 == 1)) || ((a16 == 4 && a21 == 1) && !(a17 == 1))) || ((a17 == 1 && a21 == 1) && a20 == 1)) || (a21 <= 0 && a17 == 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 198 locations, 1 error locations. Result: SAFE, OverallTime: 13.3s, OverallIterations: 11, TraceHistogramMax: 7, AutomataDifference: 8.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.9s, HoareTripleCheckerStatistics: 951 SDtfs, 2116 SDslu, 125 SDs, 0 SdLazy, 5932 SolverSat, 913 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 343 GetRequests, 304 SyntacticMatches, 5 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1969occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 11 MinimizatonAttempts, 1908 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 34 NumberOfFragments, 165 HoareAnnotationTreeSize, 3 FomulaSimplifications, 8382 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 3 FomulaSimplificationsInter, 2388 FormulaSimplificationTreeSizeReductionInter, 0.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 2314 NumberOfCodeBlocks, 2314 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 2302 ConstructedInterpolants, 0 QuantifiedInterpolants, 1674077 SizeOfPredicates, 1 NumberOfNonLiveVariables, 517 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 12 InterpolantComputations, 11 PerfectInterpolantSequences, 2711/2719 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...