/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_label36.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 23:31:05,490 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 23:31:05,493 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 23:31:05,511 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 23:31:05,512 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 23:31:05,513 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 23:31:05,515 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 23:31:05,528 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 23:31:05,530 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 23:31:05,530 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 23:31:05,534 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 23:31:05,536 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 23:31:05,536 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 23:31:05,539 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 23:31:05,542 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 23:31:05,544 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 23:31:05,545 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 23:31:05,549 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 23:31:05,551 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 23:31:05,556 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 23:31:05,558 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 23:31:05,563 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 23:31:05,564 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 23:31:05,565 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 23:31:05,568 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 23:31:05,568 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 23:31:05,569 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 23:31:05,570 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 23:31:05,572 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 23:31:05,573 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 23:31:05,573 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 23:31:05,574 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 23:31:05,575 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 23:31:05,576 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 23:31:05,580 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 23:31:05,580 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 23:31:05,581 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 23:31:05,581 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 23:31:05,581 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 23:31:05,582 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 23:31:05,583 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 23:31:05,584 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:05,603 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 23:31:05,603 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 23:31:05,605 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-23 23:31:05,605 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-23 23:31:05,605 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-23 23:31:05,605 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-23 23:31:05,605 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-23 23:31:05,606 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-23 23:31:05,606 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-23 23:31:05,606 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-23 23:31:05,608 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-23 23:31:05,608 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-23 23:31:05,608 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-23 23:31:05,609 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-23 23:31:05,609 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-23 23:31:05,610 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 23:31:05,610 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 23:31:05,611 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 23:31:05,611 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 23:31:05,612 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 23:31:05,613 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 23:31:05,615 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 23:31:05,615 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 23:31:05,616 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 23:31:05,616 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 23:31:05,617 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 23:31:05,617 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 23:31:05,617 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 23:31:05,618 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 23:31:05,619 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 23:31:05,619 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 23:31:05,619 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 23:31:05,619 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 23:31:05,620 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-23 23:31:05,620 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 23:31:05,620 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 23:31:05,621 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 23:31:05,621 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-11-23 23:31:05,938 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 23:31:05,951 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 23:31:05,954 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 23:31:05,956 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 23:31:05,956 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 23:31:05,957 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label36.c [2019-11-23 23:31:06,035 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1bd00d94c/42ef82545e184bcba8e90756ab67418b/FLAGcf9bc36e1 [2019-11-23 23:31:06,663 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 23:31:06,664 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label36.c [2019-11-23 23:31:06,684 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1bd00d94c/42ef82545e184bcba8e90756ab67418b/FLAGcf9bc36e1 [2019-11-23 23:31:06,954 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1bd00d94c/42ef82545e184bcba8e90756ab67418b [2019-11-23 23:31:06,965 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 23:31:06,966 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 23:31:06,967 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 23:31:06,968 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 23:31:06,971 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 23:31:06,972 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:31:06" (1/1) ... [2019-11-23 23:31:06,978 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ca5fab2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:31:06, skipping insertion in model container [2019-11-23 23:31:06,978 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:31:06" (1/1) ... [2019-11-23 23:31:06,985 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 23:31:07,036 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 23:31:07,558 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 23:31:07,563 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 23:31:07,676 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 23:31:07,698 INFO L208 MainTranslator]: Completed translation [2019-11-23 23:31:07,698 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:31:07 WrapperNode [2019-11-23 23:31:07,699 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 23:31:07,699 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 23:31:07,699 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 23:31:07,699 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 23:31:07,707 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:07" (1/1) ... [2019-11-23 23:31:07,726 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:07" (1/1) ... [2019-11-23 23:31:07,786 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 23:31:07,786 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 23:31:07,787 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 23:31:07,787 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 23:31:07,800 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:07" (1/1) ... [2019-11-23 23:31:07,800 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:07" (1/1) ... [2019-11-23 23:31:07,805 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:07" (1/1) ... [2019-11-23 23:31:07,805 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:07" (1/1) ... [2019-11-23 23:31:07,826 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:07" (1/1) ... [2019-11-23 23:31:07,844 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:07" (1/1) ... [2019-11-23 23:31:07,860 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:07" (1/1) ... [2019-11-23 23:31:07,872 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 23:31:07,872 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 23:31:07,872 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 23:31:07,873 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 23:31:07,874 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:31:07" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 23:31:07,950 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 23:31:07,953 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 23:31:09,797 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 23:31:09,797 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-23 23:31:09,798 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:31:09 BoogieIcfgContainer [2019-11-23 23:31:09,799 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 23:31:09,800 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 23:31:09,800 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 23:31:09,803 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 23:31:09,803 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:31:06" (1/3) ... [2019-11-23 23:31:09,804 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49400294 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:31:09, skipping insertion in model container [2019-11-23 23:31:09,804 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:31:07" (2/3) ... [2019-11-23 23:31:09,804 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49400294 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:31:09, skipping insertion in model container [2019-11-23 23:31:09,805 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:31:09" (3/3) ... [2019-11-23 23:31:09,807 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem01_label36.c [2019-11-23 23:31:09,817 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 23:31:09,825 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 23:31:09,836 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 23:31:09,862 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 23:31:09,862 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 23:31:09,862 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 23:31:09,862 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 23:31:09,862 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 23:31:09,863 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 23:31:09,863 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 23:31:09,863 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 23:31:09,881 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states. [2019-11-23 23:31:09,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-23 23:31:09,890 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:31:09,891 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:09,891 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:31:09,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:31:09,898 INFO L82 PathProgramCache]: Analyzing trace with hash -839566688, now seen corresponding path program 1 times [2019-11-23 23:31:09,908 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:31:09,908 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016293073] [2019-11-23 23:31:09,909 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:31:10,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:31:10,271 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:10,273 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016293073] [2019-11-23 23:31:10,274 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:31:10,275 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:31:10,276 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003728766] [2019-11-23 23:31:10,282 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:31:10,283 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:31:10,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:31:10,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:31:10,299 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 4 states. [2019-11-23 23:31:11,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:31:11,048 INFO L93 Difference]: Finished difference Result 297 states and 569 transitions. [2019-11-23 23:31:11,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:31:11,050 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 71 [2019-11-23 23:31:11,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:31:11,067 INFO L225 Difference]: With dead ends: 297 [2019-11-23 23:31:11,067 INFO L226 Difference]: Without dead ends: 216 [2019-11-23 23:31:11,071 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:11,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2019-11-23 23:31:11,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 145. [2019-11-23 23:31:11,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-11-23 23:31:11,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 259 transitions. [2019-11-23 23:31:11,140 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 259 transitions. Word has length 71 [2019-11-23 23:31:11,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:31:11,141 INFO L462 AbstractCegarLoop]: Abstraction has 145 states and 259 transitions. [2019-11-23 23:31:11,141 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:31:11,141 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 259 transitions. [2019-11-23 23:31:11,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-11-23 23:31:11,147 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:31:11,148 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-23 23:31:11,148 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:31:11,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:31:11,148 INFO L82 PathProgramCache]: Analyzing trace with hash -1061927437, now seen corresponding path program 1 times [2019-11-23 23:31:11,149 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:31:11,149 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091780065] [2019-11-23 23:31:11,149 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:31:11,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:31:11,211 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:31:11,212 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091780065] [2019-11-23 23:31:11,212 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:31:11,212 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:31:11,213 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424227024] [2019-11-23 23:31:11,217 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:31:11,217 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:31:11,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:31:11,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:31:11,218 INFO L87 Difference]: Start difference. First operand 145 states and 259 transitions. Second operand 4 states. [2019-11-23 23:31:11,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:31:11,966 INFO L93 Difference]: Finished difference Result 573 states and 1031 transitions. [2019-11-23 23:31:11,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:31:11,967 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2019-11-23 23:31:11,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:31:11,970 INFO L225 Difference]: With dead ends: 573 [2019-11-23 23:31:11,971 INFO L226 Difference]: Without dead ends: 429 [2019-11-23 23:31:11,972 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:11,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2019-11-23 23:31:12,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 429. [2019-11-23 23:31:12,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 429 states. [2019-11-23 23:31:12,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 707 transitions. [2019-11-23 23:31:12,010 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 707 transitions. Word has length 77 [2019-11-23 23:31:12,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:31:12,010 INFO L462 AbstractCegarLoop]: Abstraction has 429 states and 707 transitions. [2019-11-23 23:31:12,010 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:31:12,011 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 707 transitions. [2019-11-23 23:31:12,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-11-23 23:31:12,019 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:31:12,022 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-23 23:31:12,022 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:31:12,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:31:12,023 INFO L82 PathProgramCache]: Analyzing trace with hash 1752151157, now seen corresponding path program 1 times [2019-11-23 23:31:12,023 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:31:12,023 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074329863] [2019-11-23 23:31:12,024 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:31:12,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:31:12,179 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:31:12,180 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074329863] [2019-11-23 23:31:12,180 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:31:12,180 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:31:12,180 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899967910] [2019-11-23 23:31:12,182 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:31:12,183 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:31:12,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:31:12,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:31:12,184 INFO L87 Difference]: Start difference. First operand 429 states and 707 transitions. Second operand 3 states. [2019-11-23 23:31:12,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:31:12,552 INFO L93 Difference]: Finished difference Result 1141 states and 1891 transitions. [2019-11-23 23:31:12,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:31:12,552 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 78 [2019-11-23 23:31:12,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:31:12,557 INFO L225 Difference]: With dead ends: 1141 [2019-11-23 23:31:12,557 INFO L226 Difference]: Without dead ends: 642 [2019-11-23 23:31:12,560 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:12,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2019-11-23 23:31:12,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 571. [2019-11-23 23:31:12,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 571 states. [2019-11-23 23:31:12,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 838 transitions. [2019-11-23 23:31:12,586 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 838 transitions. Word has length 78 [2019-11-23 23:31:12,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:31:12,587 INFO L462 AbstractCegarLoop]: Abstraction has 571 states and 838 transitions. [2019-11-23 23:31:12,587 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:31:12,587 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 838 transitions. [2019-11-23 23:31:12,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-11-23 23:31:12,590 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:31:12,590 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1] [2019-11-23 23:31:12,590 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:31:12,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:31:12,591 INFO L82 PathProgramCache]: Analyzing trace with hash 2038002531, now seen corresponding path program 1 times [2019-11-23 23:31:12,591 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:31:12,591 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765695421] [2019-11-23 23:31:12,591 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:31:12,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:31:12,666 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-23 23:31:12,667 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765695421] [2019-11-23 23:31:12,667 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:31:12,667 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 23:31:12,668 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551936249] [2019-11-23 23:31:12,669 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:31:12,670 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:31:12,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:31:12,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:31:12,670 INFO L87 Difference]: Start difference. First operand 571 states and 838 transitions. Second operand 3 states. [2019-11-23 23:31:13,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:31:13,105 INFO L93 Difference]: Finished difference Result 1496 states and 2219 transitions. [2019-11-23 23:31:13,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:31:13,106 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2019-11-23 23:31:13,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:31:13,110 INFO L225 Difference]: With dead ends: 1496 [2019-11-23 23:31:13,111 INFO L226 Difference]: Without dead ends: 855 [2019-11-23 23:31:13,112 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:13,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 855 states. [2019-11-23 23:31:13,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 855 to 784. [2019-11-23 23:31:13,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2019-11-23 23:31:13,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 977 transitions. [2019-11-23 23:31:13,135 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 977 transitions. Word has length 86 [2019-11-23 23:31:13,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:31:13,136 INFO L462 AbstractCegarLoop]: Abstraction has 784 states and 977 transitions. [2019-11-23 23:31:13,136 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:31:13,136 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 977 transitions. [2019-11-23 23:31:13,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-23 23:31:13,138 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:31:13,139 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:31:13,139 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:31:13,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:31:13,139 INFO L82 PathProgramCache]: Analyzing trace with hash -1861169841, now seen corresponding path program 1 times [2019-11-23 23:31:13,140 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:31:13,140 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466378115] [2019-11-23 23:31:13,140 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:31:13,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:31:13,222 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-23 23:31:13,222 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466378115] [2019-11-23 23:31:13,223 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:31:13,223 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:31:13,223 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598742837] [2019-11-23 23:31:13,224 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:31:13,224 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:31:13,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:31:13,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:31:13,225 INFO L87 Difference]: Start difference. First operand 784 states and 977 transitions. Second operand 4 states. [2019-11-23 23:31:13,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:31:13,688 INFO L93 Difference]: Finished difference Result 1667 states and 2064 transitions. [2019-11-23 23:31:13,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 23:31:13,688 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2019-11-23 23:31:13,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:31:13,693 INFO L225 Difference]: With dead ends: 1667 [2019-11-23 23:31:13,693 INFO L226 Difference]: Without dead ends: 884 [2019-11-23 23:31:13,695 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:13,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 884 states. [2019-11-23 23:31:13,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 884 to 855. [2019-11-23 23:31:13,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 855 states. [2019-11-23 23:31:13,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 855 states and 1051 transitions. [2019-11-23 23:31:13,720 INFO L78 Accepts]: Start accepts. Automaton has 855 states and 1051 transitions. Word has length 94 [2019-11-23 23:31:13,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:31:13,721 INFO L462 AbstractCegarLoop]: Abstraction has 855 states and 1051 transitions. [2019-11-23 23:31:13,721 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:31:13,721 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 1051 transitions. [2019-11-23 23:31:13,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-23 23:31:13,723 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:31:13,723 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 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] [2019-11-23 23:31:13,724 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:31:13,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:31:13,724 INFO L82 PathProgramCache]: Analyzing trace with hash 791588759, now seen corresponding path program 1 times [2019-11-23 23:31:13,725 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:31:13,725 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163995653] [2019-11-23 23:31:13,725 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:31:13,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:31:13,780 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:31:13,781 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163995653] [2019-11-23 23:31:13,781 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:31:13,781 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 23:31:13,782 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045107259] [2019-11-23 23:31:13,782 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:31:13,782 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:31:13,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:31:13,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:31:13,783 INFO L87 Difference]: Start difference. First operand 855 states and 1051 transitions. Second operand 4 states. [2019-11-23 23:31:14,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:31:14,358 INFO L93 Difference]: Finished difference Result 1993 states and 2503 transitions. [2019-11-23 23:31:14,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:31:14,358 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-11-23 23:31:14,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:31:14,364 INFO L225 Difference]: With dead ends: 1993 [2019-11-23 23:31:14,364 INFO L226 Difference]: Without dead ends: 1210 [2019-11-23 23:31:14,366 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 23:31:14,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1210 states. [2019-11-23 23:31:14,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1210 to 997. [2019-11-23 23:31:14,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 997 states. [2019-11-23 23:31:14,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 997 states to 997 states and 1183 transitions. [2019-11-23 23:31:14,393 INFO L78 Accepts]: Start accepts. Automaton has 997 states and 1183 transitions. Word has length 98 [2019-11-23 23:31:14,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:31:14,394 INFO L462 AbstractCegarLoop]: Abstraction has 997 states and 1183 transitions. [2019-11-23 23:31:14,394 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:31:14,394 INFO L276 IsEmpty]: Start isEmpty. Operand 997 states and 1183 transitions. [2019-11-23 23:31:14,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-11-23 23:31:14,396 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:31:14,397 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14,397 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:31:14,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:31:14,397 INFO L82 PathProgramCache]: Analyzing trace with hash -2122852108, now seen corresponding path program 1 times [2019-11-23 23:31:14,398 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:31:14,398 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319329713] [2019-11-23 23:31:14,398 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:31:14,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:31:14,569 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-23 23:31:14,570 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319329713] [2019-11-23 23:31:14,570 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:31:14,570 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-23 23:31:14,571 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627975203] [2019-11-23 23:31:14,571 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-23 23:31:14,571 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:31:14,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-23 23:31:14,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-11-23 23:31:14,572 INFO L87 Difference]: Start difference. First operand 997 states and 1183 transitions. Second operand 8 states. [2019-11-23 23:31:15,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:31:15,410 INFO L93 Difference]: Finished difference Result 2180 states and 2588 transitions. [2019-11-23 23:31:15,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-23 23:31:15,411 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 112 [2019-11-23 23:31:15,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:31:15,417 INFO L225 Difference]: With dead ends: 2180 [2019-11-23 23:31:15,417 INFO L226 Difference]: Without dead ends: 1255 [2019-11-23 23:31:15,418 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 23:31:15,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1255 states. [2019-11-23 23:31:15,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1255 to 1068. [2019-11-23 23:31:15,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1068 states. [2019-11-23 23:31:15,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1068 states to 1068 states and 1255 transitions. [2019-11-23 23:31:15,448 INFO L78 Accepts]: Start accepts. Automaton has 1068 states and 1255 transitions. Word has length 112 [2019-11-23 23:31:15,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:31:15,449 INFO L462 AbstractCegarLoop]: Abstraction has 1068 states and 1255 transitions. [2019-11-23 23:31:15,449 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-23 23:31:15,449 INFO L276 IsEmpty]: Start isEmpty. Operand 1068 states and 1255 transitions. [2019-11-23 23:31:15,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-11-23 23:31:15,452 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:31:15,452 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-23 23:31:15,453 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:31:15,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:31:15,453 INFO L82 PathProgramCache]: Analyzing trace with hash -1614100254, now seen corresponding path program 1 times [2019-11-23 23:31:15,453 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:31:15,454 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182774287] [2019-11-23 23:31:15,454 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:31:15,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:31:15,580 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:31:15,580 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182774287] [2019-11-23 23:31:15,580 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:31:15,581 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-23 23:31:15,581 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919170132] [2019-11-23 23:31:15,581 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-23 23:31:15,582 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:31:15,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-23 23:31:15,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-11-23 23:31:15,582 INFO L87 Difference]: Start difference. First operand 1068 states and 1255 transitions. Second operand 6 states. [2019-11-23 23:31:16,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:31:16,102 INFO L93 Difference]: Finished difference Result 2286 states and 2680 transitions. [2019-11-23 23:31:16,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 23:31:16,102 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 145 [2019-11-23 23:31:16,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:31:16,108 INFO L225 Difference]: With dead ends: 2286 [2019-11-23 23:31:16,109 INFO L226 Difference]: Without dead ends: 1290 [2019-11-23 23:31:16,111 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-11-23 23:31:16,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1290 states. [2019-11-23 23:31:16,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1290 to 997. [2019-11-23 23:31:16,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 997 states. [2019-11-23 23:31:16,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 997 states to 997 states and 1131 transitions. [2019-11-23 23:31:16,138 INFO L78 Accepts]: Start accepts. Automaton has 997 states and 1131 transitions. Word has length 145 [2019-11-23 23:31:16,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:31:16,139 INFO L462 AbstractCegarLoop]: Abstraction has 997 states and 1131 transitions. [2019-11-23 23:31:16,139 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-23 23:31:16,139 INFO L276 IsEmpty]: Start isEmpty. Operand 997 states and 1131 transitions. [2019-11-23 23:31:16,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2019-11-23 23:31:16,143 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:31:16,143 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:31:16,144 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:31:16,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:31:16,144 INFO L82 PathProgramCache]: Analyzing trace with hash 954077146, now seen corresponding path program 1 times [2019-11-23 23:31:16,144 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:31:16,145 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173635373] [2019-11-23 23:31:16,145 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:31:16,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:31:16,347 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 240 proven. 0 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2019-11-23 23:31:16,347 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173635373] [2019-11-23 23:31:16,348 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:31:16,348 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-23 23:31:16,348 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813794376] [2019-11-23 23:31:16,349 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-23 23:31:16,349 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:31:16,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-23 23:31:16,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-23 23:31:16,350 INFO L87 Difference]: Start difference. First operand 997 states and 1131 transitions. Second operand 6 states. [2019-11-23 23:31:16,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:31:16,800 INFO L93 Difference]: Finished difference Result 2023 states and 2310 transitions. [2019-11-23 23:31:16,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 23:31:16,801 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 243 [2019-11-23 23:31:16,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:31:16,801 INFO L225 Difference]: With dead ends: 2023 [2019-11-23 23:31:16,801 INFO L226 Difference]: Without dead ends: 0 [2019-11-23 23:31:16,804 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 23:31:16,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-23 23:31:16,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-23 23:31:16,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-23 23:31:16,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-23 23:31:16,805 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 243 [2019-11-23 23:31:16,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:31:16,805 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-23 23:31:16,805 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-23 23:31:16,805 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-23 23:31:16,805 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-23 23:31:16,810 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-23 23:31:16,961 WARN L192 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 66 [2019-11-23 23:31:17,124 WARN L192 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 70 [2019-11-23 23:31:17,343 WARN L192 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 26 [2019-11-23 23:31:17,536 WARN L192 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 26 [2019-11-23 23:31:17,540 INFO L444 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2019-11-23 23:31:17,540 INFO L444 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2019-11-23 23:31:17,540 INFO L444 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2019-11-23 23:31:17,540 INFO L444 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2019-11-23 23:31:17,540 INFO L444 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2019-11-23 23:31:17,541 INFO L444 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2019-11-23 23:31:17,541 INFO L444 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2019-11-23 23:31:17,541 INFO L444 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2019-11-23 23:31:17,541 INFO L444 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2019-11-23 23:31:17,541 INFO L444 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2019-11-23 23:31:17,541 INFO L444 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2019-11-23 23:31:17,541 INFO L444 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2019-11-23 23:31:17,542 INFO L444 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2019-11-23 23:31:17,543 INFO L444 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2019-11-23 23:31:17,543 INFO L444 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2019-11-23 23:31:17,544 INFO L444 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2019-11-23 23:31:17,545 INFO L444 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2019-11-23 23:31:17,545 INFO L440 ceAbstractionStarter]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse3 (= ~a16~0 6)) (.cse0 (= ~a17~0 1)) (.cse1 (= ~a21~0 1)) (.cse2 (= ~a20~0 1)) (.cse4 (not (= 13 ~a8~0)))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse3 .cse4) (= 1 ~a7~0) (and .cse0 .cse1 .cse2 .cse4) (= ~a16~0 4) (and .cse4 (= ~a16~0 5)))) [2019-11-23 23:31:17,545 INFO L444 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2019-11-23 23:31:17,546 INFO L444 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2019-11-23 23:31:17,554 INFO L444 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2019-11-23 23:31:17,554 INFO L444 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2019-11-23 23:31:17,554 INFO L444 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2019-11-23 23:31:17,554 INFO L444 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2019-11-23 23:31:17,554 INFO L444 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2019-11-23 23:31:17,555 INFO L444 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2019-11-23 23:31:17,555 INFO L447 ceAbstractionStarter]: At program point L577(lines 577 594) the Hoare annotation is: true [2019-11-23 23:31:17,555 INFO L444 ceAbstractionStarter]: For program point L478-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 23:31:17,555 INFO L444 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2019-11-23 23:31:17,555 INFO L444 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2019-11-23 23:31:17,555 INFO L444 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2019-11-23 23:31:17,555 INFO L444 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2019-11-23 23:31:17,556 INFO L444 ceAbstractionStarter]: For program point L481-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 23:31:17,556 INFO L444 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2019-11-23 23:31:17,556 INFO L444 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2019-11-23 23:31:17,556 INFO L444 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2019-11-23 23:31:17,556 INFO L444 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2019-11-23 23:31:17,556 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-23 23:31:17,556 INFO L444 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2019-11-23 23:31:17,557 INFO L444 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2019-11-23 23:31:17,557 INFO L444 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2019-11-23 23:31:17,557 INFO L444 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2019-11-23 23:31:17,557 INFO L444 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2019-11-23 23:31:17,557 INFO L444 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2019-11-23 23:31:17,557 INFO L440 ceAbstractionStarter]: At program point L583-2(lines 583 593) the Hoare annotation is: (let ((.cse3 (= ~a16~0 6)) (.cse0 (= ~a17~0 1)) (.cse1 (= ~a21~0 1)) (.cse2 (= ~a20~0 1)) (.cse4 (not (= 13 ~a8~0)))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse3 .cse4) (= 1 ~a7~0) (and .cse0 .cse1 .cse2 .cse4) (= ~a16~0 4) (and .cse4 (= ~a16~0 5)))) [2019-11-23 23:31:17,558 INFO L444 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2019-11-23 23:31:17,558 INFO L444 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2019-11-23 23:31:17,558 INFO L444 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2019-11-23 23:31:17,558 INFO L444 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2019-11-23 23:31:17,558 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-23 23:31:17,558 INFO L444 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2019-11-23 23:31:17,558 INFO L444 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2019-11-23 23:31:17,559 INFO L444 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2019-11-23 23:31:17,559 INFO L444 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2019-11-23 23:31:17,559 INFO L444 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2019-11-23 23:31:17,559 INFO L444 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2019-11-23 23:31:17,559 INFO L444 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2019-11-23 23:31:17,559 INFO L444 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2019-11-23 23:31:17,559 INFO L444 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2019-11-23 23:31:17,560 INFO L444 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2019-11-23 23:31:17,560 INFO L444 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2019-11-23 23:31:17,560 INFO L444 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2019-11-23 23:31:17,560 INFO L444 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2019-11-23 23:31:17,560 INFO L444 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2019-11-23 23:31:17,560 INFO L444 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2019-11-23 23:31:17,560 INFO L444 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2019-11-23 23:31:17,560 INFO L444 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2019-11-23 23:31:17,561 INFO L444 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2019-11-23 23:31:17,561 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 482) no Hoare annotation was computed. [2019-11-23 23:31:17,561 INFO L444 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2019-11-23 23:31:17,561 INFO L444 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2019-11-23 23:31:17,561 INFO L444 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2019-11-23 23:31:17,561 INFO L444 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2019-11-23 23:31:17,561 INFO L444 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2019-11-23 23:31:17,562 INFO L444 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2019-11-23 23:31:17,562 INFO L444 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2019-11-23 23:31:17,589 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 11:31:17 BoogieIcfgContainer [2019-11-23 23:31:17,589 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-23 23:31:17,591 INFO L168 Benchmark]: Toolchain (without parser) took 10624.83 ms. Allocated memory was 146.3 MB in the beginning and 367.0 MB in the end (delta: 220.7 MB). Free memory was 102.2 MB in the beginning and 268.0 MB in the end (delta: -165.8 MB). Peak memory consumption was 237.7 MB. Max. memory is 7.1 GB. [2019-11-23 23:31:17,596 INFO L168 Benchmark]: CDTParser took 0.20 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: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2019-11-23 23:31:17,597 INFO L168 Benchmark]: CACSL2BoogieTranslator took 731.59 ms. Allocated memory was 146.3 MB in the beginning and 205.0 MB in the end (delta: 58.7 MB). Free memory was 102.0 MB in the beginning and 163.8 MB in the end (delta: -61.8 MB). Peak memory consumption was 23.0 MB. Max. memory is 7.1 GB. [2019-11-23 23:31:17,598 INFO L168 Benchmark]: Boogie Procedure Inliner took 86.87 ms. Allocated memory is still 205.0 MB. Free memory was 163.8 MB in the beginning and 157.7 MB in the end (delta: 6.1 MB). Peak memory consumption was 6.1 MB. Max. memory is 7.1 GB. [2019-11-23 23:31:17,599 INFO L168 Benchmark]: Boogie Preprocessor took 85.56 ms. Allocated memory is still 205.0 MB. Free memory was 157.7 MB in the beginning and 153.0 MB in the end (delta: 4.7 MB). Peak memory consumption was 4.7 MB. Max. memory is 7.1 GB. [2019-11-23 23:31:17,600 INFO L168 Benchmark]: RCFGBuilder took 1926.42 ms. Allocated memory was 205.0 MB in the beginning and 248.5 MB in the end (delta: 43.5 MB). Free memory was 153.0 MB in the beginning and 193.4 MB in the end (delta: -40.4 MB). Peak memory consumption was 105.1 MB. Max. memory is 7.1 GB. [2019-11-23 23:31:17,603 INFO L168 Benchmark]: TraceAbstraction took 7789.73 ms. Allocated memory was 248.5 MB in the beginning and 367.0 MB in the end (delta: 118.5 MB). Free memory was 193.4 MB in the beginning and 268.0 MB in the end (delta: -74.6 MB). Peak memory consumption was 226.7 MB. Max. memory is 7.1 GB. [2019-11-23 23:31:17,611 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.20 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: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 731.59 ms. Allocated memory was 146.3 MB in the beginning and 205.0 MB in the end (delta: 58.7 MB). Free memory was 102.0 MB in the beginning and 163.8 MB in the end (delta: -61.8 MB). Peak memory consumption was 23.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 86.87 ms. Allocated memory is still 205.0 MB. Free memory was 163.8 MB in the beginning and 157.7 MB in the end (delta: 6.1 MB). Peak memory consumption was 6.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 85.56 ms. Allocated memory is still 205.0 MB. Free memory was 157.7 MB in the beginning and 153.0 MB in the end (delta: 4.7 MB). Peak memory consumption was 4.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1926.42 ms. Allocated memory was 205.0 MB in the beginning and 248.5 MB in the end (delta: 43.5 MB). Free memory was 153.0 MB in the beginning and 193.4 MB in the end (delta: -40.4 MB). Peak memory consumption was 105.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 7789.73 ms. Allocated memory was 248.5 MB in the beginning and 367.0 MB in the end (delta: 118.5 MB). Free memory was 193.4 MB in the beginning and 268.0 MB in the end (delta: -74.6 MB). Peak memory consumption was 226.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 482]: 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 == 1 && a21 == 1) && a20 == 1) && a16 == 6) || (a16 == 6 && !(13 == a8))) || 1 == a7) || (((a17 == 1 && a21 == 1) && a20 == 1) && !(13 == a8))) || a16 == 4) || (!(13 == a8) && a16 == 5) - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: (((((((a17 == 1 && a21 == 1) && a20 == 1) && a16 == 6) || (a16 == 6 && !(13 == a8))) || 1 == a7) || (((a17 == 1 && a21 == 1) && a20 == 1) && !(13 == a8))) || a16 == 4) || (!(13 == a8) && a16 == 5) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 76 locations, 1 error locations. Result: SAFE, OverallTime: 7.7s, OverallIterations: 9, TraceHistogramMax: 6, AutomataDifference: 5.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.7s, HoareTripleCheckerStatistics: 452 SDtfs, 1296 SDslu, 81 SDs, 0 SdLazy, 3263 SolverSat, 736 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 41 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1068occurred 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, 9 MinimizatonAttempts, 935 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 61 NumberOfFragments, 101 HoareAnnotationTreeSize, 3 FomulaSimplifications, 13795 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 3 FomulaSimplificationsInter, 2233 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 1004 NumberOfCodeBlocks, 1004 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 995 ConstructedInterpolants, 0 QuantifiedInterpolants, 363320 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 627/627 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...