/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_label18.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 23:30:31,580 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 23:30:31,583 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 23:30:31,600 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 23:30:31,600 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 23:30:31,603 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 23:30:31,604 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 23:30:31,615 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 23:30:31,617 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 23:30:31,618 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 23:30:31,619 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 23:30:31,620 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 23:30:31,621 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 23:30:31,622 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 23:30:31,622 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 23:30:31,624 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 23:30:31,624 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 23:30:31,625 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 23:30:31,627 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 23:30:31,628 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 23:30:31,630 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 23:30:31,631 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 23:30:31,632 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 23:30:31,632 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 23:30:31,634 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 23:30:31,635 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 23:30:31,635 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 23:30:31,636 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 23:30:31,636 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 23:30:31,637 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 23:30:31,637 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 23:30:31,638 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 23:30:31,639 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 23:30:31,639 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 23:30:31,640 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 23:30:31,641 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 23:30:31,641 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 23:30:31,642 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 23:30:31,642 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 23:30:31,643 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 23:30:31,643 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 23:30:31,644 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:30:31,668 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 23:30:31,668 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 23:30:31,670 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-23 23:30:31,670 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-23 23:30:31,670 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-23 23:30:31,670 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-23 23:30:31,670 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-23 23:30:31,672 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-23 23:30:31,672 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-23 23:30:31,672 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-23 23:30:31,672 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-23 23:30:31,672 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-23 23:30:31,673 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-23 23:30:31,673 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-23 23:30:31,673 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-23 23:30:31,674 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 23:30:31,674 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 23:30:31,674 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 23:30:31,674 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 23:30:31,675 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 23:30:31,675 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 23:30:31,675 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 23:30:31,675 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 23:30:31,675 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 23:30:31,676 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 23:30:31,676 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 23:30:31,676 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 23:30:31,676 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 23:30:31,676 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 23:30:31,677 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 23:30:31,677 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 23:30:31,677 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 23:30:31,677 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 23:30:31,677 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-23 23:30:31,678 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 23:30:31,678 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 23:30:31,678 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 23:30:31,678 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-11-23 23:30:31,981 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 23:30:32,001 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 23:30:32,004 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 23:30:32,008 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 23:30:32,008 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 23:30:32,009 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label18.c [2019-11-23 23:30:32,082 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f103bc80/2be19033306043e08a7101e7eb0c2a01/FLAGccfdd5bb2 [2019-11-23 23:30:32,648 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 23:30:32,649 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label18.c [2019-11-23 23:30:32,664 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f103bc80/2be19033306043e08a7101e7eb0c2a01/FLAGccfdd5bb2 [2019-11-23 23:30:32,874 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f103bc80/2be19033306043e08a7101e7eb0c2a01 [2019-11-23 23:30:32,883 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 23:30:32,884 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 23:30:32,885 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 23:30:32,885 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 23:30:32,888 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 23:30:32,889 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:30:32" (1/1) ... [2019-11-23 23:30:32,892 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3824762d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:32, skipping insertion in model container [2019-11-23 23:30:32,892 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:30:32" (1/1) ... [2019-11-23 23:30:32,899 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 23:30:32,955 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 23:30:33,570 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 23:30:33,579 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 23:30:33,672 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 23:30:33,689 INFO L208 MainTranslator]: Completed translation [2019-11-23 23:30:33,690 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:33 WrapperNode [2019-11-23 23:30:33,690 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 23:30:33,691 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 23:30:33,691 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 23:30:33,691 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 23:30:33,698 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:30:33" (1/1) ... [2019-11-23 23:30:33,716 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:30:33" (1/1) ... [2019-11-23 23:30:33,778 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 23:30:33,779 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 23:30:33,779 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 23:30:33,779 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 23:30:33,787 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:33" (1/1) ... [2019-11-23 23:30:33,788 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:33" (1/1) ... [2019-11-23 23:30:33,796 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:33" (1/1) ... [2019-11-23 23:30:33,797 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:33" (1/1) ... [2019-11-23 23:30:33,835 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:33" (1/1) ... [2019-11-23 23:30:33,858 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:33" (1/1) ... [2019-11-23 23:30:33,866 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:33" (1/1) ... [2019-11-23 23:30:33,881 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 23:30:33,881 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 23:30:33,881 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 23:30:33,882 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 23:30:33,886 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:33" (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:30:33,956 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 23:30:33,956 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 23:30:35,801 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 23:30:35,801 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-23 23:30:35,802 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:30:35 BoogieIcfgContainer [2019-11-23 23:30:35,802 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 23:30:35,804 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 23:30:35,804 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 23:30:35,807 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 23:30:35,807 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:30:32" (1/3) ... [2019-11-23 23:30:35,808 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52f9996 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:30:35, skipping insertion in model container [2019-11-23 23:30:35,808 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:33" (2/3) ... [2019-11-23 23:30:35,808 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52f9996 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:30:35, skipping insertion in model container [2019-11-23 23:30:35,809 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:30:35" (3/3) ... [2019-11-23 23:30:35,810 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem01_label18.c [2019-11-23 23:30:35,820 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 23:30:35,827 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 23:30:35,838 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 23:30:35,866 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 23:30:35,866 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 23:30:35,867 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 23:30:35,867 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 23:30:35,867 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 23:30:35,867 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 23:30:35,867 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 23:30:35,868 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 23:30:35,890 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states. [2019-11-23 23:30:35,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-23 23:30:35,901 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:30:35,902 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:30:35,903 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:30:35,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:30:35,909 INFO L82 PathProgramCache]: Analyzing trace with hash -1323242527, now seen corresponding path program 1 times [2019-11-23 23:30:35,920 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:30:35,920 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202174378] [2019-11-23 23:30:35,921 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:30:36,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:30:36,329 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:30:36,330 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202174378] [2019-11-23 23:30:36,330 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:30:36,331 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:30:36,333 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504487560] [2019-11-23 23:30:36,338 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:30:36,338 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:30:36,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:30:36,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:30:36,355 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 4 states. [2019-11-23 23:30:37,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:30:37,143 INFO L93 Difference]: Finished difference Result 297 states and 569 transitions. [2019-11-23 23:30:37,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:30:37,145 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 71 [2019-11-23 23:30:37,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:30:37,161 INFO L225 Difference]: With dead ends: 297 [2019-11-23 23:30:37,162 INFO L226 Difference]: Without dead ends: 216 [2019-11-23 23:30:37,165 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:30:37,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2019-11-23 23:30:37,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 145. [2019-11-23 23:30:37,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-11-23 23:30:37,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 259 transitions. [2019-11-23 23:30:37,248 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 259 transitions. Word has length 71 [2019-11-23 23:30:37,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:30:37,250 INFO L462 AbstractCegarLoop]: Abstraction has 145 states and 259 transitions. [2019-11-23 23:30:37,250 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:30:37,251 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 259 transitions. [2019-11-23 23:30:37,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-11-23 23:30:37,257 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:30:37,257 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:30:37,258 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:30:37,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:30:37,258 INFO L82 PathProgramCache]: Analyzing trace with hash -1048395148, now seen corresponding path program 1 times [2019-11-23 23:30:37,258 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:30:37,259 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995889467] [2019-11-23 23:30:37,259 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:30:37,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:30:37,347 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:30:37,348 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995889467] [2019-11-23 23:30:37,348 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:30:37,348 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:30:37,348 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83830155] [2019-11-23 23:30:37,350 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:30:37,351 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:30:37,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:30:37,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:30:37,352 INFO L87 Difference]: Start difference. First operand 145 states and 259 transitions. Second operand 4 states. [2019-11-23 23:30:37,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:30:37,979 INFO L93 Difference]: Finished difference Result 573 states and 1031 transitions. [2019-11-23 23:30:37,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:30:37,980 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2019-11-23 23:30:37,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:30:37,983 INFO L225 Difference]: With dead ends: 573 [2019-11-23 23:30:37,983 INFO L226 Difference]: Without dead ends: 429 [2019-11-23 23:30:37,985 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:30:37,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2019-11-23 23:30:38,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 429. [2019-11-23 23:30:38,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 429 states. [2019-11-23 23:30:38,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 707 transitions. [2019-11-23 23:30:38,044 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 707 transitions. Word has length 77 [2019-11-23 23:30:38,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:30:38,045 INFO L462 AbstractCegarLoop]: Abstraction has 429 states and 707 transitions. [2019-11-23 23:30:38,045 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:30:38,045 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 707 transitions. [2019-11-23 23:30:38,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-11-23 23:30:38,054 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:30:38,054 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:30:38,054 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:30:38,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:30:38,055 INFO L82 PathProgramCache]: Analyzing trace with hash -2123299820, now seen corresponding path program 1 times [2019-11-23 23:30:38,055 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:30:38,055 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107262697] [2019-11-23 23:30:38,057 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:30:38,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:30:38,213 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-23 23:30:38,213 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107262697] [2019-11-23 23:30:38,213 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:30:38,214 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 23:30:38,214 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858975126] [2019-11-23 23:30:38,214 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:30:38,215 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:30:38,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:30:38,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:30:38,215 INFO L87 Difference]: Start difference. First operand 429 states and 707 transitions. Second operand 3 states. [2019-11-23 23:30:38,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:30:38,625 INFO L93 Difference]: Finished difference Result 1212 states and 1980 transitions. [2019-11-23 23:30:38,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:30:38,625 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 78 [2019-11-23 23:30:38,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:30:38,630 INFO L225 Difference]: With dead ends: 1212 [2019-11-23 23:30:38,631 INFO L226 Difference]: Without dead ends: 784 [2019-11-23 23:30:38,633 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:30:38,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 784 states. [2019-11-23 23:30:38,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 784 to 642. [2019-11-23 23:30:38,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-11-23 23:30:38,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 955 transitions. [2019-11-23 23:30:38,656 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 955 transitions. Word has length 78 [2019-11-23 23:30:38,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:30:38,657 INFO L462 AbstractCegarLoop]: Abstraction has 642 states and 955 transitions. [2019-11-23 23:30:38,657 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:30:38,657 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 955 transitions. [2019-11-23 23:30:38,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-23 23:30:38,660 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:30:38,660 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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] [2019-11-23 23:30:38,661 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:30:38,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:30:38,661 INFO L82 PathProgramCache]: Analyzing trace with hash 2133654126, now seen corresponding path program 1 times [2019-11-23 23:30:38,662 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:30:38,662 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920776190] [2019-11-23 23:30:38,662 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:30:38,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:30:38,717 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-23 23:30:38,717 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920776190] [2019-11-23 23:30:38,718 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:30:38,718 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 23:30:38,718 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287422077] [2019-11-23 23:30:38,718 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:30:38,719 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:30:38,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:30:38,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:30:38,719 INFO L87 Difference]: Start difference. First operand 642 states and 955 transitions. Second operand 3 states. [2019-11-23 23:30:39,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:30:39,117 INFO L93 Difference]: Finished difference Result 1496 states and 2249 transitions. [2019-11-23 23:30:39,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:30:39,118 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2019-11-23 23:30:39,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:30:39,124 INFO L225 Difference]: With dead ends: 1496 [2019-11-23 23:30:39,124 INFO L226 Difference]: Without dead ends: 855 [2019-11-23 23:30:39,127 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:30:39,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 855 states. [2019-11-23 23:30:39,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 855 to 713. [2019-11-23 23:30:39,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 713 states. [2019-11-23 23:30:39,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 713 states to 713 states and 1057 transitions. [2019-11-23 23:30:39,155 INFO L78 Accepts]: Start accepts. Automaton has 713 states and 1057 transitions. Word has length 94 [2019-11-23 23:30:39,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:30:39,156 INFO L462 AbstractCegarLoop]: Abstraction has 713 states and 1057 transitions. [2019-11-23 23:30:39,156 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:30:39,157 INFO L276 IsEmpty]: Start isEmpty. Operand 713 states and 1057 transitions. [2019-11-23 23:30:39,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-11-23 23:30:39,160 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:30:39,160 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 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] [2019-11-23 23:30:39,161 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:30:39,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:30:39,162 INFO L82 PathProgramCache]: Analyzing trace with hash 501973457, now seen corresponding path program 1 times [2019-11-23 23:30:39,162 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:30:39,162 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447913430] [2019-11-23 23:30:39,163 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:30:39,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:30:39,284 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-11-23 23:30:39,285 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447913430] [2019-11-23 23:30:39,285 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:30:39,285 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 23:30:39,285 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332630914] [2019-11-23 23:30:39,286 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:30:39,286 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:30:39,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:30:39,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:30:39,287 INFO L87 Difference]: Start difference. First operand 713 states and 1057 transitions. Second operand 3 states. [2019-11-23 23:30:39,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:30:39,645 INFO L93 Difference]: Finished difference Result 1780 states and 2618 transitions. [2019-11-23 23:30:39,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:30:39,646 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2019-11-23 23:30:39,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:30:39,651 INFO L225 Difference]: With dead ends: 1780 [2019-11-23 23:30:39,652 INFO L226 Difference]: Without dead ends: 1068 [2019-11-23 23:30:39,653 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:30:39,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1068 states. [2019-11-23 23:30:39,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1068 to 855. [2019-11-23 23:30:39,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 855 states. [2019-11-23 23:30:39,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 855 states and 1241 transitions. [2019-11-23 23:30:39,679 INFO L78 Accepts]: Start accepts. Automaton has 855 states and 1241 transitions. Word has length 105 [2019-11-23 23:30:39,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:30:39,680 INFO L462 AbstractCegarLoop]: Abstraction has 855 states and 1241 transitions. [2019-11-23 23:30:39,680 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:30:39,680 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 1241 transitions. [2019-11-23 23:30:39,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-11-23 23:30:39,683 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:30:39,683 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:30:39,683 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:30:39,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:30:39,684 INFO L82 PathProgramCache]: Analyzing trace with hash -1784768667, now seen corresponding path program 1 times [2019-11-23 23:30:39,684 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:30:39,684 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166627341] [2019-11-23 23:30:39,684 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:30:39,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:30:39,804 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-11-23 23:30:39,805 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166627341] [2019-11-23 23:30:39,806 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:30:39,807 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:30:39,807 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947569901] [2019-11-23 23:30:39,808 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:30:39,808 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:30:39,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:30:39,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:30:39,809 INFO L87 Difference]: Start difference. First operand 855 states and 1241 transitions. Second operand 4 states. [2019-11-23 23:30:40,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:30:40,313 INFO L93 Difference]: Finished difference Result 1809 states and 2593 transitions. [2019-11-23 23:30:40,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 23:30:40,314 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 113 [2019-11-23 23:30:40,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:30:40,318 INFO L225 Difference]: With dead ends: 1809 [2019-11-23 23:30:40,319 INFO L226 Difference]: Without dead ends: 955 [2019-11-23 23:30:40,321 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:30:40,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 955 states. [2019-11-23 23:30:40,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 955 to 926. [2019-11-23 23:30:40,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 926 states. [2019-11-23 23:30:40,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 926 states to 926 states and 1318 transitions. [2019-11-23 23:30:40,352 INFO L78 Accepts]: Start accepts. Automaton has 926 states and 1318 transitions. Word has length 113 [2019-11-23 23:30:40,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:30:40,352 INFO L462 AbstractCegarLoop]: Abstraction has 926 states and 1318 transitions. [2019-11-23 23:30:40,353 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:30:40,353 INFO L276 IsEmpty]: Start isEmpty. Operand 926 states and 1318 transitions. [2019-11-23 23:30:40,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-11-23 23:30:40,356 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:30:40,357 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:30:40,357 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:30:40,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:30:40,357 INFO L82 PathProgramCache]: Analyzing trace with hash 509269917, now seen corresponding path program 1 times [2019-11-23 23:30:40,358 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:30:40,358 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943388888] [2019-11-23 23:30:40,358 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:30:40,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:30:40,424 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-11-23 23:30:40,424 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943388888] [2019-11-23 23:30:40,424 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:30:40,425 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:30:40,425 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115340511] [2019-11-23 23:30:40,425 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:30:40,426 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:30:40,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:30:40,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:30:40,426 INFO L87 Difference]: Start difference. First operand 926 states and 1318 transitions. Second operand 4 states. [2019-11-23 23:30:40,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:30:40,929 INFO L93 Difference]: Finished difference Result 1780 states and 2558 transitions. [2019-11-23 23:30:40,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:30:40,929 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 117 [2019-11-23 23:30:40,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:30:40,934 INFO L225 Difference]: With dead ends: 1780 [2019-11-23 23:30:40,935 INFO L226 Difference]: Without dead ends: 926 [2019-11-23 23:30:40,936 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:30:40,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 926 states. [2019-11-23 23:30:40,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 926 to 926. [2019-11-23 23:30:40,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 926 states. [2019-11-23 23:30:40,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 926 states to 926 states and 1312 transitions. [2019-11-23 23:30:40,968 INFO L78 Accepts]: Start accepts. Automaton has 926 states and 1312 transitions. Word has length 117 [2019-11-23 23:30:40,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:30:40,969 INFO L462 AbstractCegarLoop]: Abstraction has 926 states and 1312 transitions. [2019-11-23 23:30:40,969 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:30:40,969 INFO L276 IsEmpty]: Start isEmpty. Operand 926 states and 1312 transitions. [2019-11-23 23:30:40,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-11-23 23:30:40,974 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:30:40,974 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:30:40,975 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:30:40,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:30:40,975 INFO L82 PathProgramCache]: Analyzing trace with hash 1638316384, now seen corresponding path program 1 times [2019-11-23 23:30:40,976 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:30:40,976 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003559234] [2019-11-23 23:30:40,976 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:30:40,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:30:41,149 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-11-23 23:30:41,150 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003559234] [2019-11-23 23:30:41,150 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:30:41,150 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-23 23:30:41,151 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921884186] [2019-11-23 23:30:41,151 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-23 23:30:41,151 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:30:41,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-23 23:30:41,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-23 23:30:41,152 INFO L87 Difference]: Start difference. First operand 926 states and 1312 transitions. Second operand 6 states. [2019-11-23 23:30:42,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:30:42,014 INFO L93 Difference]: Finished difference Result 2067 states and 2917 transitions. [2019-11-23 23:30:42,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-23 23:30:42,014 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 131 [2019-11-23 23:30:42,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:30:42,020 INFO L225 Difference]: With dead ends: 2067 [2019-11-23 23:30:42,020 INFO L226 Difference]: Without dead ends: 1213 [2019-11-23 23:30:42,022 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-11-23 23:30:42,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1213 states. [2019-11-23 23:30:42,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1213 to 1068. [2019-11-23 23:30:42,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1068 states. [2019-11-23 23:30:42,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1068 states to 1068 states and 1466 transitions. [2019-11-23 23:30:42,048 INFO L78 Accepts]: Start accepts. Automaton has 1068 states and 1466 transitions. Word has length 131 [2019-11-23 23:30:42,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:30:42,048 INFO L462 AbstractCegarLoop]: Abstraction has 1068 states and 1466 transitions. [2019-11-23 23:30:42,048 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-23 23:30:42,048 INFO L276 IsEmpty]: Start isEmpty. Operand 1068 states and 1466 transitions. [2019-11-23 23:30:42,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-11-23 23:30:42,051 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:30:42,052 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:30:42,052 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:30:42,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:30:42,052 INFO L82 PathProgramCache]: Analyzing trace with hash 1291918939, now seen corresponding path program 1 times [2019-11-23 23:30:42,053 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:30:42,053 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537505211] [2019-11-23 23:30:42,053 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:30:42,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:30:42,121 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-11-23 23:30:42,122 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537505211] [2019-11-23 23:30:42,122 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:30:42,122 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 23:30:42,123 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540378309] [2019-11-23 23:30:42,123 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:30:42,123 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:30:42,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:30:42,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:30:42,124 INFO L87 Difference]: Start difference. First operand 1068 states and 1466 transitions. Second operand 4 states. [2019-11-23 23:30:42,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:30:42,701 INFO L93 Difference]: Finished difference Result 2845 states and 3883 transitions. [2019-11-23 23:30:42,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:30:42,702 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 134 [2019-11-23 23:30:42,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:30:42,707 INFO L225 Difference]: With dead ends: 2845 [2019-11-23 23:30:42,708 INFO L226 Difference]: Without dead ends: 1352 [2019-11-23 23:30:42,710 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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:30:42,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1352 states. [2019-11-23 23:30:42,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1352 to 1139. [2019-11-23 23:30:42,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1139 states. [2019-11-23 23:30:42,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1139 states to 1139 states and 1313 transitions. [2019-11-23 23:30:42,750 INFO L78 Accepts]: Start accepts. Automaton has 1139 states and 1313 transitions. Word has length 134 [2019-11-23 23:30:42,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:30:42,750 INFO L462 AbstractCegarLoop]: Abstraction has 1139 states and 1313 transitions. [2019-11-23 23:30:42,750 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:30:42,750 INFO L276 IsEmpty]: Start isEmpty. Operand 1139 states and 1313 transitions. [2019-11-23 23:30:42,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-11-23 23:30:42,753 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:30:42,754 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 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, 1] [2019-11-23 23:30:42,754 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:30:42,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:30:42,754 INFO L82 PathProgramCache]: Analyzing trace with hash 2055474000, now seen corresponding path program 1 times [2019-11-23 23:30:42,755 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:30:42,755 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141009100] [2019-11-23 23:30:42,755 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:30:42,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:30:42,927 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 139 proven. 27 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-23 23:30:42,928 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141009100] [2019-11-23 23:30:42,928 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1085564962] [2019-11-23 23:30:42,928 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:30:43,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:30:43,095 INFO L255 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-23 23:30:43,121 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 23:30:43,220 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-11-23 23:30:43,222 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-23 23:30:43,282 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-11-23 23:30:43,283 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-23 23:30:43,283 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [5] total 7 [2019-11-23 23:30:43,283 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956407450] [2019-11-23 23:30:43,285 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:30:43,285 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:30:43,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:30:43,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-11-23 23:30:43,294 INFO L87 Difference]: Start difference. First operand 1139 states and 1313 transitions. Second operand 3 states. [2019-11-23 23:30:43,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:30:43,587 INFO L93 Difference]: Finished difference Result 1141 states and 1314 transitions. [2019-11-23 23:30:43,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:30:43,587 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 164 [2019-11-23 23:30:43,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:30:43,595 INFO L225 Difference]: With dead ends: 1141 [2019-11-23 23:30:43,595 INFO L226 Difference]: Without dead ends: 1139 [2019-11-23 23:30:43,596 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 326 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:30:43,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1139 states. [2019-11-23 23:30:43,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1139 to 997. [2019-11-23 23:30:43,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 997 states. [2019-11-23 23:30:43,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 997 states to 997 states and 1130 transitions. [2019-11-23 23:30:43,632 INFO L78 Accepts]: Start accepts. Automaton has 997 states and 1130 transitions. Word has length 164 [2019-11-23 23:30:43,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:30:43,632 INFO L462 AbstractCegarLoop]: Abstraction has 997 states and 1130 transitions. [2019-11-23 23:30:43,633 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:30:43,633 INFO L276 IsEmpty]: Start isEmpty. Operand 997 states and 1130 transitions. [2019-11-23 23:30:43,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2019-11-23 23:30:43,637 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:30:43,638 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:30:43,841 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 23:30:43,842 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:30:43,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:30:43,842 INFO L82 PathProgramCache]: Analyzing trace with hash 317706789, now seen corresponding path program 1 times [2019-11-23 23:30:43,842 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:30:43,843 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886669483] [2019-11-23 23:30:43,843 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:30:43,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:30:44,727 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 216 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-23 23:30:44,728 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886669483] [2019-11-23 23:30:44,728 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:30:44,729 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-11-23 23:30:44,729 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118632372] [2019-11-23 23:30:44,729 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-23 23:30:44,730 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:30:44,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-23 23:30:44,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=77, Unknown=0, NotChecked=0, Total=132 [2019-11-23 23:30:44,730 INFO L87 Difference]: Start difference. First operand 997 states and 1130 transitions. Second operand 12 states. [2019-11-23 23:30:45,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:30:45,658 INFO L93 Difference]: Finished difference Result 2051 states and 2348 transitions. [2019-11-23 23:30:45,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-23 23:30:45,658 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 206 [2019-11-23 23:30:45,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:30:45,663 INFO L225 Difference]: With dead ends: 2051 [2019-11-23 23:30:45,663 INFO L226 Difference]: Without dead ends: 1126 [2019-11-23 23:30:45,665 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=115, Invalid=157, Unknown=0, NotChecked=0, Total=272 [2019-11-23 23:30:45,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1126 states. [2019-11-23 23:30:45,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1126 to 1055. [2019-11-23 23:30:45,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1055 states. [2019-11-23 23:30:45,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1055 states to 1055 states and 1191 transitions. [2019-11-23 23:30:45,689 INFO L78 Accepts]: Start accepts. Automaton has 1055 states and 1191 transitions. Word has length 206 [2019-11-23 23:30:45,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:30:45,689 INFO L462 AbstractCegarLoop]: Abstraction has 1055 states and 1191 transitions. [2019-11-23 23:30:45,690 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-23 23:30:45,690 INFO L276 IsEmpty]: Start isEmpty. Operand 1055 states and 1191 transitions. [2019-11-23 23:30:45,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2019-11-23 23:30:45,694 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:30:45,694 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:30:45,694 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:30:45,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:30:45,695 INFO L82 PathProgramCache]: Analyzing trace with hash 408539634, now seen corresponding path program 1 times [2019-11-23 23:30:45,695 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:30:45,695 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39856761] [2019-11-23 23:30:45,695 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:30:45,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:30:45,852 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 219 proven. 0 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2019-11-23 23:30:45,852 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39856761] [2019-11-23 23:30:45,852 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:30:45,853 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-23 23:30:45,853 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798176111] [2019-11-23 23:30:45,853 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-23 23:30:45,853 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:30:45,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-23 23:30:45,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-23 23:30:45,854 INFO L87 Difference]: Start difference. First operand 1055 states and 1191 transitions. Second operand 6 states. [2019-11-23 23:30:46,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:30:46,362 INFO L93 Difference]: Finished difference Result 2218 states and 2512 transitions. [2019-11-23 23:30:46,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 23:30:46,362 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 233 [2019-11-23 23:30:46,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:30:46,367 INFO L225 Difference]: With dead ends: 2218 [2019-11-23 23:30:46,367 INFO L226 Difference]: Without dead ends: 1235 [2019-11-23 23:30:46,369 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:30:46,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1235 states. [2019-11-23 23:30:46,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1235 to 1126. [2019-11-23 23:30:46,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1126 states. [2019-11-23 23:30:46,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1126 states to 1126 states and 1257 transitions. [2019-11-23 23:30:46,396 INFO L78 Accepts]: Start accepts. Automaton has 1126 states and 1257 transitions. Word has length 233 [2019-11-23 23:30:46,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:30:46,396 INFO L462 AbstractCegarLoop]: Abstraction has 1126 states and 1257 transitions. [2019-11-23 23:30:46,396 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-23 23:30:46,397 INFO L276 IsEmpty]: Start isEmpty. Operand 1126 states and 1257 transitions. [2019-11-23 23:30:46,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2019-11-23 23:30:46,401 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:30:46,401 INFO L410 BasicCegarLoop]: trace histogram [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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:30:46,401 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:30:46,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:30:46,402 INFO L82 PathProgramCache]: Analyzing trace with hash 1767805751, now seen corresponding path program 1 times [2019-11-23 23:30:46,402 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:30:46,402 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569280036] [2019-11-23 23:30:46,402 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:30:46,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:30:46,599 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 172 proven. 0 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2019-11-23 23:30:46,600 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569280036] [2019-11-23 23:30:46,600 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:30:46,600 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 23:30:46,601 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938196161] [2019-11-23 23:30:46,602 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:30:46,602 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:30:46,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:30:46,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:30:46,603 INFO L87 Difference]: Start difference. First operand 1126 states and 1257 transitions. Second operand 4 states. [2019-11-23 23:30:46,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:30:46,980 INFO L93 Difference]: Finished difference Result 2249 states and 2526 transitions. [2019-11-23 23:30:46,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:30:46,981 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 244 [2019-11-23 23:30:46,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:30:46,982 INFO L225 Difference]: With dead ends: 2249 [2019-11-23 23:30:46,982 INFO L226 Difference]: Without dead ends: 0 [2019-11-23 23:30:46,984 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:30:46,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-23 23:30:46,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-23 23:30:46,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-23 23:30:46,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-23 23:30:46,986 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 244 [2019-11-23 23:30:46,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:30:46,987 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-23 23:30:46,987 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:30:46,987 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-23 23:30:46,987 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-23 23:30:46,992 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-23 23:30:47,115 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 170 DAG size of output: 90 [2019-11-23 23:30:47,246 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 174 DAG size of output: 89 [2019-11-23 23:30:47,542 WARN L192 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 36 [2019-11-23 23:30:47,796 WARN L192 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 36 [2019-11-23 23:30:47,799 INFO L444 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2019-11-23 23:30:47,800 INFO L444 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2019-11-23 23:30:47,800 INFO L444 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2019-11-23 23:30:47,800 INFO L444 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2019-11-23 23:30:47,800 INFO L444 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2019-11-23 23:30:47,800 INFO L444 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2019-11-23 23:30:47,800 INFO L444 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2019-11-23 23:30:47,800 INFO L444 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2019-11-23 23:30:47,800 INFO L444 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2019-11-23 23:30:47,800 INFO L444 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2019-11-23 23:30:47,801 INFO L444 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2019-11-23 23:30:47,801 INFO L444 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2019-11-23 23:30:47,801 INFO L444 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2019-11-23 23:30:47,801 INFO L444 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2019-11-23 23:30:47,801 INFO L444 ceAbstractionStarter]: For program point L472-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 23:30:47,801 INFO L444 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2019-11-23 23:30:47,801 INFO L444 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2019-11-23 23:30:47,801 INFO L444 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2019-11-23 23:30:47,802 INFO L440 ceAbstractionStarter]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse6 (= 15 ~a8~0))) (let ((.cse2 (<= ~a17~0 0)) (.cse7 (= 13 ~a8~0)) (.cse1 (not (= ~a16~0 6))) (.cse0 (not .cse6)) (.cse8 (= ~a20~0 1)) (.cse4 (not (= 1 ~a7~0))) (.cse9 (= ~a17~0 1)) (.cse5 (= ~a12~0 8)) (.cse3 (= ~a21~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse2 .cse3 .cse6) (and .cse1 .cse2 .cse5 .cse3) (and .cse7 .cse8) (and .cse0 .cse4 .cse3 (= ~a16~0 5)) (and .cse7 .cse1 .cse9 .cse5) (and .cse0 .cse3 .cse8) (and .cse4 .cse9 .cse5 .cse3 .cse6)))) [2019-11-23 23:30:47,802 INFO L444 ceAbstractionStarter]: For program point L475-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 23:30:47,802 INFO L444 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2019-11-23 23:30:47,802 INFO L444 ceAbstractionStarter]: For program point L476(line 476) no Hoare annotation was computed. [2019-11-23 23:30:47,802 INFO L444 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2019-11-23 23:30:47,803 INFO L444 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2019-11-23 23:30:47,803 INFO L444 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2019-11-23 23:30:47,803 INFO L444 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2019-11-23 23:30:47,803 INFO L444 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2019-11-23 23:30:47,803 INFO L444 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2019-11-23 23:30:47,803 INFO L444 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2019-11-23 23:30:47,803 INFO L447 ceAbstractionStarter]: At program point L577(lines 577 594) the Hoare annotation is: true [2019-11-23 23:30:47,803 INFO L444 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2019-11-23 23:30:47,803 INFO L444 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2019-11-23 23:30:47,804 INFO L444 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2019-11-23 23:30:47,804 INFO L444 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2019-11-23 23:30:47,804 INFO L444 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2019-11-23 23:30:47,804 INFO L444 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2019-11-23 23:30:47,804 INFO L444 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2019-11-23 23:30:47,804 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-23 23:30:47,804 INFO L444 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2019-11-23 23:30:47,804 INFO L444 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2019-11-23 23:30:47,804 INFO L444 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2019-11-23 23:30:47,805 INFO L444 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2019-11-23 23:30:47,805 INFO L444 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2019-11-23 23:30:47,805 INFO L444 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2019-11-23 23:30:47,805 INFO L440 ceAbstractionStarter]: At program point L583-2(lines 583 593) the Hoare annotation is: (let ((.cse6 (= 15 ~a8~0))) (let ((.cse2 (<= ~a17~0 0)) (.cse7 (= 13 ~a8~0)) (.cse1 (not (= ~a16~0 6))) (.cse0 (not .cse6)) (.cse8 (= ~a20~0 1)) (.cse4 (not (= 1 ~a7~0))) (.cse9 (= ~a17~0 1)) (.cse5 (= ~a12~0 8)) (.cse3 (= ~a21~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse2 .cse3 .cse6) (and .cse1 .cse2 .cse5 .cse3) (and .cse7 .cse8) (and .cse0 .cse4 .cse3 (= ~a16~0 5)) (and .cse7 .cse1 .cse9 .cse5) (and .cse0 .cse3 .cse8) (and .cse4 .cse9 .cse5 .cse3 .cse6)))) [2019-11-23 23:30:47,805 INFO L444 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2019-11-23 23:30:47,805 INFO L444 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2019-11-23 23:30:47,805 INFO L444 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2019-11-23 23:30:47,806 INFO L444 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2019-11-23 23:30:47,806 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-23 23:30:47,806 INFO L444 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2019-11-23 23:30:47,806 INFO L444 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2019-11-23 23:30:47,806 INFO L444 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2019-11-23 23:30:47,806 INFO L444 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2019-11-23 23:30:47,806 INFO L444 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2019-11-23 23:30:47,806 INFO L444 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2019-11-23 23:30:47,807 INFO L444 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2019-11-23 23:30:47,807 INFO L444 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2019-11-23 23:30:47,807 INFO L444 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2019-11-23 23:30:47,807 INFO L444 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2019-11-23 23:30:47,807 INFO L444 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2019-11-23 23:30:47,807 INFO L444 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2019-11-23 23:30:47,807 INFO L444 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2019-11-23 23:30:47,807 INFO L444 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2019-11-23 23:30:47,807 INFO L444 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2019-11-23 23:30:47,807 INFO L444 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2019-11-23 23:30:47,807 INFO L444 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2019-11-23 23:30:47,808 INFO L444 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2019-11-23 23:30:47,808 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 476) no Hoare annotation was computed. [2019-11-23 23:30:47,808 INFO L444 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2019-11-23 23:30:47,808 INFO L444 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2019-11-23 23:30:47,808 INFO L444 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2019-11-23 23:30:47,808 INFO L444 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2019-11-23 23:30:47,808 INFO L444 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2019-11-23 23:30:47,808 INFO L444 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2019-11-23 23:30:47,809 INFO L444 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2019-11-23 23:30:47,842 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 11:30:47 BoogieIcfgContainer [2019-11-23 23:30:47,842 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-23 23:30:47,845 INFO L168 Benchmark]: Toolchain (without parser) took 14959.79 ms. Allocated memory was 138.4 MB in the beginning and 503.8 MB in the end (delta: 365.4 MB). Free memory was 101.4 MB in the beginning and 459.9 MB in the end (delta: -358.4 MB). Peak memory consumption was 320.5 MB. Max. memory is 7.1 GB. [2019-11-23 23:30:47,845 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 138.4 MB. Free memory is still 121.4 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-11-23 23:30:47,846 INFO L168 Benchmark]: CACSL2BoogieTranslator took 805.46 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.2 MB in the beginning and 170.7 MB in the end (delta: -69.5 MB). Peak memory consumption was 34.6 MB. Max. memory is 7.1 GB. [2019-11-23 23:30:47,847 INFO L168 Benchmark]: Boogie Procedure Inliner took 87.60 ms. Allocated memory is still 205.0 MB. Free memory was 170.7 MB in the beginning and 164.9 MB in the end (delta: 5.8 MB). Peak memory consumption was 5.8 MB. Max. memory is 7.1 GB. [2019-11-23 23:30:47,847 INFO L168 Benchmark]: Boogie Preprocessor took 102.33 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:30:47,848 INFO L168 Benchmark]: RCFGBuilder took 1921.36 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.4 MB in the end (delta: -46.5 MB). Peak memory consumption was 114.2 MB. Max. memory is 7.1 GB. [2019-11-23 23:30:47,849 INFO L168 Benchmark]: TraceAbstraction took 12038.68 ms. Allocated memory was 251.1 MB in the beginning and 503.8 MB in the end (delta: 252.7 MB). Free memory was 206.4 MB in the beginning and 459.9 MB in the end (delta: -253.5 MB). Peak memory consumption was 312.8 MB. Max. memory is 7.1 GB. [2019-11-23 23:30:47,853 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 is still 121.4 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 805.46 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.2 MB in the beginning and 170.7 MB in the end (delta: -69.5 MB). Peak memory consumption was 34.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 87.60 ms. Allocated memory is still 205.0 MB. Free memory was 170.7 MB in the beginning and 164.9 MB in the end (delta: 5.8 MB). Peak memory consumption was 5.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 102.33 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 1921.36 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.4 MB in the end (delta: -46.5 MB). Peak memory consumption was 114.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 12038.68 ms. Allocated memory was 251.1 MB in the beginning and 503.8 MB in the end (delta: 252.7 MB). Free memory was 206.4 MB in the beginning and 459.9 MB in the end (delta: -253.5 MB). Peak memory consumption was 312.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 476]: 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: (((((((((!(15 == a8) && !(a16 == 6)) && a17 <= 0) && a21 == 1) || ((((!(1 == a7) && a12 == 8) && a17 <= 0) && a21 == 1) && 15 == a8)) || (((!(a16 == 6) && a17 <= 0) && a12 == 8) && a21 == 1)) || (13 == a8 && a20 == 1)) || (((!(15 == a8) && !(1 == a7)) && a21 == 1) && a16 == 5)) || (((13 == a8 && !(a16 == 6)) && a17 == 1) && a12 == 8)) || ((!(15 == a8) && a21 == 1) && a20 == 1)) || ((((!(1 == a7) && a17 == 1) && a12 == 8) && a21 == 1) && 15 == a8) - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: (((((((((!(15 == a8) && !(a16 == 6)) && a17 <= 0) && a21 == 1) || ((((!(1 == a7) && a12 == 8) && a17 <= 0) && a21 == 1) && 15 == a8)) || (((!(a16 == 6) && a17 <= 0) && a12 == 8) && a21 == 1)) || (13 == a8 && a20 == 1)) || (((!(15 == a8) && !(1 == a7)) && a21 == 1) && a16 == 5)) || (((13 == a8 && !(a16 == 6)) && a17 == 1) && a12 == 8)) || ((!(15 == a8) && a21 == 1) && a20 == 1)) || ((((!(1 == a7) && a17 == 1) && a12 == 8) && a21 == 1) && 15 == a8) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 76 locations, 1 error locations. Result: SAFE, OverallTime: 11.9s, OverallIterations: 13, TraceHistogramMax: 5, AutomataDifference: 7.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.8s, HoareTripleCheckerStatistics: 656 SDtfs, 1898 SDslu, 109 SDs, 0 SdLazy, 4294 SolverSat, 989 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 404 GetRequests, 348 SyntacticMatches, 10 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1139occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 13 MinimizatonAttempts, 1277 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 52 NumberOfFragments, 223 HoareAnnotationTreeSize, 3 FomulaSimplifications, 12104 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 3 FomulaSimplificationsInter, 971 FormulaSimplificationTreeSizeReductionInter, 0.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 1931 NumberOfCodeBlocks, 1931 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 2080 ConstructedInterpolants, 0 QuantifiedInterpolants, 1239981 SizeOfPredicates, 1 NumberOfNonLiveVariables, 370 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 15 InterpolantComputations, 14 PerfectInterpolantSequences, 1868/1895 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...