/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/dll-01-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-24 00:32:20,652 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-24 00:32:20,656 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-24 00:32:20,674 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-24 00:32:20,675 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-24 00:32:20,677 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-24 00:32:20,679 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-24 00:32:20,689 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-24 00:32:20,692 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-24 00:32:20,695 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-24 00:32:20,697 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-24 00:32:20,698 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-24 00:32:20,699 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-24 00:32:20,700 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-24 00:32:20,703 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-24 00:32:20,704 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-24 00:32:20,705 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-24 00:32:20,707 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-24 00:32:20,708 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-24 00:32:20,712 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-24 00:32:20,718 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-24 00:32:20,722 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-24 00:32:20,723 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-24 00:32:20,723 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-24 00:32:20,725 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-24 00:32:20,725 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-24 00:32:20,726 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-24 00:32:20,727 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-24 00:32:20,728 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-24 00:32:20,729 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-24 00:32:20,729 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-24 00:32:20,730 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-24 00:32:20,731 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-24 00:32:20,732 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-24 00:32:20,733 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-24 00:32:20,733 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-24 00:32:20,734 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-24 00:32:20,734 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-24 00:32:20,734 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-24 00:32:20,735 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-24 00:32:20,736 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-24 00:32:20,737 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:32:20,772 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-24 00:32:20,773 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-24 00:32:20,773 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-24 00:32:20,774 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-24 00:32:20,774 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-24 00:32:20,774 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-24 00:32:20,774 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-24 00:32:20,774 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-24 00:32:20,777 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-24 00:32:20,777 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-24 00:32:20,777 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-24 00:32:20,777 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-24 00:32:20,777 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-24 00:32:20,778 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-24 00:32:20,778 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-24 00:32:20,779 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-24 00:32:20,779 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-24 00:32:20,779 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-24 00:32:20,779 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-24 00:32:20,779 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-24 00:32:20,779 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-24 00:32:20,780 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-24 00:32:20,781 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-24 00:32:20,781 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-24 00:32:20,781 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-24 00:32:20,781 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-24 00:32:20,782 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-24 00:32:20,782 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-24 00:32:20,782 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-24 00:32:20,782 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-24 00:32:20,783 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-24 00:32:20,783 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-24 00:32:20,783 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-24 00:32:20,783 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-24 00:32:20,783 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-24 00:32:20,783 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-24 00:32:20,784 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-24 00:32:20,785 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-11-24 00:32:21,070 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-24 00:32:21,083 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-24 00:32:21,087 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-24 00:32:21,088 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-24 00:32:21,089 INFO L275 PluginConnector]: CDTParser initialized [2019-11-24 00:32:21,089 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/dll-01-2.i [2019-11-24 00:32:21,164 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c4613a35/17857de58e38489eb82ea7a70c9cd866/FLAG52228edec [2019-11-24 00:32:21,714 INFO L306 CDTParser]: Found 1 translation units. [2019-11-24 00:32:21,717 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/dll-01-2.i [2019-11-24 00:32:21,736 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c4613a35/17857de58e38489eb82ea7a70c9cd866/FLAG52228edec [2019-11-24 00:32:21,968 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c4613a35/17857de58e38489eb82ea7a70c9cd866 [2019-11-24 00:32:21,980 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-24 00:32:21,982 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-24 00:32:21,983 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-24 00:32:21,983 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-24 00:32:21,986 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-24 00:32:21,987 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 12:32:21" (1/1) ... [2019-11-24 00:32:21,990 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a756964 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:32:21, skipping insertion in model container [2019-11-24 00:32:21,990 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 12:32:21" (1/1) ... [2019-11-24 00:32:21,998 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-24 00:32:22,062 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-24 00:32:22,507 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 00:32:22,515 INFO L203 MainTranslator]: Completed pre-run [2019-11-24 00:32:22,562 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 00:32:22,613 INFO L208 MainTranslator]: Completed translation [2019-11-24 00:32:22,613 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:32:22 WrapperNode [2019-11-24 00:32:22,614 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-24 00:32:22,615 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-24 00:32:22,615 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-24 00:32:22,615 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-24 00:32:22,623 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:32:22" (1/1) ... [2019-11-24 00:32:22,640 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:32:22" (1/1) ... [2019-11-24 00:32:22,669 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-24 00:32:22,670 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-24 00:32:22,670 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-24 00:32:22,670 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-24 00:32:22,680 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:32:22" (1/1) ... [2019-11-24 00:32:22,680 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:32:22" (1/1) ... [2019-11-24 00:32:22,684 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:32:22" (1/1) ... [2019-11-24 00:32:22,685 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:32:22" (1/1) ... [2019-11-24 00:32:22,700 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:32:22" (1/1) ... [2019-11-24 00:32:22,713 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:32:22" (1/1) ... [2019-11-24 00:32:22,718 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:32:22" (1/1) ... [2019-11-24 00:32:22,724 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-24 00:32:22,725 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-24 00:32:22,725 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-24 00:32:22,725 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-24 00:32:22,726 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:32:22" (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:32:22,787 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-24 00:32:22,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-24 00:32:22,788 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-24 00:32:22,788 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-24 00:32:22,788 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-24 00:32:22,788 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-24 00:32:23,494 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-24 00:32:23,494 INFO L284 CfgBuilder]: Removed 34 assume(true) statements. [2019-11-24 00:32:23,496 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 12:32:23 BoogieIcfgContainer [2019-11-24 00:32:23,496 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-24 00:32:23,497 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-24 00:32:23,497 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-24 00:32:23,500 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-24 00:32:23,500 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 12:32:21" (1/3) ... [2019-11-24 00:32:23,501 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b283d7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 12:32:23, skipping insertion in model container [2019-11-24 00:32:23,501 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:32:22" (2/3) ... [2019-11-24 00:32:23,502 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b283d7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 12:32:23, skipping insertion in model container [2019-11-24 00:32:23,502 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 12:32:23" (3/3) ... [2019-11-24 00:32:23,503 INFO L109 eAbstractionObserver]: Analyzing ICFG dll-01-2.i [2019-11-24 00:32:23,514 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-24 00:32:23,521 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 13 error locations. [2019-11-24 00:32:23,533 INFO L249 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2019-11-24 00:32:23,560 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-24 00:32:23,561 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-24 00:32:23,561 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-24 00:32:23,561 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-24 00:32:23,561 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-24 00:32:23,562 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-24 00:32:23,562 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-24 00:32:23,562 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-24 00:32:23,582 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states. [2019-11-24 00:32:23,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-11-24 00:32:23,588 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 00:32:23,589 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-11-24 00:32:23,589 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:32:23,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 00:32:23,596 INFO L82 PathProgramCache]: Analyzing trace with hash 346217, now seen corresponding path program 1 times [2019-11-24 00:32:23,606 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 00:32:23,606 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502956752] [2019-11-24 00:32:23,607 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 00:32:23,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 00:32:23,777 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:32:23,778 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502956752] [2019-11-24 00:32:23,779 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 00:32:23,779 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 00:32:23,781 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358353008] [2019-11-24 00:32:23,786 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 00:32:23,787 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 00:32:23,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 00:32:23,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 00:32:23,803 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 3 states. [2019-11-24 00:32:23,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 00:32:23,889 INFO L93 Difference]: Finished difference Result 163 states and 262 transitions. [2019-11-24 00:32:23,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 00:32:23,892 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-11-24 00:32:23,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 00:32:23,905 INFO L225 Difference]: With dead ends: 163 [2019-11-24 00:32:23,905 INFO L226 Difference]: Without dead ends: 89 [2019-11-24 00:32:23,910 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:32:23,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-11-24 00:32:23,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 71. [2019-11-24 00:32:23,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-11-24 00:32:23,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 75 transitions. [2019-11-24 00:32:23,962 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 75 transitions. Word has length 3 [2019-11-24 00:32:23,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 00:32:23,963 INFO L462 AbstractCegarLoop]: Abstraction has 71 states and 75 transitions. [2019-11-24 00:32:23,963 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 00:32:23,963 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2019-11-24 00:32:23,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-24 00:32:23,964 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 00:32:23,964 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-24 00:32:23,965 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:32:23,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 00:32:23,965 INFO L82 PathProgramCache]: Analyzing trace with hash 2042382261, now seen corresponding path program 1 times [2019-11-24 00:32:23,965 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 00:32:23,966 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714524613] [2019-11-24 00:32:23,966 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 00:32:24,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 00:32:24,039 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:32:24,039 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714524613] [2019-11-24 00:32:24,040 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 00:32:24,040 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 00:32:24,040 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2147199223] [2019-11-24 00:32:24,042 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 00:32:24,043 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 00:32:24,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 00:32:24,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 00:32:24,044 INFO L87 Difference]: Start difference. First operand 71 states and 75 transitions. Second operand 3 states. [2019-11-24 00:32:24,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 00:32:24,087 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2019-11-24 00:32:24,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 00:32:24,088 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-11-24 00:32:24,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 00:32:24,089 INFO L225 Difference]: With dead ends: 71 [2019-11-24 00:32:24,090 INFO L226 Difference]: Without dead ends: 69 [2019-11-24 00:32:24,091 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:32:24,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-11-24 00:32:24,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-11-24 00:32:24,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-11-24 00:32:24,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2019-11-24 00:32:24,100 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 7 [2019-11-24 00:32:24,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 00:32:24,100 INFO L462 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2019-11-24 00:32:24,101 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 00:32:24,101 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2019-11-24 00:32:24,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-24 00:32:24,101 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 00:32:24,102 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 00:32:24,102 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:32:24,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 00:32:24,102 INFO L82 PathProgramCache]: Analyzing trace with hash 2067250018, now seen corresponding path program 1 times [2019-11-24 00:32:24,103 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 00:32:24,103 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408339117] [2019-11-24 00:32:24,103 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 00:32:24,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 00:32:24,313 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:32:24,313 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408339117] [2019-11-24 00:32:24,314 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 00:32:24,314 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 00:32:24,314 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623504799] [2019-11-24 00:32:24,314 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-24 00:32:24,315 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 00:32:24,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-24 00:32:24,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-24 00:32:24,315 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand 6 states. [2019-11-24 00:32:24,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 00:32:24,449 INFO L93 Difference]: Finished difference Result 127 states and 135 transitions. [2019-11-24 00:32:24,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 00:32:24,450 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2019-11-24 00:32:24,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 00:32:24,451 INFO L225 Difference]: With dead ends: 127 [2019-11-24 00:32:24,451 INFO L226 Difference]: Without dead ends: 103 [2019-11-24 00:32:24,452 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-24 00:32:24,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-11-24 00:32:24,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 64. [2019-11-24 00:32:24,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-11-24 00:32:24,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 68 transitions. [2019-11-24 00:32:24,460 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 68 transitions. Word has length 12 [2019-11-24 00:32:24,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 00:32:24,461 INFO L462 AbstractCegarLoop]: Abstraction has 64 states and 68 transitions. [2019-11-24 00:32:24,461 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-24 00:32:24,461 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2019-11-24 00:32:24,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-24 00:32:24,462 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 00:32:24,462 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:32:24,462 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:32:24,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 00:32:24,463 INFO L82 PathProgramCache]: Analyzing trace with hash -1621844513, now seen corresponding path program 1 times [2019-11-24 00:32:24,463 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 00:32:24,463 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763171093] [2019-11-24 00:32:24,464 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 00:32:24,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 00:32:24,496 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:32:24,498 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763171093] [2019-11-24 00:32:24,499 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 00:32:24,501 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 00:32:24,501 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890650225] [2019-11-24 00:32:24,501 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 00:32:24,502 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 00:32:24,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 00:32:24,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 00:32:24,502 INFO L87 Difference]: Start difference. First operand 64 states and 68 transitions. Second operand 3 states. [2019-11-24 00:32:24,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 00:32:24,534 INFO L93 Difference]: Finished difference Result 89 states and 96 transitions. [2019-11-24 00:32:24,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 00:32:24,534 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-24 00:32:24,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 00:32:24,536 INFO L225 Difference]: With dead ends: 89 [2019-11-24 00:32:24,536 INFO L226 Difference]: Without dead ends: 87 [2019-11-24 00:32:24,536 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:32:24,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-11-24 00:32:24,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 66. [2019-11-24 00:32:24,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-11-24 00:32:24,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 71 transitions. [2019-11-24 00:32:24,543 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 71 transitions. Word has length 17 [2019-11-24 00:32:24,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 00:32:24,544 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 71 transitions. [2019-11-24 00:32:24,544 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 00:32:24,544 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 71 transitions. [2019-11-24 00:32:24,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-24 00:32:24,545 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 00:32:24,545 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:32:24,545 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:32:24,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 00:32:24,546 INFO L82 PathProgramCache]: Analyzing trace with hash -1621840571, now seen corresponding path program 1 times [2019-11-24 00:32:24,546 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 00:32:24,546 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678842627] [2019-11-24 00:32:24,547 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 00:32:24,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 00:32:24,580 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:32:24,581 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678842627] [2019-11-24 00:32:24,581 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 00:32:24,581 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 00:32:24,581 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762000348] [2019-11-24 00:32:24,582 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 00:32:24,582 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 00:32:24,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 00:32:24,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 00:32:24,583 INFO L87 Difference]: Start difference. First operand 66 states and 71 transitions. Second operand 3 states. [2019-11-24 00:32:24,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 00:32:24,604 INFO L93 Difference]: Finished difference Result 66 states and 71 transitions. [2019-11-24 00:32:24,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 00:32:24,604 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-24 00:32:24,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 00:32:24,605 INFO L225 Difference]: With dead ends: 66 [2019-11-24 00:32:24,605 INFO L226 Difference]: Without dead ends: 64 [2019-11-24 00:32:24,606 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:32:24,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-11-24 00:32:24,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-11-24 00:32:24,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-11-24 00:32:24,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 69 transitions. [2019-11-24 00:32:24,612 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 69 transitions. Word has length 17 [2019-11-24 00:32:24,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 00:32:24,612 INFO L462 AbstractCegarLoop]: Abstraction has 64 states and 69 transitions. [2019-11-24 00:32:24,612 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 00:32:24,612 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 69 transitions. [2019-11-24 00:32:24,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-24 00:32:24,613 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 00:32:24,613 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:32:24,614 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:32:24,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 00:32:24,614 INFO L82 PathProgramCache]: Analyzing trace with hash 315644711, now seen corresponding path program 1 times [2019-11-24 00:32:24,614 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 00:32:24,615 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110793490] [2019-11-24 00:32:24,615 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 00:32:24,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 00:32:24,666 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:32:24,666 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110793490] [2019-11-24 00:32:24,666 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 00:32:24,667 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 00:32:24,667 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874280533] [2019-11-24 00:32:24,667 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 00:32:24,668 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 00:32:24,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 00:32:24,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 00:32:24,668 INFO L87 Difference]: Start difference. First operand 64 states and 69 transitions. Second operand 3 states. [2019-11-24 00:32:24,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 00:32:24,676 INFO L93 Difference]: Finished difference Result 64 states and 69 transitions. [2019-11-24 00:32:24,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 00:32:24,677 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-11-24 00:32:24,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 00:32:24,677 INFO L225 Difference]: With dead ends: 64 [2019-11-24 00:32:24,678 INFO L226 Difference]: Without dead ends: 62 [2019-11-24 00:32:24,678 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:32:24,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-11-24 00:32:24,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-11-24 00:32:24,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-11-24 00:32:24,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 67 transitions. [2019-11-24 00:32:24,684 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 67 transitions. Word has length 18 [2019-11-24 00:32:24,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 00:32:24,684 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 67 transitions. [2019-11-24 00:32:24,684 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 00:32:24,684 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 67 transitions. [2019-11-24 00:32:24,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-24 00:32:24,685 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 00:32:24,685 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:32:24,686 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:32:24,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 00:32:24,686 INFO L82 PathProgramCache]: Analyzing trace with hash 2133723706, now seen corresponding path program 1 times [2019-11-24 00:32:24,686 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 00:32:24,687 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062652595] [2019-11-24 00:32:24,687 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 00:32:24,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 00:32:25,135 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:32:25,136 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062652595] [2019-11-24 00:32:25,136 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 00:32:25,136 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-24 00:32:25,136 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795943339] [2019-11-24 00:32:25,138 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-24 00:32:25,138 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 00:32:25,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-24 00:32:25,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-11-24 00:32:25,139 INFO L87 Difference]: Start difference. First operand 62 states and 67 transitions. Second operand 9 states. [2019-11-24 00:32:25,366 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2019-11-24 00:32:25,572 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 60 [2019-11-24 00:32:25,711 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 58 [2019-11-24 00:32:25,999 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 62 [2019-11-24 00:32:26,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 00:32:26,228 INFO L93 Difference]: Finished difference Result 148 states and 161 transitions. [2019-11-24 00:32:26,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-24 00:32:26,229 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2019-11-24 00:32:26,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 00:32:26,231 INFO L225 Difference]: With dead ends: 148 [2019-11-24 00:32:26,232 INFO L226 Difference]: Without dead ends: 146 [2019-11-24 00:32:26,232 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=93, Invalid=213, Unknown=0, NotChecked=0, Total=306 [2019-11-24 00:32:26,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-11-24 00:32:26,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 79. [2019-11-24 00:32:26,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-11-24 00:32:26,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 88 transitions. [2019-11-24 00:32:26,241 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 88 transitions. Word has length 20 [2019-11-24 00:32:26,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 00:32:26,242 INFO L462 AbstractCegarLoop]: Abstraction has 79 states and 88 transitions. [2019-11-24 00:32:26,242 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-24 00:32:26,242 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 88 transitions. [2019-11-24 00:32:26,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-24 00:32:26,243 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 00:32:26,243 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:32:26,243 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:32:26,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 00:32:26,244 INFO L82 PathProgramCache]: Analyzing trace with hash -483183266, now seen corresponding path program 1 times [2019-11-24 00:32:26,244 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 00:32:26,244 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284954761] [2019-11-24 00:32:26,244 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 00:32:26,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 00:32:26,270 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:32:26,271 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284954761] [2019-11-24 00:32:26,271 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 00:32:26,271 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 00:32:26,271 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196284805] [2019-11-24 00:32:26,272 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 00:32:26,272 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 00:32:26,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 00:32:26,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 00:32:26,273 INFO L87 Difference]: Start difference. First operand 79 states and 88 transitions. Second operand 3 states. [2019-11-24 00:32:26,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 00:32:26,316 INFO L93 Difference]: Finished difference Result 80 states and 89 transitions. [2019-11-24 00:32:26,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 00:32:26,316 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-24 00:32:26,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 00:32:26,317 INFO L225 Difference]: With dead ends: 80 [2019-11-24 00:32:26,317 INFO L226 Difference]: Without dead ends: 78 [2019-11-24 00:32:26,317 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:32:26,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-11-24 00:32:26,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2019-11-24 00:32:26,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-11-24 00:32:26,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 86 transitions. [2019-11-24 00:32:26,324 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 86 transitions. Word has length 23 [2019-11-24 00:32:26,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 00:32:26,324 INFO L462 AbstractCegarLoop]: Abstraction has 77 states and 86 transitions. [2019-11-24 00:32:26,324 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 00:32:26,324 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 86 transitions. [2019-11-24 00:32:26,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-24 00:32:26,325 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 00:32:26,326 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:32:26,326 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:32:26,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 00:32:26,326 INFO L82 PathProgramCache]: Analyzing trace with hash 251056887, now seen corresponding path program 1 times [2019-11-24 00:32:26,327 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 00:32:26,327 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154137637] [2019-11-24 00:32:26,327 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 00:32:26,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 00:32:26,549 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:32:26,550 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154137637] [2019-11-24 00:32:26,550 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 00:32:26,550 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-24 00:32:26,550 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226774633] [2019-11-24 00:32:26,551 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-24 00:32:26,551 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 00:32:26,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-24 00:32:26,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-11-24 00:32:26,552 INFO L87 Difference]: Start difference. First operand 77 states and 86 transitions. Second operand 9 states. [2019-11-24 00:32:27,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 00:32:27,441 INFO L93 Difference]: Finished difference Result 151 states and 164 transitions. [2019-11-24 00:32:27,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-24 00:32:27,441 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2019-11-24 00:32:27,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 00:32:27,442 INFO L225 Difference]: With dead ends: 151 [2019-11-24 00:32:27,442 INFO L226 Difference]: Without dead ends: 149 [2019-11-24 00:32:27,443 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=92, Invalid=214, Unknown=0, NotChecked=0, Total=306 [2019-11-24 00:32:27,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-11-24 00:32:27,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 84. [2019-11-24 00:32:27,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-11-24 00:32:27,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 93 transitions. [2019-11-24 00:32:27,461 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 93 transitions. Word has length 23 [2019-11-24 00:32:27,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 00:32:27,462 INFO L462 AbstractCegarLoop]: Abstraction has 84 states and 93 transitions. [2019-11-24 00:32:27,462 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-24 00:32:27,462 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 93 transitions. [2019-11-24 00:32:27,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-24 00:32:27,463 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 00:32:27,463 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:32:27,463 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:32:27,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 00:32:27,464 INFO L82 PathProgramCache]: Analyzing trace with hash -1453767539, now seen corresponding path program 1 times [2019-11-24 00:32:27,464 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 00:32:27,464 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83224158] [2019-11-24 00:32:27,464 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 00:32:27,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 00:32:27,539 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:32:27,539 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83224158] [2019-11-24 00:32:27,539 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [817659342] [2019-11-24 00:32:27,540 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:32:27,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 00:32:27,603 INFO L255 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 23 conjunts are in the unsatisfiable core [2019-11-24 00:32:27,609 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-24 00:32:27,698 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 00:32:27,699 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:32:27,700 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-24 00:32:27,741 INFO L567 ElimStorePlain]: treesize reduction 10, result has 83.3 percent of original size [2019-11-24 00:32:27,751 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-24 00:32:27,753 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 16 treesize of output 17 [2019-11-24 00:32:27,754 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-24 00:32:27,777 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 00:32:27,781 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-24 00:32:27,782 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 16 treesize of output 17 [2019-11-24 00:32:27,783 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-24 00:32:27,798 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 00:32:27,798 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:32:27,799 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:45, output treesize:50 [2019-11-24 00:32:27,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:32:27,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:32:27,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:32:27,876 INFO L392 ElimStorePlain]: Different costs {0=[v_prenex_8], 1=[v_prenex_1, v_prenex_4], 3=[|v_#valid_30|]} [2019-11-24 00:32:27,936 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 70 treesize of output 68 [2019-11-24 00:32:27,937 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-24 00:32:32,446 WARN L192 SmtUtils]: Spent 4.51 s on a formula simplification. DAG size of input: 146 DAG size of output: 144 [2019-11-24 00:32:32,447 INFO L567 ElimStorePlain]: treesize reduction 4, result has 99.6 percent of original size [2019-11-24 00:32:32,531 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 00:32:32,532 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 391 treesize of output 395 [2019-11-24 00:32:32,533 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-24 00:32:34,239 WARN L192 SmtUtils]: Spent 1.71 s on a formula simplification that was a NOOP. DAG size: 141 [2019-11-24 00:32:34,239 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 00:32:34,311 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 00:32:34,312 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 72 treesize of output 76 [2019-11-24 00:32:34,313 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-24 00:32:36,274 WARN L192 SmtUtils]: Spent 1.96 s on a formula simplification that was a NOOP. DAG size: 137 [2019-11-24 00:32:36,275 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 00:32:36,376 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 00:32:36,377 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 397 treesize of output 407 [2019-11-24 00:32:36,378 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-24 00:32:38,351 WARN L192 SmtUtils]: Spent 1.97 s on a formula simplification that was a NOOP. DAG size: 131 [2019-11-24 00:32:38,351 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 00:32:38,362 INFO L392 ElimStorePlain]: Different costs {6=[v_prenex_9, v_prenex_10, v_prenex_5, v_prenex_6], 26=[v_prenex_2, v_prenex_3, |v_#memory_$Pointer$.base_52|, |v_#memory_$Pointer$.offset_52|]} [2019-11-24 00:32:38,377 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-24 00:32:38,380 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-24 00:32:38,385 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-24 00:32:38,404 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 67 [2019-11-24 00:32:38,405 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-24 00:32:39,833 WARN L192 SmtUtils]: Spent 1.43 s on a formula simplification that was a NOOP. DAG size: 129 [2019-11-24 00:32:39,833 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 00:32:39,872 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-24 00:32:39,874 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-24 00:32:39,876 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-24 00:32:39,890 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 63 [2019-11-24 00:32:39,891 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-24 00:32:42,740 WARN L192 SmtUtils]: Spent 2.85 s on a formula simplification. DAG size of input: 127 DAG size of output: 125 [2019-11-24 00:32:42,741 INFO L567 ElimStorePlain]: treesize reduction 8, result has 99.1 percent of original size [2019-11-24 00:32:42,770 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-24 00:32:42,785 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-24 00:32:42,793 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-24 00:32:42,840 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 64 [2019-11-24 00:32:42,841 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-24 00:32:43,803 WARN L192 SmtUtils]: Spent 960.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2019-11-24 00:32:43,803 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 00:32:43,833 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-24 00:32:43,841 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-24 00:32:43,853 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-24 00:32:43,907 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 60 [2019-11-24 00:32:43,907 INFO L496 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-11-24 00:32:45,194 WARN L192 SmtUtils]: Spent 1.29 s on a formula simplification. DAG size of input: 107 DAG size of output: 102 [2019-11-24 00:32:45,194 INFO L567 ElimStorePlain]: treesize reduction 65, result has 92.6 percent of original size [2019-11-24 00:32:45,199 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-24 00:32:45,204 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-24 00:32:45,205 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-24 00:32:45,206 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-24 00:32:45,368 WARN L192 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 49 [2019-11-24 00:32:45,368 INFO L343 Elim1Store]: treesize reduction 226, result has 52.8 percent of original size [2019-11-24 00:32:45,369 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 179 treesize of output 394 [2019-11-24 00:32:45,371 INFO L496 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-11-24 00:32:46,181 WARN L192 SmtUtils]: Spent 809.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 90 [2019-11-24 00:32:46,182 INFO L567 ElimStorePlain]: treesize reduction 220, result has 73.3 percent of original size [2019-11-24 00:32:46,187 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-24 00:32:46,192 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-24 00:32:46,193 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-24 00:32:46,196 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-24 00:32:46,200 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-24 00:32:46,208 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-24 00:32:46,255 INFO L343 Elim1Store]: treesize reduction 18, result has 64.7 percent of original size [2019-11-24 00:32:46,255 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 96 treesize of output 107 [2019-11-24 00:32:46,256 INFO L496 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-11-24 00:32:46,617 WARN L192 SmtUtils]: Spent 360.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 78 [2019-11-24 00:32:46,618 INFO L567 ElimStorePlain]: treesize reduction 16, result has 97.0 percent of original size [2019-11-24 00:32:46,622 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-24 00:32:46,649 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-24 00:32:46,649 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-24 00:32:46,650 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-24 00:32:46,835 WARN L192 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 49 [2019-11-24 00:32:46,837 INFO L343 Elim1Store]: treesize reduction 226, result has 52.8 percent of original size [2019-11-24 00:32:46,837 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 180 treesize of output 395 [2019-11-24 00:32:46,838 INFO L496 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-11-24 00:32:47,110 WARN L192 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 66 [2019-11-24 00:32:47,111 INFO L567 ElimStorePlain]: treesize reduction 220, result has 58.4 percent of original size [2019-11-24 00:32:47,115 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-24 00:32:47,125 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-24 00:32:47,126 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-24 00:32:47,128 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-24 00:32:47,129 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-24 00:32:47,132 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-24 00:32:47,171 INFO L343 Elim1Store]: treesize reduction 18, result has 64.7 percent of original size [2019-11-24 00:32:47,171 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 97 treesize of output 108 [2019-11-24 00:32:47,172 INFO L496 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-11-24 00:32:47,355 WARN L192 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-11-24 00:32:47,356 INFO L567 ElimStorePlain]: treesize reduction 16, result has 93.4 percent of original size [2019-11-24 00:32:47,357 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:32:47,358 INFO L221 ElimStorePlain]: Needed 13 recursive calls to eliminate 14 variables, input treesize:935, output treesize:256 [2019-11-24 00:32:47,491 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 37 [2019-11-24 00:32:47,744 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-11-24 00:32:47,744 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-24 00:32:47,756 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 00:32:47,760 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 00:32:47,760 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 13 [2019-11-24 00:32:47,761 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-24 00:32:47,766 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 00:32:47,766 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:32:47,766 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:57, output treesize:7 [2019-11-24 00:32:47,776 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:32:47,777 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-24 00:32:47,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:32:47,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:32:47,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:32:49,896 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_ULTIMATE.start_main_~list~0.offset 8))) (and (= 0 (select (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~list~0.base) .cse0 0) c_ULTIMATE.start_main_~list~0.offset)) (forall ((|v_ULTIMATE.start_main_#t~malloc2.base_10| Int)) (let ((.cse2 (+ c_ULTIMATE.start_main_~list~0.offset 8))) (let ((.cse1 (select (let ((.cse3 (let ((.cse6 (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) .cse2 |v_ULTIMATE.start_main_#t~malloc2.base_10|)))) (store .cse6 |v_ULTIMATE.start_main_#t~malloc2.base_10| (store (select .cse6 |v_ULTIMATE.start_main_#t~malloc2.base_10|) 0 0))))) (let ((.cse4 (select (select .cse3 c_ULTIMATE.start_main_~list~0.base) .cse2))) (store .cse3 .cse4 (store (select .cse3 .cse4) (+ (select (select (let ((.cse5 (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) .cse2 0)))) (store .cse5 |v_ULTIMATE.start_main_#t~malloc2.base_10| (store (select .cse5 |v_ULTIMATE.start_main_#t~malloc2.base_10|) 0 0))) c_ULTIMATE.start_main_~list~0.base) .cse2) 8) 0)))) c_ULTIMATE.start_main_~list~0.base))) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc2.base_10|))) (= 0 (select .cse1 c_ULTIMATE.start_main_~list~0.offset)) (= 0 |v_ULTIMATE.start_main_#t~malloc2.base_10|) (not (= (select .cse1 .cse2) 0)))))) (= (select (store (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~list~0.base) .cse0 0) c_ULTIMATE.start_main_~list~0.offset) 0) (forall ((v_prenex_11 Int)) (let ((.cse11 (+ c_ULTIMATE.start_main_~list~0.offset 8))) (let ((.cse7 (let ((.cse13 (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) .cse11 0)))) (store .cse13 v_prenex_11 (store (select .cse13 v_prenex_11) 0 0)))) (.cse10 (let ((.cse12 (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) .cse11 v_prenex_11)))) (store .cse12 v_prenex_11 (store (select .cse12 v_prenex_11) 0 0))))) (let ((.cse8 (select (select .cse10 c_ULTIMATE.start_main_~list~0.base) .cse11)) (.cse9 (+ (select (select .cse7 c_ULTIMATE.start_main_~list~0.base) .cse11) 8))) (or (= 0 v_prenex_11) (= (select (select (store .cse7 .cse8 (store (select .cse7 .cse8) .cse9 0)) c_ULTIMATE.start_main_~list~0.base) c_ULTIMATE.start_main_~list~0.offset) 0) (not (= (select (select (store .cse10 .cse8 (store (select .cse10 .cse8) .cse9 0)) c_ULTIMATE.start_main_~list~0.base) .cse11) 0)) (not (= 0 (select |c_#valid| v_prenex_11)))))))))) is different from false [2019-11-24 00:32:49,916 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:32:49,916 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [36244769] [2019-11-24 00:32:49,941 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2019-11-24 00:32:49,941 INFO L166 IcfgInterpreter]: Building call graph [2019-11-24 00:32:49,947 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-11-24 00:32:49,953 INFO L176 IcfgInterpreter]: Starting interpretation [2019-11-24 00:32:49,954 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-11-24 00:32:50,140 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-24 00:32:50,426 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-24 00:32:50,905 INFO L180 IcfgInterpreter]: Interpretation finished [2019-11-24 00:32:51,456 WARN L192 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 69 [2019-11-24 00:32:52,184 WARN L192 SmtUtils]: Spent 653.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 84 [2019-11-24 00:32:52,691 WARN L192 SmtUtils]: Spent 356.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 74 [2019-11-24 00:32:53,159 WARN L192 SmtUtils]: Spent 379.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 80 [2019-11-24 00:32:53,801 WARN L192 SmtUtils]: Spent 491.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 106 [2019-11-24 00:32:54,492 WARN L192 SmtUtils]: Spent 594.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 111 [2019-11-24 00:32:54,804 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-24 00:32:54,804 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-11-24 00:32:54,804 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 7] total 14 [2019-11-24 00:32:54,805 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592907752] [2019-11-24 00:32:54,805 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-24 00:32:54,805 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 00:32:54,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-24 00:32:54,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=489, Unknown=1, NotChecked=46, Total=650 [2019-11-24 00:32:54,806 INFO L87 Difference]: Start difference. First operand 84 states and 93 transitions. Second operand 15 states. [2019-11-24 00:32:56,868 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_ULTIMATE.start_main_~list~0.offset 8)) (.cse8 (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~list~0.base)) (.cse0 (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~list~0.base)) (.cse9 (+ c_ULTIMATE.start_main_~list~0.offset 4))) (and (= 0 (select (store .cse0 .cse1 0) c_ULTIMATE.start_main_~list~0.offset)) (forall ((|v_ULTIMATE.start_main_#t~malloc2.base_10| Int)) (let ((.cse3 (+ c_ULTIMATE.start_main_~list~0.offset 8))) (let ((.cse2 (select (let ((.cse4 (let ((.cse7 (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 .cse7 |v_ULTIMATE.start_main_#t~malloc2.base_10| (store (select .cse7 |v_ULTIMATE.start_main_#t~malloc2.base_10|) 0 0))))) (let ((.cse5 (select (select .cse4 c_ULTIMATE.start_main_~list~0.base) .cse3))) (store .cse4 .cse5 (store (select .cse4 .cse5) (+ (select (select (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))) c_ULTIMATE.start_main_~list~0.base) .cse3) 8) 0)))) c_ULTIMATE.start_main_~list~0.base))) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc2.base_10|))) (= 0 (select .cse2 c_ULTIMATE.start_main_~list~0.offset)) (= 0 |v_ULTIMATE.start_main_#t~malloc2.base_10|) (not (= (select .cse2 .cse3) 0)))))) (= 0 (select .cse8 .cse9)) (or (= 0 c_ULTIMATE.start_main_~list~0.base) (= 0 (select |c_#valid| 0))) (= (select (store .cse8 .cse1 0) c_ULTIMATE.start_main_~list~0.offset) 0) (forall ((v_prenex_11 Int)) (let ((.cse14 (+ c_ULTIMATE.start_main_~list~0.offset 8))) (let ((.cse10 (let ((.cse16 (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) .cse14 0)))) (store .cse16 v_prenex_11 (store (select .cse16 v_prenex_11) 0 0)))) (.cse13 (let ((.cse15 (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) .cse14 v_prenex_11)))) (store .cse15 v_prenex_11 (store (select .cse15 v_prenex_11) 0 0))))) (let ((.cse11 (select (select .cse13 c_ULTIMATE.start_main_~list~0.base) .cse14)) (.cse12 (+ (select (select .cse10 c_ULTIMATE.start_main_~list~0.base) .cse14) 8))) (or (= 0 v_prenex_11) (= (select (select (store .cse10 .cse11 (store (select .cse10 .cse11) .cse12 0)) c_ULTIMATE.start_main_~list~0.base) c_ULTIMATE.start_main_~list~0.offset) 0) (not (= (select (select (store .cse13 .cse11 (store (select .cse13 .cse11) .cse12 0)) c_ULTIMATE.start_main_~list~0.base) .cse14) 0)) (not (= 0 (select |c_#valid| v_prenex_11)))))))) (= (select .cse8 c_ULTIMATE.start_main_~list~0.offset) 0) (= 0 (select .cse0 c_ULTIMATE.start_main_~list~0.offset)) (= (select .cse0 .cse9) 0) (= 1 (select |c_#valid| c_ULTIMATE.start_main_~list~0.base)) (= c_ULTIMATE.start_main_~list~0.offset 0))) is different from false [2019-11-24 00:32:57,039 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2019-11-24 00:32:57,276 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2019-11-24 00:32:57,502 WARN L192 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 60 [2019-11-24 00:32:57,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 00:32:57,840 INFO L93 Difference]: Finished difference Result 154 states and 168 transitions. [2019-11-24 00:32:57,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-24 00:32:57,841 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 25 [2019-11-24 00:32:57,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 00:32:57,843 INFO L225 Difference]: With dead ends: 154 [2019-11-24 00:32:57,843 INFO L226 Difference]: Without dead ends: 116 [2019-11-24 00:32:57,844 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 48 SyntacticMatches, 7 SemanticMatches, 29 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 282 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=157, Invalid=661, Unknown=2, NotChecked=110, Total=930 [2019-11-24 00:32:57,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-11-24 00:32:57,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 89. [2019-11-24 00:32:57,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-11-24 00:32:57,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 99 transitions. [2019-11-24 00:32:57,851 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 99 transitions. Word has length 25 [2019-11-24 00:32:57,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 00:32:57,851 INFO L462 AbstractCegarLoop]: Abstraction has 89 states and 99 transitions. [2019-11-24 00:32:57,851 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-24 00:32:57,851 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 99 transitions. [2019-11-24 00:32:57,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-24 00:32:57,852 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 00:32:57,853 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:32:58,062 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-24 00:32:58,063 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:32:58,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 00:32:58,064 INFO L82 PathProgramCache]: Analyzing trace with hash -2073084773, now seen corresponding path program 1 times [2019-11-24 00:32:58,065 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 00:32:58,065 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079966569] [2019-11-24 00:32:58,065 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 00:32:58,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 00:32:58,257 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:32:58,258 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079966569] [2019-11-24 00:32:58,258 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [624377236] [2019-11-24 00:32:58,258 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:32:58,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 00:32:58,321 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 25 conjunts are in the unsatisfiable core [2019-11-24 00:32:58,323 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-24 00:32:58,421 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:32:58,422 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-24 00:32:58,481 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:32:58,481 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-11-24 00:32:58,481 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 6] total 13 [2019-11-24 00:32:58,481 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198384281] [2019-11-24 00:32:58,482 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-24 00:32:58,482 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 00:32:58,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-24 00:32:58,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-11-24 00:32:58,483 INFO L87 Difference]: Start difference. First operand 89 states and 99 transitions. Second operand 6 states. [2019-11-24 00:32:58,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 00:32:58,726 INFO L93 Difference]: Finished difference Result 155 states and 172 transitions. [2019-11-24 00:32:58,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-24 00:32:58,726 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2019-11-24 00:32:58,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 00:32:58,727 INFO L225 Difference]: With dead ends: 155 [2019-11-24 00:32:58,727 INFO L226 Difference]: Without dead ends: 139 [2019-11-24 00:32:58,728 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:32:58,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-11-24 00:32:58,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 111. [2019-11-24 00:32:58,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-11-24 00:32:58,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 128 transitions. [2019-11-24 00:32:58,736 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 128 transitions. Word has length 26 [2019-11-24 00:32:58,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 00:32:58,736 INFO L462 AbstractCegarLoop]: Abstraction has 111 states and 128 transitions. [2019-11-24 00:32:58,736 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-24 00:32:58,736 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 128 transitions. [2019-11-24 00:32:58,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-24 00:32:58,737 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 00:32:58,737 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:32:58,941 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-24 00:32:58,942 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:32:58,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 00:32:58,942 INFO L82 PathProgramCache]: Analyzing trace with hash 1215876267, now seen corresponding path program 1 times [2019-11-24 00:32:58,942 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 00:32:58,942 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790754886] [2019-11-24 00:32:58,942 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 00:32:58,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 00:32:58,970 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:32:58,970 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790754886] [2019-11-24 00:32:58,970 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [597786806] [2019-11-24 00:32:58,970 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:32:59,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 00:32:59,037 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-24 00:32:59,039 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-24 00:32:59,047 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:32:59,047 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-24 00:32:59,050 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:32:59,050 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [709870651] [2019-11-24 00:32:59,057 INFO L159 IcfgInterpreter]: Started Sifa with 27 locations of interest [2019-11-24 00:32:59,057 INFO L166 IcfgInterpreter]: Building call graph [2019-11-24 00:32:59,057 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-11-24 00:32:59,057 INFO L176 IcfgInterpreter]: Starting interpretation [2019-11-24 00:32:59,059 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-11-24 00:32:59,137 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-24 00:32:59,430 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-24 00:32:59,792 INFO L180 IcfgInterpreter]: Interpretation finished [2019-11-24 00:32:59,927 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 33 [2019-11-24 00:33:00,372 WARN L192 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 69 [2019-11-24 00:33:01,044 WARN L192 SmtUtils]: Spent 640.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 84 [2019-11-24 00:33:01,477 WARN L192 SmtUtils]: Spent 347.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 74 [2019-11-24 00:33:01,876 WARN L192 SmtUtils]: Spent 359.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 80 [2019-11-24 00:33:02,533 WARN L192 SmtUtils]: Spent 517.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 105 [2019-11-24 00:33:03,011 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 29 [2019-11-24 00:33:03,012 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-24 00:33:03,013 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-11-24 00:33:03,013 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2019-11-24 00:33:03,013 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367748167] [2019-11-24 00:33:03,014 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 00:33:03,014 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 00:33:03,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 00:33:03,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2019-11-24 00:33:03,015 INFO L87 Difference]: Start difference. First operand 111 states and 128 transitions. Second operand 5 states. [2019-11-24 00:33:03,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 00:33:03,062 INFO L93 Difference]: Finished difference Result 194 states and 224 transitions. [2019-11-24 00:33:03,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 00:33:03,064 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-11-24 00:33:03,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 00:33:03,065 INFO L225 Difference]: With dead ends: 194 [2019-11-24 00:33:03,065 INFO L226 Difference]: Without dead ends: 192 [2019-11-24 00:33:03,068 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 61 SyntacticMatches, 6 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2019-11-24 00:33:03,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2019-11-24 00:33:03,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 135. [2019-11-24 00:33:03,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2019-11-24 00:33:03,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 159 transitions. [2019-11-24 00:33:03,080 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 159 transitions. Word has length 27 [2019-11-24 00:33:03,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 00:33:03,080 INFO L462 AbstractCegarLoop]: Abstraction has 135 states and 159 transitions. [2019-11-24 00:33:03,080 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 00:33:03,080 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 159 transitions. [2019-11-24 00:33:03,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-24 00:33:03,081 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 00:33:03,082 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:33:03,284 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-24 00:33:03,285 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:33:03,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 00:33:03,286 INFO L82 PathProgramCache]: Analyzing trace with hash -902933494, now seen corresponding path program 1 times [2019-11-24 00:33:03,286 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 00:33:03,287 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351467624] [2019-11-24 00:33:03,287 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 00:33:03,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 00:33:03,405 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:33:03,406 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351467624] [2019-11-24 00:33:03,406 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [796469825] [2019-11-24 00:33:03,406 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:33:03,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 00:33:03,466 INFO L255 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 21 conjunts are in the unsatisfiable core [2019-11-24 00:33:03,468 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-24 00:33:03,505 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:33:03,505 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-24 00:33:03,558 WARN L227 Elim1Store]: Array PQE input equivalent to true [2019-11-24 00:33:03,577 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:33:03,577 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [430989012] [2019-11-24 00:33:03,580 INFO L159 IcfgInterpreter]: Started Sifa with 27 locations of interest [2019-11-24 00:33:03,580 INFO L166 IcfgInterpreter]: Building call graph [2019-11-24 00:33:03,581 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-11-24 00:33:03,583 INFO L176 IcfgInterpreter]: Starting interpretation [2019-11-24 00:33:03,583 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-11-24 00:33:03,664 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-24 00:33:03,842 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-24 00:33:04,163 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-24 00:33:04,208 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-24 00:33:04,385 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-24 00:33:05,216 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-24 00:33:06,209 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-24 00:33:07,107 INFO L180 IcfgInterpreter]: Interpretation finished [2019-11-24 00:33:07,544 WARN L192 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 69 [2019-11-24 00:33:08,102 WARN L192 SmtUtils]: Spent 522.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 84 [2019-11-24 00:33:08,480 WARN L192 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 74 [2019-11-24 00:33:08,833 WARN L192 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 80 [2019-11-24 00:33:09,418 WARN L192 SmtUtils]: Spent 500.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 106 [2019-11-24 00:33:10,130 WARN L192 SmtUtils]: Spent 645.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 111 [2019-11-24 00:33:27,837 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 192 DAG size of output: 25 [2019-11-24 00:33:28,535 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-24 00:33:28,535 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-11-24 00:33:28,536 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 8 [2019-11-24 00:33:28,536 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397145147] [2019-11-24 00:33:28,537 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-24 00:33:28,537 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 00:33:28,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-24 00:33:28,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=341, Unknown=6, NotChecked=0, Total=420 [2019-11-24 00:33:28,538 INFO L87 Difference]: Start difference. First operand 135 states and 159 transitions. Second operand 8 states. [2019-11-24 00:33:28,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 00:33:28,975 INFO L93 Difference]: Finished difference Result 268 states and 311 transitions. [2019-11-24 00:33:28,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-24 00:33:28,976 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2019-11-24 00:33:28,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 00:33:28,978 INFO L225 Difference]: With dead ends: 268 [2019-11-24 00:33:28,978 INFO L226 Difference]: Without dead ends: 241 [2019-11-24 00:33:28,980 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 66 SyntacticMatches, 7 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 21.7s TimeCoverageRelationStatistics Valid=99, Invalid=495, Unknown=6, NotChecked=0, Total=600 [2019-11-24 00:33:28,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2019-11-24 00:33:28,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 169. [2019-11-24 00:33:28,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-11-24 00:33:28,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 201 transitions. [2019-11-24 00:33:28,995 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 201 transitions. Word has length 29 [2019-11-24 00:33:28,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 00:33:28,995 INFO L462 AbstractCegarLoop]: Abstraction has 169 states and 201 transitions. [2019-11-24 00:33:28,995 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-24 00:33:28,996 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 201 transitions. [2019-11-24 00:33:28,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-24 00:33:28,999 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 00:33:28,999 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:33:29,210 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-24 00:33:29,210 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:33:29,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 00:33:29,211 INFO L82 PathProgramCache]: Analyzing trace with hash 1555436008, now seen corresponding path program 1 times [2019-11-24 00:33:29,211 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 00:33:29,211 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436292586] [2019-11-24 00:33:29,211 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 00:33:29,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 00:33:29,816 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 36 [2019-11-24 00:33:29,989 WARN L192 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 49 [2019-11-24 00:33:30,220 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:33:30,220 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436292586] [2019-11-24 00:33:30,221 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1698313196] [2019-11-24 00:33:30,221 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:33:30,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 00:33:30,301 INFO L255 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 42 conjunts are in the unsatisfiable core [2019-11-24 00:33:30,305 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-24 00:33:31,485 WARN L192 SmtUtils]: Spent 917.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 66 [2019-11-24 00:33:31,763 WARN L192 SmtUtils]: Spent 236.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2019-11-24 00:33:32,190 WARN L192 SmtUtils]: Spent 395.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2019-11-24 00:33:32,410 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-11-24 00:33:32,695 WARN L192 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2019-11-24 00:33:32,976 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2019-11-24 00:33:33,225 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 32 [2019-11-24 00:33:33,767 WARN L192 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 43 [2019-11-24 00:33:34,928 WARN L192 SmtUtils]: Spent 1.16 s on a formula simplification. DAG size of input: 86 DAG size of output: 79 [2019-11-24 00:33:36,180 WARN L192 SmtUtils]: Spent 769.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 77 [2019-11-24 00:33:36,967 WARN L192 SmtUtils]: Spent 595.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 73 [2019-11-24 00:33:37,288 WARN L192 SmtUtils]: Spent 266.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2019-11-24 00:33:37,692 WARN L192 SmtUtils]: Spent 381.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 81 [2019-11-24 00:33:38,079 WARN L192 SmtUtils]: Spent 382.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 85