/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/taipan/svcomp-Reach-32bit-Taipan_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem01_label54.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 23:31:39,383 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 23:31:39,386 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 23:31:39,399 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 23:31:39,399 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 23:31:39,400 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 23:31:39,401 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 23:31:39,403 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 23:31:39,405 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 23:31:39,406 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 23:31:39,406 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 23:31:39,408 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 23:31:39,408 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 23:31:39,409 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 23:31:39,410 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 23:31:39,411 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 23:31:39,412 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 23:31:39,413 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 23:31:39,414 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 23:31:39,417 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 23:31:39,418 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 23:31:39,420 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 23:31:39,421 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 23:31:39,421 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 23:31:39,427 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 23:31:39,428 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 23:31:39,428 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 23:31:39,429 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 23:31:39,429 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 23:31:39,430 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 23:31:39,430 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 23:31:39,431 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 23:31:39,432 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 23:31:39,432 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 23:31:39,435 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 23:31:39,438 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 23:31:39,439 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 23:31:39,439 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 23:31:39,440 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 23:31:39,440 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 23:31:39,441 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 23:31:39,445 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf [2019-11-23 23:31:39,471 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 23:31:39,471 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 23:31:39,474 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-23 23:31:39,474 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-23 23:31:39,474 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-23 23:31:39,474 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-23 23:31:39,475 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-23 23:31:39,475 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-23 23:31:39,475 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-23 23:31:39,475 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-23 23:31:39,476 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-23 23:31:39,477 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-23 23:31:39,477 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-23 23:31:39,477 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-23 23:31:39,478 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-23 23:31:39,479 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 23:31:39,479 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 23:31:39,479 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 23:31:39,480 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 23:31:39,480 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 23:31:39,480 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 23:31:39,480 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 23:31:39,481 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 23:31:39,481 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 23:31:39,481 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 23:31:39,481 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 23:31:39,482 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 23:31:39,482 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 23:31:39,483 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 23:31:39,483 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 23:31:39,484 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 23:31:39,484 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 23:31:39,484 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 23:31:39,484 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-23 23:31:39,485 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 23:31:39,485 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 23:31:39,485 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 23:31:39,485 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-11-23 23:31:39,740 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 23:31:39,756 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 23:31:39,760 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 23:31:39,761 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 23:31:39,761 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 23:31:39,762 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label54.c [2019-11-23 23:31:39,821 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4fc66cc3/1c9d19dc1fd64e7f8209d3df40fbd2c6/FLAG83eb21599 [2019-11-23 23:31:40,376 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 23:31:40,377 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label54.c [2019-11-23 23:31:40,391 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4fc66cc3/1c9d19dc1fd64e7f8209d3df40fbd2c6/FLAG83eb21599 [2019-11-23 23:31:40,679 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4fc66cc3/1c9d19dc1fd64e7f8209d3df40fbd2c6 [2019-11-23 23:31:40,687 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 23:31:40,688 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 23:31:40,689 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 23:31:40,689 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 23:31:40,693 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 23:31:40,694 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:31:40" (1/1) ... [2019-11-23 23:31:40,697 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52ffb995 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:31:40, skipping insertion in model container [2019-11-23 23:31:40,697 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:31:40" (1/1) ... [2019-11-23 23:31:40,704 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 23:31:40,761 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 23:31:41,258 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 23:31:41,270 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 23:31:41,377 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 23:31:41,397 INFO L208 MainTranslator]: Completed translation [2019-11-23 23:31:41,397 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:31:41 WrapperNode [2019-11-23 23:31:41,398 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 23:31:41,398 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 23:31:41,399 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 23:31:41,399 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 23:31:41,406 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:31:41" (1/1) ... [2019-11-23 23:31:41,431 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:31:41" (1/1) ... [2019-11-23 23:31:41,499 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 23:31:41,500 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 23:31:41,500 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 23:31:41,500 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 23:31:41,510 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:31:41" (1/1) ... [2019-11-23 23:31:41,510 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:31:41" (1/1) ... [2019-11-23 23:31:41,514 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:31:41" (1/1) ... [2019-11-23 23:31:41,514 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:31:41" (1/1) ... [2019-11-23 23:31:41,536 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:31:41" (1/1) ... [2019-11-23 23:31:41,547 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:31:41" (1/1) ... [2019-11-23 23:31:41,554 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:31:41" (1/1) ... [2019-11-23 23:31:41,562 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 23:31:41,563 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 23:31:41,563 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 23:31:41,563 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 23:31:41,564 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:31:41" (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 23:31:41,652 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 23:31:41,654 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 23:31:43,627 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 23:31:43,627 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-23 23:31:43,628 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:31:43 BoogieIcfgContainer [2019-11-23 23:31:43,628 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 23:31:43,629 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 23:31:43,630 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 23:31:43,633 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 23:31:43,633 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:31:40" (1/3) ... [2019-11-23 23:31:43,634 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@458950f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:31:43, skipping insertion in model container [2019-11-23 23:31:43,634 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:31:41" (2/3) ... [2019-11-23 23:31:43,634 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@458950f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:31:43, skipping insertion in model container [2019-11-23 23:31:43,634 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:31:43" (3/3) ... [2019-11-23 23:31:43,636 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem01_label54.c [2019-11-23 23:31:43,646 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 23:31:43,653 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 23:31:43,665 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 23:31:43,691 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 23:31:43,692 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 23:31:43,692 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 23:31:43,692 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 23:31:43,692 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 23:31:43,693 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 23:31:43,693 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 23:31:43,693 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 23:31:43,711 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states. [2019-11-23 23:31:43,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-23 23:31:43,720 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:31:43,721 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] [2019-11-23 23:31:43,722 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:31:43,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:31:43,728 INFO L82 PathProgramCache]: Analyzing trace with hash -1323231129, now seen corresponding path program 1 times [2019-11-23 23:31:43,737 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:31:43,737 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310352434] [2019-11-23 23:31:43,737 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:31:43,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:31:44,149 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 23:31:44,150 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310352434] [2019-11-23 23:31:44,151 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:31:44,151 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:31:44,153 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327403483] [2019-11-23 23:31:44,161 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:31:44,162 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:31:44,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:31:44,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:31:44,178 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 4 states. [2019-11-23 23:31:45,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:31:45,005 INFO L93 Difference]: Finished difference Result 297 states and 569 transitions. [2019-11-23 23:31:45,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:31:45,007 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 71 [2019-11-23 23:31:45,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:31:45,022 INFO L225 Difference]: With dead ends: 297 [2019-11-23 23:31:45,023 INFO L226 Difference]: Without dead ends: 216 [2019-11-23 23:31:45,026 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 23:31:45,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2019-11-23 23:31:45,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 216. [2019-11-23 23:31:45,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2019-11-23 23:31:45,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 396 transitions. [2019-11-23 23:31:45,081 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 396 transitions. Word has length 71 [2019-11-23 23:31:45,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:31:45,082 INFO L462 AbstractCegarLoop]: Abstraction has 216 states and 396 transitions. [2019-11-23 23:31:45,082 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:31:45,082 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 396 transitions. [2019-11-23 23:31:45,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-23 23:31:45,087 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:31:45,087 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:31:45,087 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:31:45,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:31:45,088 INFO L82 PathProgramCache]: Analyzing trace with hash -1566176309, now seen corresponding path program 1 times [2019-11-23 23:31:45,088 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:31:45,088 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940862982] [2019-11-23 23:31:45,089 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:31:45,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:31:45,148 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:31:45,149 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940862982] [2019-11-23 23:31:45,149 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:31:45,150 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 23:31:45,150 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258096312] [2019-11-23 23:31:45,151 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:31:45,152 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:31:45,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:31:45,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:31:45,153 INFO L87 Difference]: Start difference. First operand 216 states and 396 transitions. Second operand 3 states. [2019-11-23 23:31:45,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:31:45,522 INFO L93 Difference]: Finished difference Result 644 states and 1185 transitions. [2019-11-23 23:31:45,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:31:45,523 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-11-23 23:31:45,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:31:45,527 INFO L225 Difference]: With dead ends: 644 [2019-11-23 23:31:45,527 INFO L226 Difference]: Without dead ends: 429 [2019-11-23 23:31:45,530 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 23:31:45,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2019-11-23 23:31:45,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 358. [2019-11-23 23:31:45,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 358 states. [2019-11-23 23:31:45,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 587 transitions. [2019-11-23 23:31:45,560 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 587 transitions. Word has length 84 [2019-11-23 23:31:45,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:31:45,561 INFO L462 AbstractCegarLoop]: Abstraction has 358 states and 587 transitions. [2019-11-23 23:31:45,561 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:31:45,561 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 587 transitions. [2019-11-23 23:31:45,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-11-23 23:31:45,568 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:31:45,568 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:31:45,569 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:31:45,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:31:45,570 INFO L82 PathProgramCache]: Analyzing trace with hash -81008995, now seen corresponding path program 1 times [2019-11-23 23:31:45,570 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:31:45,572 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654117295] [2019-11-23 23:31:45,572 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:31:45,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:31:45,635 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-23 23:31:45,635 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654117295] [2019-11-23 23:31:45,636 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:31:45,636 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:31:45,637 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531056900] [2019-11-23 23:31:45,638 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:31:45,638 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:31:45,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:31:45,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:31:45,639 INFO L87 Difference]: Start difference. First operand 358 states and 587 transitions. Second operand 4 states. [2019-11-23 23:31:46,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:31:46,304 INFO L93 Difference]: Finished difference Result 1212 states and 2013 transitions. [2019-11-23 23:31:46,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:31:46,304 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 93 [2019-11-23 23:31:46,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:31:46,309 INFO L225 Difference]: With dead ends: 1212 [2019-11-23 23:31:46,309 INFO L226 Difference]: Without dead ends: 855 [2019-11-23 23:31:46,312 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:31:46,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 855 states. [2019-11-23 23:31:46,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 855 to 784. [2019-11-23 23:31:46,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2019-11-23 23:31:46,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 1218 transitions. [2019-11-23 23:31:46,356 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 1218 transitions. Word has length 93 [2019-11-23 23:31:46,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:31:46,357 INFO L462 AbstractCegarLoop]: Abstraction has 784 states and 1218 transitions. [2019-11-23 23:31:46,357 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:31:46,357 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 1218 transitions. [2019-11-23 23:31:46,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-23 23:31:46,363 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:31:46,364 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-23 23:31:46,364 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:31:46,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:31:46,364 INFO L82 PathProgramCache]: Analyzing trace with hash 2009843468, now seen corresponding path program 1 times [2019-11-23 23:31:46,365 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:31:46,365 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330513894] [2019-11-23 23:31:46,365 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:31:46,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:31:46,482 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-23 23:31:46,483 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330513894] [2019-11-23 23:31:46,483 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:31:46,483 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:31:46,483 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804384171] [2019-11-23 23:31:46,484 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:31:46,484 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:31:46,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:31:46,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:31:46,485 INFO L87 Difference]: Start difference. First operand 784 states and 1218 transitions. Second operand 4 states. [2019-11-23 23:31:47,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:31:47,016 INFO L93 Difference]: Finished difference Result 1655 states and 2541 transitions. [2019-11-23 23:31:47,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 23:31:47,021 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 99 [2019-11-23 23:31:47,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:31:47,026 INFO L225 Difference]: With dead ends: 1655 [2019-11-23 23:31:47,026 INFO L226 Difference]: Without dead ends: 872 [2019-11-23 23:31:47,028 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-23 23:31:47,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2019-11-23 23:31:47,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 855. [2019-11-23 23:31:47,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 855 states. [2019-11-23 23:31:47,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 855 states and 1295 transitions. [2019-11-23 23:31:47,057 INFO L78 Accepts]: Start accepts. Automaton has 855 states and 1295 transitions. Word has length 99 [2019-11-23 23:31:47,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:31:47,057 INFO L462 AbstractCegarLoop]: Abstraction has 855 states and 1295 transitions. [2019-11-23 23:31:47,057 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:31:47,058 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 1295 transitions. [2019-11-23 23:31:47,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-11-23 23:31:47,063 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:31:47,063 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 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, 1, 1, 1, 1] [2019-11-23 23:31:47,063 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:31:47,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:31:47,064 INFO L82 PathProgramCache]: Analyzing trace with hash 1788102980, now seen corresponding path program 1 times [2019-11-23 23:31:47,064 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:31:47,064 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265055686] [2019-11-23 23:31:47,064 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:31:47,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:31:47,128 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-23 23:31:47,128 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265055686] [2019-11-23 23:31:47,129 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:31:47,129 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:31:47,129 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218092385] [2019-11-23 23:31:47,130 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:31:47,130 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:31:47,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:31:47,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:31:47,131 INFO L87 Difference]: Start difference. First operand 855 states and 1295 transitions. Second operand 4 states. [2019-11-23 23:31:47,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:31:47,654 INFO L93 Difference]: Finished difference Result 1780 states and 2732 transitions. [2019-11-23 23:31:47,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:31:47,654 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2019-11-23 23:31:47,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:31:47,661 INFO L225 Difference]: With dead ends: 1780 [2019-11-23 23:31:47,662 INFO L226 Difference]: Without dead ends: 997 [2019-11-23 23:31:47,664 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 23:31:47,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 997 states. [2019-11-23 23:31:47,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 997 to 997. [2019-11-23 23:31:47,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 997 states. [2019-11-23 23:31:47,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 997 states to 997 states and 1473 transitions. [2019-11-23 23:31:47,695 INFO L78 Accepts]: Start accepts. Automaton has 997 states and 1473 transitions. Word has length 103 [2019-11-23 23:31:47,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:31:47,695 INFO L462 AbstractCegarLoop]: Abstraction has 997 states and 1473 transitions. [2019-11-23 23:31:47,696 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:31:47,696 INFO L276 IsEmpty]: Start isEmpty. Operand 997 states and 1473 transitions. [2019-11-23 23:31:47,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-11-23 23:31:47,699 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:31:47,699 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 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, 1, 1, 1, 1] [2019-11-23 23:31:47,699 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:31:47,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:31:47,700 INFO L82 PathProgramCache]: Analyzing trace with hash 1752327359, now seen corresponding path program 1 times [2019-11-23 23:31:47,700 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:31:47,700 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384798613] [2019-11-23 23:31:47,700 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:31:47,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:31:47,760 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-23 23:31:47,761 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384798613] [2019-11-23 23:31:47,762 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:31:47,762 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:31:47,762 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080888045] [2019-11-23 23:31:47,763 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:31:47,763 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:31:47,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:31:47,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:31:47,764 INFO L87 Difference]: Start difference. First operand 997 states and 1473 transitions. Second operand 3 states. [2019-11-23 23:31:48,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:31:48,161 INFO L93 Difference]: Finished difference Result 2348 states and 3536 transitions. [2019-11-23 23:31:48,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:31:48,162 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2019-11-23 23:31:48,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:31:48,170 INFO L225 Difference]: With dead ends: 2348 [2019-11-23 23:31:48,170 INFO L226 Difference]: Without dead ends: 1281 [2019-11-23 23:31:48,172 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:31:48,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1281 states. [2019-11-23 23:31:48,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1281 to 1068. [2019-11-23 23:31:48,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1068 states. [2019-11-23 23:31:48,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1068 states to 1068 states and 1345 transitions. [2019-11-23 23:31:48,205 INFO L78 Accepts]: Start accepts. Automaton has 1068 states and 1345 transitions. Word has length 106 [2019-11-23 23:31:48,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:31:48,205 INFO L462 AbstractCegarLoop]: Abstraction has 1068 states and 1345 transitions. [2019-11-23 23:31:48,205 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:31:48,206 INFO L276 IsEmpty]: Start isEmpty. Operand 1068 states and 1345 transitions. [2019-11-23 23:31:48,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-11-23 23:31:48,208 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:31:48,209 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:31:48,209 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:31:48,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:31:48,214 INFO L82 PathProgramCache]: Analyzing trace with hash -1472781149, now seen corresponding path program 1 times [2019-11-23 23:31:48,214 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:31:48,215 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412285267] [2019-11-23 23:31:48,220 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:31:48,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:31:48,367 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:31:48,367 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412285267] [2019-11-23 23:31:48,367 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:31:48,368 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 23:31:48,368 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288241812] [2019-11-23 23:31:48,368 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 23:31:48,369 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:31:48,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 23:31:48,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 23:31:48,370 INFO L87 Difference]: Start difference. First operand 1068 states and 1345 transitions. Second operand 5 states. [2019-11-23 23:31:49,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:31:49,039 INFO L93 Difference]: Finished difference Result 2845 states and 3664 transitions. [2019-11-23 23:31:49,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 23:31:49,040 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 121 [2019-11-23 23:31:49,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:31:49,050 INFO L225 Difference]: With dead ends: 2845 [2019-11-23 23:31:49,050 INFO L226 Difference]: Without dead ends: 1849 [2019-11-23 23:31:49,052 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 23:31:49,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1849 states. [2019-11-23 23:31:49,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1849 to 1423. [2019-11-23 23:31:49,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1423 states. [2019-11-23 23:31:49,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1423 states to 1423 states and 1739 transitions. [2019-11-23 23:31:49,089 INFO L78 Accepts]: Start accepts. Automaton has 1423 states and 1739 transitions. Word has length 121 [2019-11-23 23:31:49,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:31:49,090 INFO L462 AbstractCegarLoop]: Abstraction has 1423 states and 1739 transitions. [2019-11-23 23:31:49,090 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 23:31:49,090 INFO L276 IsEmpty]: Start isEmpty. Operand 1423 states and 1739 transitions. [2019-11-23 23:31:49,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-11-23 23:31:49,095 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:31:49,095 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:31:49,096 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:31:49,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:31:49,096 INFO L82 PathProgramCache]: Analyzing trace with hash -1906081387, now seen corresponding path program 1 times [2019-11-23 23:31:49,096 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:31:49,097 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648029706] [2019-11-23 23:31:49,097 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:31:49,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:31:49,281 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 173 proven. 27 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-11-23 23:31:49,281 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648029706] [2019-11-23 23:31:49,282 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [888037443] [2019-11-23 23:31:49,282 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 23:31:49,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:31:49,406 INFO L255 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-23 23:31:49,431 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 23:31:49,495 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2019-11-23 23:31:49,495 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-23 23:31:49,538 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2019-11-23 23:31:49,538 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-23 23:31:49,539 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [5] total 7 [2019-11-23 23:31:49,539 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662811638] [2019-11-23 23:31:49,540 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:31:49,540 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:31:49,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:31:49,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-11-23 23:31:49,540 INFO L87 Difference]: Start difference. First operand 1423 states and 1739 transitions. Second operand 3 states. [2019-11-23 23:31:49,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:31:49,865 INFO L93 Difference]: Finished difference Result 2843 states and 3496 transitions. [2019-11-23 23:31:49,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:31:49,866 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 187 [2019-11-23 23:31:49,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:31:49,867 INFO L225 Difference]: With dead ends: 2843 [2019-11-23 23:31:49,867 INFO L226 Difference]: Without dead ends: 0 [2019-11-23 23:31:49,871 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 379 GetRequests, 372 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-11-23 23:31:49,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-23 23:31:49,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-23 23:31:49,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-23 23:31:49,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-23 23:31:49,873 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 187 [2019-11-23 23:31:49,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:31:49,873 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-23 23:31:49,873 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:31:49,873 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-23 23:31:49,873 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-23 23:31:50,078 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 23:31:50,085 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-23 23:31:50,341 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 28 [2019-11-23 23:31:50,474 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 28 [2019-11-23 23:31:50,479 INFO L444 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2019-11-23 23:31:50,479 INFO L444 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2019-11-23 23:31:50,479 INFO L444 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2019-11-23 23:31:50,479 INFO L444 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2019-11-23 23:31:50,479 INFO L444 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2019-11-23 23:31:50,479 INFO L444 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2019-11-23 23:31:50,479 INFO L444 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2019-11-23 23:31:50,480 INFO L444 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2019-11-23 23:31:50,480 INFO L444 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2019-11-23 23:31:50,480 INFO L444 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2019-11-23 23:31:50,480 INFO L444 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2019-11-23 23:31:50,480 INFO L444 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2019-11-23 23:31:50,480 INFO L444 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2019-11-23 23:31:50,480 INFO L444 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2019-11-23 23:31:50,480 INFO L444 ceAbstractionStarter]: For program point L538-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 23:31:50,480 INFO L444 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2019-11-23 23:31:50,481 INFO L444 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2019-11-23 23:31:50,481 INFO L444 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2019-11-23 23:31:50,483 INFO L440 ceAbstractionStarter]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse4 (= ~a17~0 1)) (.cse2 (not (= 14 ~a8~0))) (.cse5 (= ~a21~0 1)) (.cse1 (= 1 ~a7~0)) (.cse3 (not (= ~a16~0 6))) (.cse0 (<= ~a17~0 0))) (or (and .cse0 (= 15 ~a8~0)) (and .cse1 .cse2) (and .cse3 .cse4 .cse5 (= ~a20~0 1)) (and .cse4 .cse2 .cse5) (and .cse1 .cse3) (and .cse3 .cse0))) [2019-11-23 23:31:50,483 INFO L444 ceAbstractionStarter]: For program point L541-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 23:31:50,483 INFO L444 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2019-11-23 23:31:50,483 INFO L444 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2019-11-23 23:31:50,483 INFO L444 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2019-11-23 23:31:50,483 INFO L444 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2019-11-23 23:31:50,483 INFO L444 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2019-11-23 23:31:50,484 INFO L444 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2019-11-23 23:31:50,487 INFO L444 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2019-11-23 23:31:50,488 INFO L444 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2019-11-23 23:31:50,488 INFO L444 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2019-11-23 23:31:50,488 INFO L447 ceAbstractionStarter]: At program point L577(lines 577 594) the Hoare annotation is: true [2019-11-23 23:31:50,488 INFO L444 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2019-11-23 23:31:50,488 INFO L444 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2019-11-23 23:31:50,488 INFO L444 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2019-11-23 23:31:50,488 INFO L444 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2019-11-23 23:31:50,488 INFO L444 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2019-11-23 23:31:50,489 INFO L444 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2019-11-23 23:31:50,489 INFO L444 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2019-11-23 23:31:50,489 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-23 23:31:50,489 INFO L444 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2019-11-23 23:31:50,489 INFO L444 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2019-11-23 23:31:50,489 INFO L444 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2019-11-23 23:31:50,489 INFO L444 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2019-11-23 23:31:50,489 INFO L444 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2019-11-23 23:31:50,489 INFO L444 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2019-11-23 23:31:50,490 INFO L440 ceAbstractionStarter]: At program point L583-2(lines 583 593) the Hoare annotation is: (let ((.cse4 (= ~a17~0 1)) (.cse2 (not (= 14 ~a8~0))) (.cse5 (= ~a21~0 1)) (.cse1 (= 1 ~a7~0)) (.cse3 (not (= ~a16~0 6))) (.cse0 (<= ~a17~0 0))) (or (and .cse0 (= 15 ~a8~0)) (and .cse1 .cse2) (and .cse3 .cse4 .cse5 (= ~a20~0 1)) (and .cse4 .cse2 .cse5) (and .cse1 .cse3) (and .cse3 .cse0))) [2019-11-23 23:31:50,493 INFO L444 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2019-11-23 23:31:50,493 INFO L444 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2019-11-23 23:31:50,494 INFO L444 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2019-11-23 23:31:50,494 INFO L444 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2019-11-23 23:31:50,494 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-23 23:31:50,494 INFO L444 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2019-11-23 23:31:50,494 INFO L444 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2019-11-23 23:31:50,494 INFO L444 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2019-11-23 23:31:50,494 INFO L444 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2019-11-23 23:31:50,494 INFO L444 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2019-11-23 23:31:50,495 INFO L444 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2019-11-23 23:31:50,495 INFO L444 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2019-11-23 23:31:50,495 INFO L444 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2019-11-23 23:31:50,495 INFO L444 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2019-11-23 23:31:50,495 INFO L444 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2019-11-23 23:31:50,495 INFO L444 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2019-11-23 23:31:50,495 INFO L444 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2019-11-23 23:31:50,495 INFO L444 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2019-11-23 23:31:50,495 INFO L444 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2019-11-23 23:31:50,495 INFO L444 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2019-11-23 23:31:50,496 INFO L444 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2019-11-23 23:31:50,496 INFO L444 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2019-11-23 23:31:50,497 INFO L444 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2019-11-23 23:31:50,497 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 542) no Hoare annotation was computed. [2019-11-23 23:31:50,497 INFO L444 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2019-11-23 23:31:50,497 INFO L444 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2019-11-23 23:31:50,498 INFO L444 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2019-11-23 23:31:50,498 INFO L444 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2019-11-23 23:31:50,498 INFO L444 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2019-11-23 23:31:50,498 INFO L444 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2019-11-23 23:31:50,498 INFO L444 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2019-11-23 23:31:50,528 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 11:31:50 BoogieIcfgContainer [2019-11-23 23:31:50,529 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-23 23:31:50,532 INFO L168 Benchmark]: Toolchain (without parser) took 9842.19 ms. Allocated memory was 138.4 MB in the beginning and 379.6 MB in the end (delta: 241.2 MB). Free memory was 101.7 MB in the beginning and 234.0 MB in the end (delta: -132.3 MB). Peak memory consumption was 108.9 MB. Max. memory is 7.1 GB. [2019-11-23 23:31:50,533 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 138.4 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2019-11-23 23:31:50,537 INFO L168 Benchmark]: CACSL2BoogieTranslator took 709.11 ms. Allocated memory was 138.4 MB in the beginning and 205.0 MB in the end (delta: 66.6 MB). Free memory was 101.5 MB in the beginning and 170.5 MB in the end (delta: -69.0 MB). Peak memory consumption was 36.1 MB. Max. memory is 7.1 GB. [2019-11-23 23:31:50,537 INFO L168 Benchmark]: Boogie Procedure Inliner took 100.96 ms. Allocated memory is still 205.0 MB. Free memory was 170.5 MB in the beginning and 164.9 MB in the end (delta: 5.6 MB). Peak memory consumption was 5.6 MB. Max. memory is 7.1 GB. [2019-11-23 23:31:50,540 INFO L168 Benchmark]: Boogie Preprocessor took 62.94 ms. Allocated memory is still 205.0 MB. Free memory was 164.9 MB in the beginning and 159.9 MB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 7.1 GB. [2019-11-23 23:31:50,541 INFO L168 Benchmark]: RCFGBuilder took 2065.61 ms. Allocated memory was 205.0 MB in the beginning and 251.1 MB in the end (delta: 46.1 MB). Free memory was 159.9 MB in the beginning and 206.3 MB in the end (delta: -46.4 MB). Peak memory consumption was 114.3 MB. Max. memory is 7.1 GB. [2019-11-23 23:31:50,545 INFO L168 Benchmark]: TraceAbstraction took 6899.19 ms. Allocated memory was 251.1 MB in the beginning and 379.6 MB in the end (delta: 128.5 MB). Free memory was 206.3 MB in the beginning and 234.0 MB in the end (delta: -27.6 MB). Peak memory consumption was 100.8 MB. Max. memory is 7.1 GB. [2019-11-23 23:31:50,553 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.28 ms. Allocated memory is still 138.4 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 709.11 ms. Allocated memory was 138.4 MB in the beginning and 205.0 MB in the end (delta: 66.6 MB). Free memory was 101.5 MB in the beginning and 170.5 MB in the end (delta: -69.0 MB). Peak memory consumption was 36.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 100.96 ms. Allocated memory is still 205.0 MB. Free memory was 170.5 MB in the beginning and 164.9 MB in the end (delta: 5.6 MB). Peak memory consumption was 5.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 62.94 ms. Allocated memory is still 205.0 MB. Free memory was 164.9 MB in the beginning and 159.9 MB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2065.61 ms. Allocated memory was 205.0 MB in the beginning and 251.1 MB in the end (delta: 46.1 MB). Free memory was 159.9 MB in the beginning and 206.3 MB in the end (delta: -46.4 MB). Peak memory consumption was 114.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 6899.19 ms. Allocated memory was 251.1 MB in the beginning and 379.6 MB in the end (delta: 128.5 MB). Free memory was 206.3 MB in the beginning and 234.0 MB in the end (delta: -27.6 MB). Peak memory consumption was 100.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 542]: 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: (((((a17 <= 0 && 15 == a8) || (1 == a7 && !(14 == a8))) || (((!(a16 == 6) && a17 == 1) && a21 == 1) && a20 == 1)) || ((a17 == 1 && !(14 == a8)) && a21 == 1)) || (1 == a7 && !(a16 == 6))) || (!(a16 == 6) && a17 <= 0) - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: (((((a17 <= 0 && 15 == a8) || (1 == a7 && !(14 == a8))) || (((!(a16 == 6) && a17 == 1) && a21 == 1) && a20 == 1)) || ((a17 == 1 && !(14 == a8)) && a21 == 1)) || (1 == a7 && !(a16 == 6))) || (!(a16 == 6) && a17 <= 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 76 locations, 1 error locations. Result: SAFE, OverallTime: 6.8s, OverallIterations: 8, TraceHistogramMax: 5, AutomataDifference: 4.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, HoareTripleCheckerStatistics: 465 SDtfs, 976 SDslu, 57 SDs, 0 SdLazy, 2398 SolverSat, 716 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 402 GetRequests, 380 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1423occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 8 MinimizatonAttempts, 798 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 52 NumberOfFragments, 115 HoareAnnotationTreeSize, 3 FomulaSimplifications, 1665 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 3 FomulaSimplificationsInter, 1112 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 1051 NumberOfCodeBlocks, 1051 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 1228 ConstructedInterpolants, 0 QuantifiedInterpolants, 356398 SizeOfPredicates, 1 NumberOfNonLiveVariables, 418 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 10 InterpolantComputations, 9 PerfectInterpolantSequences, 943/970 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...