/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/forester-heap/sll-01-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-24 00:34:05,674 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-24 00:34:05,677 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-24 00:34:05,693 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-24 00:34:05,693 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-24 00:34:05,694 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-24 00:34:05,696 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-24 00:34:05,698 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-24 00:34:05,700 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-24 00:34:05,701 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-24 00:34:05,702 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-24 00:34:05,703 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-24 00:34:05,703 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-24 00:34:05,704 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-24 00:34:05,705 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-24 00:34:05,706 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-24 00:34:05,707 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-24 00:34:05,708 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-24 00:34:05,710 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-24 00:34:05,712 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-24 00:34:05,713 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-24 00:34:05,714 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-24 00:34:05,715 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-24 00:34:05,716 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-24 00:34:05,718 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-24 00:34:05,719 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-24 00:34:05,719 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-24 00:34:05,720 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-24 00:34:05,720 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-24 00:34:05,721 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-24 00:34:05,721 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-24 00:34:05,722 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-24 00:34:05,723 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-24 00:34:05,724 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-24 00:34:05,725 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-24 00:34:05,725 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-24 00:34:05,726 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-24 00:34:05,726 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-24 00:34:05,726 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-24 00:34:05,727 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-24 00:34:05,728 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-24 00:34:05,728 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-24 00:34:05,744 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-24 00:34:05,744 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-24 00:34:05,745 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-24 00:34:05,746 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-24 00:34:05,746 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-24 00:34:05,746 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-24 00:34:05,746 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-24 00:34:05,746 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-24 00:34:05,747 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-24 00:34:05,747 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-24 00:34:05,747 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-24 00:34:05,747 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-24 00:34:05,747 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-24 00:34:05,748 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-24 00:34:05,748 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-24 00:34:05,748 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-24 00:34:05,749 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-24 00:34:05,749 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-24 00:34:05,749 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-24 00:34:05,749 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-24 00:34:05,749 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-24 00:34:05,750 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-24 00:34:05,750 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-24 00:34:05,750 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-24 00:34:05,750 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-24 00:34:05,750 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-24 00:34:05,751 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-24 00:34:05,751 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-24 00:34:05,751 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-24 00:34:05,751 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-24 00:34:05,751 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-24 00:34:05,752 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-24 00:34:05,752 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-24 00:34:05,752 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-24 00:34:05,752 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-24 00:34:05,752 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-24 00:34:05,753 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-24 00:34:05,753 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-11-24 00:34:06,032 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-24 00:34:06,045 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-24 00:34:06,049 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-24 00:34:06,050 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-24 00:34:06,050 INFO L275 PluginConnector]: CDTParser initialized [2019-11-24 00:34:06,051 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/sll-01-1.i [2019-11-24 00:34:06,130 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/016a725ea/cce4d3ad307043009214997aa4dd8e02/FLAG7325ffbc7 [2019-11-24 00:34:06,691 INFO L306 CDTParser]: Found 1 translation units. [2019-11-24 00:34:06,691 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-01-1.i [2019-11-24 00:34:06,704 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/016a725ea/cce4d3ad307043009214997aa4dd8e02/FLAG7325ffbc7 [2019-11-24 00:34:06,959 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/016a725ea/cce4d3ad307043009214997aa4dd8e02 [2019-11-24 00:34:06,969 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-24 00:34:06,971 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-24 00:34:06,972 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-24 00:34:06,972 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-24 00:34:06,976 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-24 00:34:06,977 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 12:34:06" (1/1) ... [2019-11-24 00:34:06,980 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@249a7748 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:34:06, skipping insertion in model container [2019-11-24 00:34:06,980 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 12:34:06" (1/1) ... [2019-11-24 00:34:06,988 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-24 00:34:07,039 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-24 00:34:07,532 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 00:34:07,541 INFO L203 MainTranslator]: Completed pre-run [2019-11-24 00:34:07,584 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 00:34:07,648 INFO L208 MainTranslator]: Completed translation [2019-11-24 00:34:07,648 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:34:07 WrapperNode [2019-11-24 00:34:07,649 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-24 00:34:07,650 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-24 00:34:07,650 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-24 00:34:07,650 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-24 00:34:07,658 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:34:07" (1/1) ... [2019-11-24 00:34:07,674 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:34:07" (1/1) ... [2019-11-24 00:34:07,710 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-24 00:34:07,710 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-24 00:34:07,710 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-24 00:34:07,711 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-24 00:34:07,719 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:34:07" (1/1) ... [2019-11-24 00:34:07,719 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:34:07" (1/1) ... [2019-11-24 00:34:07,723 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:34:07" (1/1) ... [2019-11-24 00:34:07,724 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:34:07" (1/1) ... [2019-11-24 00:34:07,734 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:34:07" (1/1) ... [2019-11-24 00:34:07,743 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:34:07" (1/1) ... [2019-11-24 00:34:07,745 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:34:07" (1/1) ... [2019-11-24 00:34:07,749 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-24 00:34:07,750 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-24 00:34:07,750 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-24 00:34:07,750 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-24 00:34:07,751 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:34:07" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-24 00:34:07,813 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-24 00:34:07,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-24 00:34:07,813 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-24 00:34:07,814 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-24 00:34:07,814 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-24 00:34:07,814 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-24 00:34:08,536 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-24 00:34:08,536 INFO L284 CfgBuilder]: Removed 34 assume(true) statements. [2019-11-24 00:34:08,538 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 12:34:08 BoogieIcfgContainer [2019-11-24 00:34:08,538 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-24 00:34:08,539 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-24 00:34:08,540 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-24 00:34:08,543 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-24 00:34:08,543 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 12:34:06" (1/3) ... [2019-11-24 00:34:08,544 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49f88eca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 12:34:08, skipping insertion in model container [2019-11-24 00:34:08,544 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:34:07" (2/3) ... [2019-11-24 00:34:08,545 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49f88eca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 12:34:08, skipping insertion in model container [2019-11-24 00:34:08,545 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 12:34:08" (3/3) ... [2019-11-24 00:34:08,547 INFO L109 eAbstractionObserver]: Analyzing ICFG sll-01-1.i [2019-11-24 00:34:08,557 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-24 00:34:08,565 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 13 error locations. [2019-11-24 00:34:08,578 INFO L249 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2019-11-24 00:34:08,605 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-24 00:34:08,606 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-24 00:34:08,606 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-24 00:34:08,606 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-24 00:34:08,606 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-24 00:34:08,606 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-24 00:34:08,607 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-24 00:34:08,607 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-24 00:34:08,627 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states. [2019-11-24 00:34:08,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-11-24 00:34:08,634 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 00:34:08,635 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-11-24 00:34:08,636 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 00:34:08,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 00:34:08,642 INFO L82 PathProgramCache]: Analyzing trace with hash 346217, now seen corresponding path program 1 times [2019-11-24 00:34:08,652 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 00:34:08,653 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332674222] [2019-11-24 00:34:08,653 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 00:34:08,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 00:34:08,805 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-24 00:34:08,806 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332674222] [2019-11-24 00:34:08,807 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 00:34:08,807 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 00:34:08,809 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970990987] [2019-11-24 00:34:08,815 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 00:34:08,815 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 00:34:08,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 00:34:08,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 00:34:08,829 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 3 states. [2019-11-24 00:34:08,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 00:34:08,902 INFO L93 Difference]: Finished difference Result 163 states and 262 transitions. [2019-11-24 00:34:08,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 00:34:08,904 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-11-24 00:34:08,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 00:34:08,916 INFO L225 Difference]: With dead ends: 163 [2019-11-24 00:34:08,917 INFO L226 Difference]: Without dead ends: 89 [2019-11-24 00:34:08,922 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-24 00:34:08,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-11-24 00:34:08,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 71. [2019-11-24 00:34:08,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-11-24 00:34:08,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 75 transitions. [2019-11-24 00:34:08,976 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 75 transitions. Word has length 3 [2019-11-24 00:34:08,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 00:34:08,976 INFO L462 AbstractCegarLoop]: Abstraction has 71 states and 75 transitions. [2019-11-24 00:34:08,976 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 00:34:08,977 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2019-11-24 00:34:08,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-24 00:34:08,977 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 00:34:08,977 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-24 00:34:08,978 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 00:34:08,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 00:34:08,979 INFO L82 PathProgramCache]: Analyzing trace with hash 2042521606, now seen corresponding path program 1 times [2019-11-24 00:34:08,979 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 00:34:08,979 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689984747] [2019-11-24 00:34:08,980 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 00:34:09,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 00:34:09,066 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-24 00:34:09,067 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689984747] [2019-11-24 00:34:09,067 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 00:34:09,067 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 00:34:09,067 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651441274] [2019-11-24 00:34:09,069 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 00:34:09,070 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 00:34:09,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 00:34:09,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 00:34:09,071 INFO L87 Difference]: Start difference. First operand 71 states and 75 transitions. Second operand 3 states. [2019-11-24 00:34:09,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 00:34:09,095 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2019-11-24 00:34:09,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 00:34:09,096 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-11-24 00:34:09,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 00:34:09,099 INFO L225 Difference]: With dead ends: 71 [2019-11-24 00:34:09,099 INFO L226 Difference]: Without dead ends: 69 [2019-11-24 00:34:09,101 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 00:34:09,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-11-24 00:34:09,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-11-24 00:34:09,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-11-24 00:34:09,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2019-11-24 00:34:09,150 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 7 [2019-11-24 00:34:09,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 00:34:09,150 INFO L462 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2019-11-24 00:34:09,151 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 00:34:09,151 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2019-11-24 00:34:09,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-24 00:34:09,152 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 00:34:09,152 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 00:34:09,154 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 00:34:09,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 00:34:09,155 INFO L82 PathProgramCache]: Analyzing trace with hash 1371678129, now seen corresponding path program 1 times [2019-11-24 00:34:09,156 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 00:34:09,156 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124351031] [2019-11-24 00:34:09,156 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 00:34:09,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 00:34:09,275 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-24 00:34:09,275 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124351031] [2019-11-24 00:34:09,275 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 00:34:09,276 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 00:34:09,277 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741725417] [2019-11-24 00:34:09,277 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 00:34:09,277 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 00:34:09,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 00:34:09,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 00:34:09,278 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand 3 states. [2019-11-24 00:34:09,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 00:34:09,355 INFO L93 Difference]: Finished difference Result 72 states and 77 transitions. [2019-11-24 00:34:09,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 00:34:09,356 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-11-24 00:34:09,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 00:34:09,357 INFO L225 Difference]: With dead ends: 72 [2019-11-24 00:34:09,357 INFO L226 Difference]: Without dead ends: 68 [2019-11-24 00:34:09,358 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 00:34:09,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-11-24 00:34:09,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 65. [2019-11-24 00:34:09,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-11-24 00:34:09,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2019-11-24 00:34:09,364 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 12 [2019-11-24 00:34:09,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 00:34:09,365 INFO L462 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2019-11-24 00:34:09,365 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 00:34:09,365 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2019-11-24 00:34:09,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-24 00:34:09,366 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 00:34:09,366 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 00:34:09,366 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 00:34:09,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 00:34:09,367 INFO L82 PathProgramCache]: Analyzing trace with hash -427646761, now seen corresponding path program 1 times [2019-11-24 00:34:09,367 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 00:34:09,367 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567003332] [2019-11-24 00:34:09,367 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 00:34:09,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 00:34:09,429 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-24 00:34:09,430 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567003332] [2019-11-24 00:34:09,430 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 00:34:09,430 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 00:34:09,430 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008398181] [2019-11-24 00:34:09,431 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 00:34:09,431 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 00:34:09,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 00:34:09,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 00:34:09,432 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand 5 states. [2019-11-24 00:34:09,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 00:34:09,557 INFO L93 Difference]: Finished difference Result 123 states and 131 transitions. [2019-11-24 00:34:09,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 00:34:09,558 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-11-24 00:34:09,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 00:34:09,559 INFO L225 Difference]: With dead ends: 123 [2019-11-24 00:34:09,559 INFO L226 Difference]: Without dead ends: 103 [2019-11-24 00:34:09,560 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-24 00:34:09,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-11-24 00:34:09,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 64. [2019-11-24 00:34:09,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-11-24 00:34:09,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 68 transitions. [2019-11-24 00:34:09,567 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 68 transitions. Word has length 13 [2019-11-24 00:34:09,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 00:34:09,568 INFO L462 AbstractCegarLoop]: Abstraction has 64 states and 68 transitions. [2019-11-24 00:34:09,568 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 00:34:09,568 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2019-11-24 00:34:09,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-24 00:34:09,569 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 00:34:09,569 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 00:34:09,569 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 00:34:09,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 00:34:09,570 INFO L82 PathProgramCache]: Analyzing trace with hash -1215610451, now seen corresponding path program 1 times [2019-11-24 00:34:09,570 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 00:34:09,571 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205569305] [2019-11-24 00:34:09,571 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 00:34:09,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 00:34:09,640 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-24 00:34:09,641 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205569305] [2019-11-24 00:34:09,641 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 00:34:09,641 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 00:34:09,641 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221953062] [2019-11-24 00:34:09,645 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 00:34:09,645 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 00:34:09,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 00:34:09,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 00:34:09,646 INFO L87 Difference]: Start difference. First operand 64 states and 68 transitions. Second operand 3 states. [2019-11-24 00:34:09,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 00:34:09,672 INFO L93 Difference]: Finished difference Result 89 states and 96 transitions. [2019-11-24 00:34:09,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 00:34:09,673 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-24 00:34:09,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 00:34:09,674 INFO L225 Difference]: With dead ends: 89 [2019-11-24 00:34:09,674 INFO L226 Difference]: Without dead ends: 87 [2019-11-24 00:34:09,675 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 00:34:09,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-11-24 00:34:09,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 66. [2019-11-24 00:34:09,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-11-24 00:34:09,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 71 transitions. [2019-11-24 00:34:09,685 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 71 transitions. Word has length 17 [2019-11-24 00:34:09,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 00:34:09,686 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 71 transitions. [2019-11-24 00:34:09,686 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 00:34:09,686 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 71 transitions. [2019-11-24 00:34:09,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-24 00:34:09,687 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 00:34:09,687 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 00:34:09,688 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 00:34:09,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 00:34:09,689 INFO L82 PathProgramCache]: Analyzing trace with hash -1215610353, now seen corresponding path program 1 times [2019-11-24 00:34:09,689 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 00:34:09,689 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471013887] [2019-11-24 00:34:09,690 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 00:34:09,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 00:34:09,741 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-24 00:34:09,741 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471013887] [2019-11-24 00:34:09,741 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 00:34:09,742 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 00:34:09,742 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667016598] [2019-11-24 00:34:09,742 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 00:34:09,742 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 00:34:09,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 00:34:09,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 00:34:09,743 INFO L87 Difference]: Start difference. First operand 66 states and 71 transitions. Second operand 3 states. [2019-11-24 00:34:09,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 00:34:09,758 INFO L93 Difference]: Finished difference Result 66 states and 71 transitions. [2019-11-24 00:34:09,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 00:34:09,759 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-24 00:34:09,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 00:34:09,760 INFO L225 Difference]: With dead ends: 66 [2019-11-24 00:34:09,760 INFO L226 Difference]: Without dead ends: 64 [2019-11-24 00:34:09,760 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 00:34:09,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-11-24 00:34:09,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-11-24 00:34:09,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-11-24 00:34:09,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 69 transitions. [2019-11-24 00:34:09,766 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 69 transitions. Word has length 17 [2019-11-24 00:34:09,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 00:34:09,766 INFO L462 AbstractCegarLoop]: Abstraction has 64 states and 69 transitions. [2019-11-24 00:34:09,766 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 00:34:09,767 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 69 transitions. [2019-11-24 00:34:09,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-24 00:34:09,767 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 00:34:09,768 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 00:34:09,768 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 00:34:09,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 00:34:09,768 INFO L82 PathProgramCache]: Analyzing trace with hash 23914177, now seen corresponding path program 1 times [2019-11-24 00:34:09,769 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 00:34:09,769 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392876380] [2019-11-24 00:34:09,769 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 00:34:09,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 00:34:09,850 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-24 00:34:09,851 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392876380] [2019-11-24 00:34:09,851 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 00:34:09,851 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 00:34:09,851 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611441144] [2019-11-24 00:34:09,853 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 00:34:09,853 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 00:34:09,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 00:34:09,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 00:34:09,854 INFO L87 Difference]: Start difference. First operand 64 states and 69 transitions. Second operand 3 states. [2019-11-24 00:34:09,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 00:34:09,862 INFO L93 Difference]: Finished difference Result 64 states and 69 transitions. [2019-11-24 00:34:09,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 00:34:09,863 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-11-24 00:34:09,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 00:34:09,864 INFO L225 Difference]: With dead ends: 64 [2019-11-24 00:34:09,864 INFO L226 Difference]: Without dead ends: 62 [2019-11-24 00:34:09,864 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 00:34:09,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-11-24 00:34:09,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-11-24 00:34:09,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-11-24 00:34:09,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 67 transitions. [2019-11-24 00:34:09,880 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 67 transitions. Word has length 18 [2019-11-24 00:34:09,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 00:34:09,880 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 67 transitions. [2019-11-24 00:34:09,880 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 00:34:09,881 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 67 transitions. [2019-11-24 00:34:09,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-24 00:34:09,881 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 00:34:09,881 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] [2019-11-24 00:34:09,882 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 00:34:09,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 00:34:09,882 INFO L82 PathProgramCache]: Analyzing trace with hash 920308016, now seen corresponding path program 1 times [2019-11-24 00:34:09,882 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 00:34:09,885 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239892722] [2019-11-24 00:34:09,885 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 00:34:09,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 00:34:10,224 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-24 00:34:10,224 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239892722] [2019-11-24 00:34:10,225 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 00:34:10,225 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-24 00:34:10,225 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344659186] [2019-11-24 00:34:10,226 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-24 00:34:10,226 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 00:34:10,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-24 00:34:10,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-24 00:34:10,227 INFO L87 Difference]: Start difference. First operand 62 states and 67 transitions. Second operand 8 states. [2019-11-24 00:34:10,449 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 46 [2019-11-24 00:34:10,647 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 60 [2019-11-24 00:34:11,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 00:34:11,281 INFO L93 Difference]: Finished difference Result 148 states and 161 transitions. [2019-11-24 00:34:11,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-24 00:34:11,282 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2019-11-24 00:34:11,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 00:34:11,285 INFO L225 Difference]: With dead ends: 148 [2019-11-24 00:34:11,286 INFO L226 Difference]: Without dead ends: 146 [2019-11-24 00:34:11,287 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2019-11-24 00:34:11,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-11-24 00:34:11,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 79. [2019-11-24 00:34:11,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-11-24 00:34:11,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 88 transitions. [2019-11-24 00:34:11,306 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 88 transitions. Word has length 20 [2019-11-24 00:34:11,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 00:34:11,306 INFO L462 AbstractCegarLoop]: Abstraction has 79 states and 88 transitions. [2019-11-24 00:34:11,306 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-24 00:34:11,306 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 88 transitions. [2019-11-24 00:34:11,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-24 00:34:11,307 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 00:34:11,307 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] [2019-11-24 00:34:11,308 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 00:34:11,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 00:34:11,308 INFO L82 PathProgramCache]: Analyzing trace with hash -1540506575, now seen corresponding path program 1 times [2019-11-24 00:34:11,308 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 00:34:11,309 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850167105] [2019-11-24 00:34:11,309 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 00:34:11,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 00:34:11,389 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-24 00:34:11,390 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850167105] [2019-11-24 00:34:11,390 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 00:34:11,390 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 00:34:11,390 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596462489] [2019-11-24 00:34:11,391 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 00:34:11,391 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 00:34:11,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 00:34:11,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 00:34:11,392 INFO L87 Difference]: Start difference. First operand 79 states and 88 transitions. Second operand 3 states. [2019-11-24 00:34:11,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 00:34:11,454 INFO L93 Difference]: Finished difference Result 79 states and 88 transitions. [2019-11-24 00:34:11,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 00:34:11,455 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-24 00:34:11,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 00:34:11,455 INFO L225 Difference]: With dead ends: 79 [2019-11-24 00:34:11,456 INFO L226 Difference]: Without dead ends: 77 [2019-11-24 00:34:11,456 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 00:34:11,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-11-24 00:34:11,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-11-24 00:34:11,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-11-24 00:34:11,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 86 transitions. [2019-11-24 00:34:11,464 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 86 transitions. Word has length 23 [2019-11-24 00:34:11,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 00:34:11,464 INFO L462 AbstractCegarLoop]: Abstraction has 77 states and 86 transitions. [2019-11-24 00:34:11,464 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 00:34:11,465 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 86 transitions. [2019-11-24 00:34:11,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-24 00:34:11,471 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 00:34:11,471 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] [2019-11-24 00:34:11,471 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 00:34:11,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 00:34:11,471 INFO L82 PathProgramCache]: Analyzing trace with hash 2123966529, now seen corresponding path program 1 times [2019-11-24 00:34:11,472 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 00:34:11,472 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141205351] [2019-11-24 00:34:11,472 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 00:34:11,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 00:34:11,742 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-24 00:34:11,742 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141205351] [2019-11-24 00:34:11,742 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 00:34:11,743 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-24 00:34:11,743 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009707850] [2019-11-24 00:34:11,743 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-24 00:34:11,744 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 00:34:11,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-24 00:34:11,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-24 00:34:11,744 INFO L87 Difference]: Start difference. First operand 77 states and 86 transitions. Second operand 8 states. [2019-11-24 00:34:12,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 00:34:12,631 INFO L93 Difference]: Finished difference Result 151 states and 164 transitions. [2019-11-24 00:34:12,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-24 00:34:12,631 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2019-11-24 00:34:12,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 00:34:12,633 INFO L225 Difference]: With dead ends: 151 [2019-11-24 00:34:12,633 INFO L226 Difference]: Without dead ends: 149 [2019-11-24 00:34:12,633 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2019-11-24 00:34:12,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-11-24 00:34:12,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 84. [2019-11-24 00:34:12,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-11-24 00:34:12,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 93 transitions. [2019-11-24 00:34:12,641 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 93 transitions. Word has length 23 [2019-11-24 00:34:12,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 00:34:12,642 INFO L462 AbstractCegarLoop]: Abstraction has 84 states and 93 transitions. [2019-11-24 00:34:12,642 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-24 00:34:12,642 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 93 transitions. [2019-11-24 00:34:12,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-24 00:34:12,643 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 00:34:12,643 INFO L410 BasicCegarLoop]: trace histogram [2, 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-24 00:34:12,643 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 00:34:12,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 00:34:12,644 INFO L82 PathProgramCache]: Analyzing trace with hash 22826498, now seen corresponding path program 1 times [2019-11-24 00:34:12,644 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 00:34:12,644 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403162386] [2019-11-24 00:34:12,644 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 00:34:12,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 00:34:12,727 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 00:34:12,727 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403162386] [2019-11-24 00:34:12,728 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2125820905] [2019-11-24 00:34:12,728 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-24 00:34:12,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 00:34:12,800 INFO L255 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 23 conjunts are in the unsatisfiable core [2019-11-24 00:34:12,807 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-24 00:34:12,902 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 00:34:12,903 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 25 [2019-11-24 00:34:12,904 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-24 00:34:12,936 INFO L567 ElimStorePlain]: treesize reduction 10, result has 80.0 percent of original size [2019-11-24 00:34:12,944 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-24 00:34:12,945 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-24 00:34:12,955 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 00:34:12,959 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-24 00:34:12,959 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-24 00:34:12,996 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 00:34:12,996 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-24 00:34:12,997 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:35, output treesize:32 [2019-11-24 00:34:13,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:34:13,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:34:13,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:34:13,066 INFO L392 ElimStorePlain]: Different costs {0=[v_prenex_3], 1=[v_prenex_6, |v_#valid_30|], 3=[v_prenex_10]} [2019-11-24 00:34:13,116 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 50 [2019-11-24 00:34:13,116 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-24 00:34:16,445 WARN L192 SmtUtils]: Spent 3.33 s on a formula simplification. DAG size of input: 128 DAG size of output: 126 [2019-11-24 00:34:16,447 INFO L567 ElimStorePlain]: treesize reduction 4, result has 99.5 percent of original size [2019-11-24 00:34:16,526 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 00:34:16,527 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 58 [2019-11-24 00:34:16,528 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-24 00:34:18,127 WARN L192 SmtUtils]: Spent 1.60 s on a formula simplification that was a NOOP. DAG size: 122 [2019-11-24 00:34:18,127 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 00:34:18,178 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 00:34:18,179 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 373 treesize of output 377 [2019-11-24 00:34:18,180 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-24 00:34:19,420 WARN L192 SmtUtils]: Spent 1.24 s on a formula simplification that was a NOOP. DAG size: 119 [2019-11-24 00:34:19,421 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 00:34:19,528 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 00:34:19,529 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 379 treesize of output 389 [2019-11-24 00:34:19,530 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-24 00:34:20,756 WARN L192 SmtUtils]: Spent 1.23 s on a formula simplification that was a NOOP. DAG size: 113 [2019-11-24 00:34:20,757 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 00:34:20,763 INFO L392 ElimStorePlain]: Different costs {2=[v_prenex_1, v_prenex_2, v_prenex_4, v_prenex_5], 16=[v_prenex_8, v_prenex_9, |v_#memory_$Pointer$.base_48|, |v_#memory_$Pointer$.offset_48|]} [2019-11-24 00:34:20,786 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-24 00:34:20,800 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 46 [2019-11-24 00:34:20,801 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-24 00:34:22,000 WARN L192 SmtUtils]: Spent 1.20 s on a formula simplification that was a NOOP. DAG size: 111 [2019-11-24 00:34:22,001 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 00:34:22,013 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-24 00:34:22,025 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 42 [2019-11-24 00:34:22,026 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-24 00:34:23,792 WARN L192 SmtUtils]: Spent 1.77 s on a formula simplification. DAG size of input: 109 DAG size of output: 107 [2019-11-24 00:34:23,793 INFO L567 ElimStorePlain]: treesize reduction 8, result has 99.0 percent of original size [2019-11-24 00:34:23,834 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-24 00:34:23,868 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 43 [2019-11-24 00:34:23,869 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-24 00:34:24,458 WARN L192 SmtUtils]: Spent 588.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2019-11-24 00:34:24,458 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 00:34:24,486 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-24 00:34:24,520 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 39 [2019-11-24 00:34:24,521 INFO L496 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-11-24 00:34:25,525 WARN L192 SmtUtils]: Spent 1.00 s on a formula simplification. DAG size of input: 93 DAG size of output: 88 [2019-11-24 00:34:25,526 INFO L567 ElimStorePlain]: treesize reduction 47, result has 94.2 percent of original size [2019-11-24 00:34:25,531 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-24 00:34:25,544 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-24 00:34:25,704 WARN L192 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 38 [2019-11-24 00:34:25,705 INFO L343 Elim1Store]: treesize reduction 226, result has 38.6 percent of original size [2019-11-24 00:34:25,706 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 162 treesize of output 272 [2019-11-24 00:34:25,707 INFO L496 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-11-24 00:34:26,538 WARN L192 SmtUtils]: Spent 829.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 78 [2019-11-24 00:34:26,538 INFO L567 ElimStorePlain]: treesize reduction 118, result has 82.4 percent of original size [2019-11-24 00:34:26,543 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-24 00:34:26,551 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-24 00:34:26,557 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-24 00:34:26,591 INFO L343 Elim1Store]: treesize reduction 18, result has 64.7 percent of original size [2019-11-24 00:34:26,592 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 79 treesize of output 87 [2019-11-24 00:34:26,593 INFO L496 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-11-24 00:34:26,948 WARN L192 SmtUtils]: Spent 354.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 68 [2019-11-24 00:34:26,949 INFO L567 ElimStorePlain]: treesize reduction 16, result has 96.7 percent of original size [2019-11-24 00:34:26,953 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-24 00:34:26,958 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-24 00:34:27,088 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 38 [2019-11-24 00:34:27,088 INFO L343 Elim1Store]: treesize reduction 226, result has 38.6 percent of original size [2019-11-24 00:34:27,089 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 161 treesize of output 271 [2019-11-24 00:34:27,090 INFO L496 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-11-24 00:34:27,275 WARN L192 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 58 [2019-11-24 00:34:27,276 INFO L567 ElimStorePlain]: treesize reduction 118, result has 68.4 percent of original size [2019-11-24 00:34:27,280 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-24 00:34:27,283 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-24 00:34:27,286 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-24 00:34:27,322 INFO L343 Elim1Store]: treesize reduction 18, result has 64.7 percent of original size [2019-11-24 00:34:27,323 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 78 treesize of output 86 [2019-11-24 00:34:27,324 INFO L496 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-11-24 00:34:27,465 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 48 [2019-11-24 00:34:27,466 INFO L567 ElimStorePlain]: treesize reduction 16, result has 91.5 percent of original size [2019-11-24 00:34:27,468 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-1 vars, 8 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-11-24 00:34:27,469 INFO L221 ElimStorePlain]: Needed 13 recursive calls to eliminate 14 variables, input treesize:863, output treesize:202 [2019-11-24 00:34:27,795 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2019-11-24 00:34:27,796 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-24 00:34:27,804 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 00:34:27,809 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 00:34:27,809 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2019-11-24 00:34:27,810 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-24 00:34:27,813 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 00:34:27,814 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-24 00:34:27,814 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:43, output treesize:7 [2019-11-24 00:34:27,821 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 00:34:27,821 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-24 00:34:27,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:34:27,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:34:27,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:34:29,948 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse7 (+ c_ULTIMATE.start_main_~list~0.offset 4))) (and (forall ((|v_ULTIMATE.start_main_#t~malloc2.base_10| Int)) (let ((.cse3 (+ c_ULTIMATE.start_main_~list~0.offset 4))) (let ((.cse4 (let ((.cse6 (store |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~list~0.base (store (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~list~0.base) .cse3 0)))) (store .cse6 |v_ULTIMATE.start_main_#t~malloc2.base_10| (store (select .cse6 |v_ULTIMATE.start_main_#t~malloc2.base_10|) 0 0)))) (.cse0 (let ((.cse5 (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~list~0.base (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~list~0.base) .cse3 |v_ULTIMATE.start_main_#t~malloc2.base_10|)))) (store .cse5 |v_ULTIMATE.start_main_#t~malloc2.base_10| (store (select .cse5 |v_ULTIMATE.start_main_#t~malloc2.base_10|) 0 0))))) (let ((.cse1 (select (select .cse0 c_ULTIMATE.start_main_~list~0.base) .cse3)) (.cse2 (+ (select (select .cse4 c_ULTIMATE.start_main_~list~0.base) .cse3) 4))) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc2.base_10|))) (not (= 0 (select (select (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 0)) c_ULTIMATE.start_main_~list~0.base) .cse3))) (= 0 |v_ULTIMATE.start_main_#t~malloc2.base_10|) (= (select (select (store .cse4 .cse1 (store (select .cse4 .cse1) .cse2 0)) c_ULTIMATE.start_main_~list~0.base) c_ULTIMATE.start_main_~list~0.offset) 0)))))) (= (select (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~list~0.base) .cse7 0) c_ULTIMATE.start_main_~list~0.offset) 0) (forall ((v_prenex_11 Int)) (let ((.cse9 (+ c_ULTIMATE.start_main_~list~0.offset 4))) (let ((.cse8 (select (let ((.cse10 (let ((.cse13 (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~list~0.base (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~list~0.base) .cse9 v_prenex_11)))) (store .cse13 v_prenex_11 (store (select .cse13 v_prenex_11) 0 0))))) (let ((.cse11 (select (select .cse10 c_ULTIMATE.start_main_~list~0.base) .cse9))) (store .cse10 .cse11 (store (select .cse10 .cse11) (+ (select (select (let ((.cse12 (store |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~list~0.base (store (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~list~0.base) .cse9 0)))) (store .cse12 v_prenex_11 (store (select .cse12 v_prenex_11) 0 0))) c_ULTIMATE.start_main_~list~0.base) .cse9) 4) 0)))) c_ULTIMATE.start_main_~list~0.base))) (or (= 0 v_prenex_11) (= (select .cse8 c_ULTIMATE.start_main_~list~0.offset) 0) (not (= 0 (select .cse8 .cse9))) (not (= 0 (select |c_#valid| v_prenex_11))))))) (= (select (store (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~list~0.base) .cse7 0) c_ULTIMATE.start_main_~list~0.offset) 0))) is different from false [2019-11-24 00:34:29,969 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 00:34:29,969 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [122548384] [2019-11-24 00:34:29,994 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2019-11-24 00:34:29,995 INFO L166 IcfgInterpreter]: Building call graph [2019-11-24 00:34:30,001 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-11-24 00:34:30,008 INFO L176 IcfgInterpreter]: Starting interpretation [2019-11-24 00:34:30,009 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-11-24 00:34:30,185 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-24 00:34:30,361 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-24 00:34:30,678 INFO L180 IcfgInterpreter]: Interpretation finished [2019-11-24 00:34:31,133 WARN L192 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 63 [2019-11-24 00:34:31,762 WARN L192 SmtUtils]: Spent 576.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 78 [2019-11-24 00:34:32,220 WARN L192 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 68 [2019-11-24 00:34:32,642 WARN L192 SmtUtils]: Spent 358.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 74 [2019-11-24 00:34:33,184 WARN L192 SmtUtils]: Spent 420.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 82 [2019-11-24 00:34:33,817 WARN L192 SmtUtils]: Spent 558.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 82 [2019-11-24 00:34:34,328 WARN L192 SmtUtils]: Spent 392.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 58 [2019-11-24 00:34:35,085 WARN L192 SmtUtils]: Spent 477.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 78 [2019-11-24 00:34:35,674 WARN L192 SmtUtils]: Spent 498.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 87 [2019-11-24 00:34:35,676 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2019-11-24 00:34:35,676 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [5, 7, 7] total 24 [2019-11-24 00:34:35,678 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128064593] [2019-11-24 00:34:35,679 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-24 00:34:35,679 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 00:34:35,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-24 00:34:35,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=379, Unknown=1, NotChecked=44, Total=600 [2019-11-24 00:34:35,680 INFO L87 Difference]: Start difference. First operand 84 states and 93 transitions. Second operand 12 states. [2019-11-24 00:34:36,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 00:34:36,308 INFO L93 Difference]: Finished difference Result 162 states and 178 transitions. [2019-11-24 00:34:36,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-24 00:34:36,309 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 25 [2019-11-24 00:34:36,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 00:34:36,310 INFO L225 Difference]: With dead ends: 162 [2019-11-24 00:34:36,310 INFO L226 Difference]: Without dead ends: 160 [2019-11-24 00:34:36,311 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 48 SyntacticMatches, 7 SemanticMatches, 23 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=176, Invalid=379, Unknown=1, NotChecked=44, Total=600 [2019-11-24 00:34:36,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-11-24 00:34:36,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 93. [2019-11-24 00:34:36,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-11-24 00:34:36,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 104 transitions. [2019-11-24 00:34:36,319 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 104 transitions. Word has length 25 [2019-11-24 00:34:36,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 00:34:36,319 INFO L462 AbstractCegarLoop]: Abstraction has 93 states and 104 transitions. [2019-11-24 00:34:36,319 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-24 00:34:36,319 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 104 transitions. [2019-11-24 00:34:36,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-24 00:34:36,320 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 00:34:36,320 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] [2019-11-24 00:34:36,524 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-24 00:34:36,524 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 00:34:36,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 00:34:36,525 INFO L82 PathProgramCache]: Analyzing trace with hash -1501634328, now seen corresponding path program 1 times [2019-11-24 00:34:36,525 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 00:34:36,525 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105828404] [2019-11-24 00:34:36,525 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 00:34:36,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 00:34:36,739 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 00:34:36,739 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105828404] [2019-11-24 00:34:36,739 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [122205552] [2019-11-24 00:34:36,740 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-24 00:34:36,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 00:34:36,813 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 25 conjunts are in the unsatisfiable core [2019-11-24 00:34:36,815 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-24 00:34:36,903 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 00:34:36,903 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-24 00:34:36,966 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 00:34:36,966 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-11-24 00:34:36,966 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 6] total 13 [2019-11-24 00:34:36,967 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759446852] [2019-11-24 00:34:36,967 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-24 00:34:36,967 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 00:34:36,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-24 00:34:36,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-11-24 00:34:36,968 INFO L87 Difference]: Start difference. First operand 93 states and 104 transitions. Second operand 6 states. [2019-11-24 00:34:37,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 00:34:37,196 INFO L93 Difference]: Finished difference Result 155 states and 173 transitions. [2019-11-24 00:34:37,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-24 00:34:37,197 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2019-11-24 00:34:37,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 00:34:37,198 INFO L225 Difference]: With dead ends: 155 [2019-11-24 00:34:37,198 INFO L226 Difference]: Without dead ends: 139 [2019-11-24 00:34:37,199 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2019-11-24 00:34:37,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-11-24 00:34:37,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 112. [2019-11-24 00:34:37,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-11-24 00:34:37,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 130 transitions. [2019-11-24 00:34:37,209 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 130 transitions. Word has length 26 [2019-11-24 00:34:37,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 00:34:37,209 INFO L462 AbstractCegarLoop]: Abstraction has 112 states and 130 transitions. [2019-11-24 00:34:37,209 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-24 00:34:37,209 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 130 transitions. [2019-11-24 00:34:37,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-24 00:34:37,212 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 00:34:37,212 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] [2019-11-24 00:34:37,416 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-24 00:34:37,417 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 00:34:37,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 00:34:37,418 INFO L82 PathProgramCache]: Analyzing trace with hash -923049550, now seen corresponding path program 1 times [2019-11-24 00:34:37,418 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 00:34:37,418 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695226107] [2019-11-24 00:34:37,419 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 00:34:37,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 00:34:37,465 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 00:34:37,466 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695226107] [2019-11-24 00:34:37,466 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [929768481] [2019-11-24 00:34:37,466 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-24 00:34:37,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 00:34:37,541 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-24 00:34:37,544 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-24 00:34:37,551 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 00:34:37,551 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-24 00:34:37,556 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 00:34:37,556 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [301403052] [2019-11-24 00:34:37,560 INFO L159 IcfgInterpreter]: Started Sifa with 27 locations of interest [2019-11-24 00:34:37,561 INFO L166 IcfgInterpreter]: Building call graph [2019-11-24 00:34:37,561 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-11-24 00:34:37,562 INFO L176 IcfgInterpreter]: Starting interpretation [2019-11-24 00:34:37,563 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-11-24 00:34:37,717 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-24 00:34:37,888 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-24 00:34:38,204 INFO L180 IcfgInterpreter]: Interpretation finished [2019-11-24 00:34:38,618 WARN L192 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 63 [2019-11-24 00:34:39,163 WARN L192 SmtUtils]: Spent 520.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 78 [2019-11-24 00:34:39,536 WARN L192 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 68 [2019-11-24 00:34:39,900 WARN L192 SmtUtils]: Spent 331.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 74 [2019-11-24 00:34:40,549 WARN L192 SmtUtils]: Spent 541.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 116 [2019-11-24 00:34:41,312 WARN L192 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 91 [2019-11-24 00:34:41,314 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2019-11-24 00:34:41,314 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [4, 4, 4] total 18 [2019-11-24 00:34:41,315 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18286085] [2019-11-24 00:34:41,315 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-24 00:34:41,316 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 00:34:41,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-24 00:34:41,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=237, Unknown=0, NotChecked=0, Total=306 [2019-11-24 00:34:41,317 INFO L87 Difference]: Start difference. First operand 112 states and 130 transitions. Second operand 15 states. [2019-11-24 00:34:41,937 WARN L192 SmtUtils]: Spent 387.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 117 [2019-11-24 00:34:42,352 WARN L192 SmtUtils]: Spent 370.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 116 [2019-11-24 00:34:42,790 WARN L192 SmtUtils]: Spent 383.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 92 [2019-11-24 00:34:43,310 WARN L192 SmtUtils]: Spent 399.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 96 [2019-11-24 00:34:43,843 WARN L192 SmtUtils]: Spent 402.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 96 [2019-11-24 00:34:44,425 WARN L192 SmtUtils]: Spent 463.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 102 [2019-11-24 00:34:44,974 WARN L192 SmtUtils]: Spent 425.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 100 [2019-11-24 00:34:45,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 00:34:45,308 INFO L93 Difference]: Finished difference Result 234 states and 270 transitions. [2019-11-24 00:34:45,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-24 00:34:45,309 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2019-11-24 00:34:45,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 00:34:45,310 INFO L225 Difference]: With dead ends: 234 [2019-11-24 00:34:45,310 INFO L226 Difference]: Without dead ends: 186 [2019-11-24 00:34:45,311 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 61 SyntacticMatches, 6 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=153, Invalid=497, Unknown=0, NotChecked=0, Total=650 [2019-11-24 00:34:45,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-11-24 00:34:45,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 105. [2019-11-24 00:34:45,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-11-24 00:34:45,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 121 transitions. [2019-11-24 00:34:45,322 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 121 transitions. Word has length 27 [2019-11-24 00:34:45,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 00:34:45,323 INFO L462 AbstractCegarLoop]: Abstraction has 105 states and 121 transitions. [2019-11-24 00:34:45,323 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-24 00:34:45,323 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 121 transitions. [2019-11-24 00:34:45,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-24 00:34:45,323 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 00:34:45,324 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-24 00:34:45,528 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-24 00:34:45,531 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 00:34:45,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 00:34:45,532 INFO L82 PathProgramCache]: Analyzing trace with hash 1423481391, now seen corresponding path program 1 times [2019-11-24 00:34:45,532 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 00:34:45,532 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974187802] [2019-11-24 00:34:45,533 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 00:34:45,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 00:34:45,616 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 00:34:45,617 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974187802] [2019-11-24 00:34:45,617 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1501233991] [2019-11-24 00:34:45,617 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-24 00:34:45,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 00:34:45,673 INFO L255 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 23 conjunts are in the unsatisfiable core [2019-11-24 00:34:45,682 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-24 00:34:49,384 WARN L192 SmtUtils]: Spent 3.42 s on a formula simplification. DAG size of input: 128 DAG size of output: 126 [2019-11-24 00:34:50,898 WARN L192 SmtUtils]: Spent 1.44 s on a formula simplification that was a NOOP. DAG size: 123 [2019-11-24 00:34:52,504 WARN L192 SmtUtils]: Spent 1.52 s on a formula simplification that was a NOOP. DAG size: 119 [2019-11-24 00:34:53,902 WARN L192 SmtUtils]: Spent 1.29 s on a formula simplification that was a NOOP. DAG size: 113 [2019-11-24 00:34:55,458 WARN L192 SmtUtils]: Spent 1.35 s on a formula simplification that was a NOOP. DAG size: 111 [2019-11-24 00:34:56,608 WARN L192 SmtUtils]: Spent 1.12 s on a formula simplification that was a NOOP. DAG size: 104 [2019-11-24 00:34:58,163 WARN L192 SmtUtils]: Spent 1.43 s on a formula simplification. DAG size of input: 102 DAG size of output: 100 [2019-11-24 00:34:59,102 WARN L192 SmtUtils]: Spent 864.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 88 [2019-11-24 00:34:59,225 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 38 [2019-11-24 00:34:59,754 WARN L192 SmtUtils]: Spent 527.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 78 [2019-11-24 00:35:00,095 WARN L192 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 68 [2019-11-24 00:35:00,211 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 38 [2019-11-24 00:35:00,427 WARN L192 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 58 [2019-11-24 00:35:00,625 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 48 [2019-11-24 00:35:00,946 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 00:35:00,946 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-24 00:35:03,505 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 00:35:03,505 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1828053916] [2019-11-24 00:35:03,506 INFO L159 IcfgInterpreter]: Started Sifa with 27 locations of interest [2019-11-24 00:35:03,507 INFO L166 IcfgInterpreter]: Building call graph [2019-11-24 00:35:03,507 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-11-24 00:35:03,507 INFO L176 IcfgInterpreter]: Starting interpretation [2019-11-24 00:35:03,508 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-11-24 00:35:03,570 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-24 00:35:03,711 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-24 00:35:03,990 INFO L180 IcfgInterpreter]: Interpretation finished [2019-11-24 00:35:04,408 WARN L192 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 63 [2019-11-24 00:35:04,982 WARN L192 SmtUtils]: Spent 526.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 78 [2019-11-24 00:35:05,416 WARN L192 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 68 [2019-11-24 00:35:05,815 WARN L192 SmtUtils]: Spent 326.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 74 [2019-11-24 00:35:06,344 WARN L192 SmtUtils]: Spent 406.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 82 [2019-11-24 00:35:06,962 WARN L192 SmtUtils]: Spent 542.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 82 [2019-11-24 00:35:07,433 WARN L192 SmtUtils]: Spent 389.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 58 [2019-11-24 00:35:08,152 WARN L192 SmtUtils]: Spent 462.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 78 [2019-11-24 00:35:08,739 WARN L192 SmtUtils]: Spent 486.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 87 [2019-11-24 00:35:09,547 WARN L192 SmtUtils]: Spent 518.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 86 [2019-11-24 00:35:09,548 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2019-11-24 00:35:09,549 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [5, 7, 7] total 24 [2019-11-24 00:35:09,549 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857226108] [2019-11-24 00:35:09,550 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-24 00:35:09,550 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 00:35:09,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-24 00:35:09,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=409, Unknown=0, NotChecked=0, Total=600 [2019-11-24 00:35:09,551 INFO L87 Difference]: Start difference. First operand 105 states and 121 transitions. Second operand 13 states. [2019-11-24 00:35:10,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 00:35:10,097 INFO L93 Difference]: Finished difference Result 191 states and 218 transitions. [2019-11-24 00:35:10,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-24 00:35:10,097 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 28 [2019-11-24 00:35:10,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 00:35:10,099 INFO L225 Difference]: With dead ends: 191 [2019-11-24 00:35:10,099 INFO L226 Difference]: Without dead ends: 189 [2019-11-24 00:35:10,100 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 54 SyntacticMatches, 10 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=191, Invalid=409, Unknown=0, NotChecked=0, Total=600 [2019-11-24 00:35:10,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-11-24 00:35:10,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 108. [2019-11-24 00:35:10,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-11-24 00:35:10,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 124 transitions. [2019-11-24 00:35:10,111 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 124 transitions. Word has length 28 [2019-11-24 00:35:10,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 00:35:10,112 INFO L462 AbstractCegarLoop]: Abstraction has 108 states and 124 transitions. [2019-11-24 00:35:10,112 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-24 00:35:10,112 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 124 transitions. [2019-11-24 00:35:10,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-24 00:35:10,112 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 00:35:10,113 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-24 00:35:10,315 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-24 00:35:10,316 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 00:35:10,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 00:35:10,317 INFO L82 PathProgramCache]: Analyzing trace with hash -2073087843, now seen corresponding path program 1 times [2019-11-24 00:35:10,317 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 00:35:10,317 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520538665] [2019-11-24 00:35:10,317 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 00:35:10,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 00:35:10,411 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 00:35:10,411 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520538665] [2019-11-24 00:35:10,411 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1666119268] [2019-11-24 00:35:10,411 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-24 00:35:10,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 00:35:10,470 INFO L255 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 21 conjunts are in the unsatisfiable core [2019-11-24 00:35:10,472 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-24 00:35:10,510 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 00:35:10,511 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-24 00:35:10,550 WARN L227 Elim1Store]: Array PQE input equivalent to true [2019-11-24 00:35:10,566 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 00:35:10,566 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2079613653] [2019-11-24 00:35:10,568 INFO L159 IcfgInterpreter]: Started Sifa with 27 locations of interest [2019-11-24 00:35:10,568 INFO L166 IcfgInterpreter]: Building call graph [2019-11-24 00:35:10,569 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-11-24 00:35:10,569 INFO L176 IcfgInterpreter]: Starting interpretation [2019-11-24 00:35:10,569 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-11-24 00:35:10,634 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-24 00:35:10,766 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-24 00:35:10,996 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-24 00:35:11,046 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-24 00:35:11,120 INFO L180 IcfgInterpreter]: Interpretation finished [2019-11-24 00:35:11,547 WARN L192 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 63 [2019-11-24 00:35:12,102 WARN L192 SmtUtils]: Spent 515.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 78 [2019-11-24 00:35:12,511 WARN L192 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 68 [2019-11-24 00:35:12,879 WARN L192 SmtUtils]: Spent 325.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 74 [2019-11-24 00:35:13,374 WARN L192 SmtUtils]: Spent 401.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 82 [2019-11-24 00:35:13,973 WARN L192 SmtUtils]: Spent 538.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 82 [2019-11-24 00:35:14,426 WARN L192 SmtUtils]: Spent 382.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 58 [2019-11-24 00:35:14,976 WARN L192 SmtUtils]: Spent 342.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 73 [2019-11-24 00:35:15,208 WARN L192 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 51 [2019-11-24 00:35:15,274 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2019-11-24 00:35:15,274 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [6, 6, 6] total 18 [2019-11-24 00:35:15,275 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782624404] [2019-11-24 00:35:15,276 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-24 00:35:15,276 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 00:35:15,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-24 00:35:15,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2019-11-24 00:35:15,277 INFO L87 Difference]: Start difference. First operand 108 states and 124 transitions. Second operand 12 states. [2019-11-24 00:35:15,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 00:35:15,870 INFO L93 Difference]: Finished difference Result 198 states and 224 transitions. [2019-11-24 00:35:15,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-24 00:35:15,870 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 29 [2019-11-24 00:35:15,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 00:35:15,871 INFO L225 Difference]: With dead ends: 198 [2019-11-24 00:35:15,872 INFO L226 Difference]: Without dead ends: 137 [2019-11-24 00:35:15,872 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 67 SyntacticMatches, 8 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2019-11-24 00:35:15,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-11-24 00:35:15,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 96. [2019-11-24 00:35:15,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-11-24 00:35:15,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 109 transitions. [2019-11-24 00:35:15,881 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 109 transitions. Word has length 29 [2019-11-24 00:35:15,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 00:35:15,881 INFO L462 AbstractCegarLoop]: Abstraction has 96 states and 109 transitions. [2019-11-24 00:35:15,881 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-24 00:35:15,881 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 109 transitions. [2019-11-24 00:35:15,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-24 00:35:15,882 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 00:35:15,882 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-24 00:35:16,082 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-24 00:35:16,083 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 00:35:16,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 00:35:16,083 INFO L82 PathProgramCache]: Analyzing trace with hash -726001111, now seen corresponding path program 1 times [2019-11-24 00:35:16,083 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 00:35:16,083 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688803304] [2019-11-24 00:35:16,083 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 00:35:16,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 00:35:16,570 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 47 [2019-11-24 00:35:16,769 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 00:35:16,769 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688803304] [2019-11-24 00:35:16,769 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [274095512] [2019-11-24 00:35:16,769 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-24 00:35:16,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 00:35:16,827 INFO L255 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 40 conjunts are in the unsatisfiable core [2019-11-24 00:35:16,829 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-24 00:35:18,410 WARN L192 SmtUtils]: Spent 1.30 s on a formula simplification that was a NOOP. DAG size: 114 [2019-11-24 00:35:21,152 WARN L192 SmtUtils]: Spent 2.52 s on a formula simplification. DAG size of input: 114 DAG size of output: 107 [2019-11-24 00:35:22,211 WARN L192 SmtUtils]: Spent 961.00 ms on a formula simplification that was a NOOP. DAG size: 105 [2019-11-24 00:35:23,011 WARN L192 SmtUtils]: Spent 752.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2019-11-24 00:35:24,513 WARN L192 SmtUtils]: Spent 1.42 s on a formula simplification. DAG size of input: 98 DAG size of output: 96 [2019-11-24 00:35:25,620 WARN L192 SmtUtils]: Spent 1.07 s on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2019-11-24 00:35:26,341 WARN L192 SmtUtils]: Spent 606.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 81 [2019-11-24 00:35:26,556 WARN L192 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2019-11-24 00:35:26,698 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2019-11-24 00:35:26,913 WARN L192 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2019-11-24 00:35:27,186 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2019-11-24 00:35:27,634 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 43 [2019-11-24 00:35:28,387 WARN L192 SmtUtils]: Spent 751.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 66 [2019-11-24 00:35:29,172 WARN L192 SmtUtils]: Spent 538.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 66 [2019-11-24 00:35:29,754 WARN L192 SmtUtils]: Spent 446.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 64 [2019-11-24 00:35:30,004 WARN L192 SmtUtils]: Spent 207.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2019-11-24 00:35:30,455 WARN L192 SmtUtils]: Spent 421.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 80 [2019-11-24 00:35:30,799 WARN L192 SmtUtils]: Spent 338.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 76