/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf -i ../../../trunk/examples/svcomp/forester-heap/sll-token-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-24 00:36:42,530 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-24 00:36:42,533 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-24 00:36:42,551 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-24 00:36:42,551 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-24 00:36:42,553 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-24 00:36:42,555 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-24 00:36:42,563 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-24 00:36:42,565 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-24 00:36:42,566 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-24 00:36:42,566 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-24 00:36:42,569 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-24 00:36:42,569 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-24 00:36:42,571 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-24 00:36:42,572 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-24 00:36:42,573 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-24 00:36:42,574 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-24 00:36:42,577 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-24 00:36:42,578 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-24 00:36:42,584 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-24 00:36:42,588 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-24 00:36:42,589 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-24 00:36:42,590 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-24 00:36:42,593 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-24 00:36:42,596 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-24 00:36:42,596 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-24 00:36:42,596 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-24 00:36:42,598 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-24 00:36:42,599 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-24 00:36:42,601 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-24 00:36:42,601 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-24 00:36:42,603 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-24 00:36:42,603 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-24 00:36:42,604 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-24 00:36:42,608 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-24 00:36:42,608 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-24 00:36:42,609 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-24 00:36:42,609 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-24 00:36:42,609 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-24 00:36:42,613 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-24 00:36:42,614 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-24 00:36:42,615 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:36:42,637 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-24 00:36:42,638 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-24 00:36:42,638 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-24 00:36:42,639 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-24 00:36:42,639 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-24 00:36:42,639 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-24 00:36:42,639 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-24 00:36:42,640 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-24 00:36:42,640 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-24 00:36:42,640 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-24 00:36:42,640 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-24 00:36:42,640 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-24 00:36:42,640 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-24 00:36:42,641 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-24 00:36:42,641 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-24 00:36:42,642 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-24 00:36:42,642 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-24 00:36:42,642 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-24 00:36:42,642 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-24 00:36:42,642 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-24 00:36:42,642 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-24 00:36:42,643 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-24 00:36:42,643 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-24 00:36:42,643 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-24 00:36:42,643 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-24 00:36:42,643 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-24 00:36:42,643 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-24 00:36:42,644 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-24 00:36:42,644 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-24 00:36:42,644 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-24 00:36:42,644 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-24 00:36:42,644 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-24 00:36:42,645 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-24 00:36:42,645 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-24 00:36:42,645 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-24 00:36:42,645 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-24 00:36:42,645 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-24 00:36:42,646 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-11-24 00:36:42,924 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-24 00:36:42,943 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-24 00:36:42,947 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-24 00:36:42,948 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-24 00:36:42,948 INFO L275 PluginConnector]: CDTParser initialized [2019-11-24 00:36:42,949 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/sll-token-2.i [2019-11-24 00:36:43,010 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ef2ea8ad/d7dfc738795049a392d9274e2db69363/FLAG369eaebdf [2019-11-24 00:36:43,495 INFO L306 CDTParser]: Found 1 translation units. [2019-11-24 00:36:43,496 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-token-2.i [2019-11-24 00:36:43,523 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ef2ea8ad/d7dfc738795049a392d9274e2db69363/FLAG369eaebdf [2019-11-24 00:36:43,758 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ef2ea8ad/d7dfc738795049a392d9274e2db69363 [2019-11-24 00:36:43,767 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-24 00:36:43,768 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-24 00:36:43,769 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-24 00:36:43,769 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-24 00:36:43,773 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-24 00:36:43,774 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 12:36:43" (1/1) ... [2019-11-24 00:36:43,776 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@520cdd5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:36:43, skipping insertion in model container [2019-11-24 00:36:43,776 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 12:36:43" (1/1) ... [2019-11-24 00:36:43,783 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-24 00:36:43,831 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-24 00:36:44,164 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 00:36:44,258 INFO L203 MainTranslator]: Completed pre-run [2019-11-24 00:36:44,317 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 00:36:44,365 INFO L208 MainTranslator]: Completed translation [2019-11-24 00:36:44,366 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:36:44 WrapperNode [2019-11-24 00:36:44,366 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-24 00:36:44,367 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-24 00:36:44,367 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-24 00:36:44,367 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-24 00:36:44,375 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:36:44" (1/1) ... [2019-11-24 00:36:44,400 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:36:44" (1/1) ... [2019-11-24 00:36:44,421 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-24 00:36:44,421 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-24 00:36:44,421 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-24 00:36:44,421 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-24 00:36:44,429 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:36:44" (1/1) ... [2019-11-24 00:36:44,430 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:36:44" (1/1) ... [2019-11-24 00:36:44,434 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:36:44" (1/1) ... [2019-11-24 00:36:44,434 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:36:44" (1/1) ... [2019-11-24 00:36:44,443 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:36:44" (1/1) ... [2019-11-24 00:36:44,449 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:36:44" (1/1) ... [2019-11-24 00:36:44,451 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:36:44" (1/1) ... [2019-11-24 00:36:44,455 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-24 00:36:44,455 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-24 00:36:44,456 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-24 00:36:44,456 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-24 00:36:44,457 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:36:44" (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:36:44,506 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-24 00:36:44,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-24 00:36:44,507 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-24 00:36:44,510 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-24 00:36:44,510 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-24 00:36:44,510 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-24 00:36:44,510 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-24 00:36:44,510 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-24 00:36:44,962 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-24 00:36:44,963 INFO L284 CfgBuilder]: Removed 19 assume(true) statements. [2019-11-24 00:36:44,964 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 12:36:44 BoogieIcfgContainer [2019-11-24 00:36:44,964 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-24 00:36:44,966 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-24 00:36:44,966 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-24 00:36:44,969 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-24 00:36:44,969 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 12:36:43" (1/3) ... [2019-11-24 00:36:44,970 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d4fc6d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 12:36:44, skipping insertion in model container [2019-11-24 00:36:44,970 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:36:44" (2/3) ... [2019-11-24 00:36:44,971 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d4fc6d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 12:36:44, skipping insertion in model container [2019-11-24 00:36:44,971 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 12:36:44" (3/3) ... [2019-11-24 00:36:44,973 INFO L109 eAbstractionObserver]: Analyzing ICFG sll-token-2.i [2019-11-24 00:36:44,986 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-24 00:36:44,993 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2019-11-24 00:36:45,001 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-11-24 00:36:45,021 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-24 00:36:45,021 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-24 00:36:45,021 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-24 00:36:45,021 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-24 00:36:45,022 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-24 00:36:45,022 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-24 00:36:45,022 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-24 00:36:45,022 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-24 00:36:45,036 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states. [2019-11-24 00:36:45,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-11-24 00:36:45,042 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 00:36:45,043 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-11-24 00:36:45,044 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 00:36:45,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 00:36:45,048 INFO L82 PathProgramCache]: Analyzing trace with hash 176456257, now seen corresponding path program 1 times [2019-11-24 00:36:45,056 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 00:36:45,056 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690795048] [2019-11-24 00:36:45,057 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 00:36:45,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 00:36:45,186 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:36:45,187 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690795048] [2019-11-24 00:36:45,188 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 00:36:45,188 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 00:36:45,189 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844996778] [2019-11-24 00:36:45,194 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-24 00:36:45,195 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 00:36:45,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-24 00:36:45,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-24 00:36:45,210 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 2 states. [2019-11-24 00:36:45,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 00:36:45,233 INFO L93 Difference]: Finished difference Result 81 states and 127 transitions. [2019-11-24 00:36:45,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-24 00:36:45,235 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 5 [2019-11-24 00:36:45,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 00:36:45,245 INFO L225 Difference]: With dead ends: 81 [2019-11-24 00:36:45,245 INFO L226 Difference]: Without dead ends: 38 [2019-11-24 00:36:45,249 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-24 00:36:45,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-11-24 00:36:45,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-11-24 00:36:45,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-11-24 00:36:45,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2019-11-24 00:36:45,286 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 5 [2019-11-24 00:36:45,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 00:36:45,286 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2019-11-24 00:36:45,286 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-24 00:36:45,286 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2019-11-24 00:36:45,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-11-24 00:36:45,287 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 00:36:45,287 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-11-24 00:36:45,287 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 00:36:45,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 00:36:45,288 INFO L82 PathProgramCache]: Analyzing trace with hash 175689636, now seen corresponding path program 1 times [2019-11-24 00:36:45,288 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 00:36:45,288 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399627499] [2019-11-24 00:36:45,288 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 00:36:45,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 00:36:45,370 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:36:45,370 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399627499] [2019-11-24 00:36:45,370 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 00:36:45,371 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 00:36:45,371 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933064869] [2019-11-24 00:36:45,372 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 00:36:45,372 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 00:36:45,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 00:36:45,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 00:36:45,373 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. Second operand 3 states. [2019-11-24 00:36:45,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 00:36:45,430 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2019-11-24 00:36:45,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 00:36:45,431 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-11-24 00:36:45,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 00:36:45,432 INFO L225 Difference]: With dead ends: 38 [2019-11-24 00:36:45,432 INFO L226 Difference]: Without dead ends: 36 [2019-11-24 00:36:45,433 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:36:45,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-11-24 00:36:45,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-11-24 00:36:45,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-11-24 00:36:45,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2019-11-24 00:36:45,439 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 5 [2019-11-24 00:36:45,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 00:36:45,439 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2019-11-24 00:36:45,439 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 00:36:45,439 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2019-11-24 00:36:45,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-11-24 00:36:45,440 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 00:36:45,440 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-11-24 00:36:45,440 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 00:36:45,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 00:36:45,441 INFO L82 PathProgramCache]: Analyzing trace with hash 1151367906, now seen corresponding path program 1 times [2019-11-24 00:36:45,441 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 00:36:45,441 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202004081] [2019-11-24 00:36:45,442 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 00:36:45,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 00:36:45,531 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:36:45,531 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202004081] [2019-11-24 00:36:45,532 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 00:36:45,532 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 00:36:45,532 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808067871] [2019-11-24 00:36:45,533 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 00:36:45,533 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 00:36:45,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 00:36:45,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 00:36:45,534 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 4 states. [2019-11-24 00:36:45,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 00:36:45,615 INFO L93 Difference]: Finished difference Result 62 states and 65 transitions. [2019-11-24 00:36:45,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 00:36:45,616 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2019-11-24 00:36:45,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 00:36:45,617 INFO L225 Difference]: With dead ends: 62 [2019-11-24 00:36:45,617 INFO L226 Difference]: Without dead ends: 60 [2019-11-24 00:36:45,619 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-24 00:36:45,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-11-24 00:36:45,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 34. [2019-11-24 00:36:45,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-11-24 00:36:45,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 36 transitions. [2019-11-24 00:36:45,630 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 36 transitions. Word has length 6 [2019-11-24 00:36:45,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 00:36:45,631 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 36 transitions. [2019-11-24 00:36:45,631 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 00:36:45,631 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2019-11-24 00:36:45,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-24 00:36:45,633 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 00:36:45,633 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 00:36:45,633 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 00:36:45,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 00:36:45,634 INFO L82 PathProgramCache]: Analyzing trace with hash 855581616, now seen corresponding path program 1 times [2019-11-24 00:36:45,634 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 00:36:45,634 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551017308] [2019-11-24 00:36:45,634 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 00:36:45,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 00:36:45,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 00:36:45,743 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551017308] [2019-11-24 00:36:45,743 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 00:36:45,744 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 00:36:45,744 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196910682] [2019-11-24 00:36:45,745 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 00:36:45,745 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 00:36:45,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 00:36:45,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 00:36:45,746 INFO L87 Difference]: Start difference. First operand 34 states and 36 transitions. Second operand 5 states. [2019-11-24 00:36:45,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 00:36:45,857 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2019-11-24 00:36:45,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 00:36:45,857 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-11-24 00:36:45,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 00:36:45,858 INFO L225 Difference]: With dead ends: 34 [2019-11-24 00:36:45,858 INFO L226 Difference]: Without dead ends: 32 [2019-11-24 00:36:45,859 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-24 00:36:45,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-11-24 00:36:45,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-11-24 00:36:45,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-11-24 00:36:45,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2019-11-24 00:36:45,876 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 11 [2019-11-24 00:36:45,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 00:36:45,877 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2019-11-24 00:36:45,877 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 00:36:45,877 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2019-11-24 00:36:45,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-24 00:36:45,878 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 00:36:45,878 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 00:36:45,878 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 00:36:45,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 00:36:45,879 INFO L82 PathProgramCache]: Analyzing trace with hash 855619352, now seen corresponding path program 1 times [2019-11-24 00:36:45,879 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 00:36:45,879 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749315355] [2019-11-24 00:36:45,880 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 00:36:45,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 00:36:46,029 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:36:46,031 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749315355] [2019-11-24 00:36:46,031 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 00:36:46,032 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 00:36:46,032 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041528657] [2019-11-24 00:36:46,032 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 00:36:46,032 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 00:36:46,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 00:36:46,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 00:36:46,035 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand 5 states. [2019-11-24 00:36:46,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 00:36:46,206 INFO L93 Difference]: Finished difference Result 67 states and 72 transitions. [2019-11-24 00:36:46,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 00:36:46,207 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-11-24 00:36:46,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 00:36:46,208 INFO L225 Difference]: With dead ends: 67 [2019-11-24 00:36:46,209 INFO L226 Difference]: Without dead ends: 43 [2019-11-24 00:36:46,210 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-24 00:36:46,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-11-24 00:36:46,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 39. [2019-11-24 00:36:46,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-11-24 00:36:46,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2019-11-24 00:36:46,224 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 11 [2019-11-24 00:36:46,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 00:36:46,225 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2019-11-24 00:36:46,225 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 00:36:46,225 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2019-11-24 00:36:46,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-24 00:36:46,226 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 00:36:46,226 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 00:36:46,229 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 00:36:46,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 00:36:46,229 INFO L82 PathProgramCache]: Analyzing trace with hash -1714666408, now seen corresponding path program 1 times [2019-11-24 00:36:46,229 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 00:36:46,230 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849537625] [2019-11-24 00:36:46,230 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 00:36:46,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 00:36:46,408 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:36:46,412 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849537625] [2019-11-24 00:36:46,412 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 00:36:46,413 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 00:36:46,413 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333366885] [2019-11-24 00:36:46,413 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-24 00:36:46,413 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 00:36:46,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-24 00:36:46,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-24 00:36:46,415 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand 6 states. [2019-11-24 00:36:46,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 00:36:46,553 INFO L93 Difference]: Finished difference Result 49 states and 52 transitions. [2019-11-24 00:36:46,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-24 00:36:46,554 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2019-11-24 00:36:46,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 00:36:46,555 INFO L225 Difference]: With dead ends: 49 [2019-11-24 00:36:46,555 INFO L226 Difference]: Without dead ends: 47 [2019-11-24 00:36:46,556 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-24 00:36:46,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-11-24 00:36:46,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2019-11-24 00:36:46,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-11-24 00:36:46,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2019-11-24 00:36:46,561 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 15 [2019-11-24 00:36:46,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 00:36:46,562 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2019-11-24 00:36:46,562 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-24 00:36:46,562 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2019-11-24 00:36:46,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-24 00:36:46,563 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 00:36:46,563 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 00:36:46,563 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 00:36:46,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 00:36:46,564 INFO L82 PathProgramCache]: Analyzing trace with hash -2050025663, now seen corresponding path program 1 times [2019-11-24 00:36:46,564 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 00:36:46,564 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241155768] [2019-11-24 00:36:46,564 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 00:36:46,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 00:36:46,683 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:36:46,684 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241155768] [2019-11-24 00:36:46,684 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [150565268] [2019-11-24 00:36:46,684 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:36:46,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 00:36:46,771 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 30 conjunts are in the unsatisfiable core [2019-11-24 00:36:46,780 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-24 00:36:46,856 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 00:36:46,857 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:36:46,858 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-24 00:36:46,899 INFO L567 ElimStorePlain]: treesize reduction 10, result has 78.7 percent of original size [2019-11-24 00:36:46,904 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-24 00:36:46,905 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-24 00:36:46,927 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 00:36:46,928 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-24 00:36:46,928 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:33 [2019-11-24 00:36:46,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:36:47,027 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 00:36:47,028 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 60 treesize of output 82 [2019-11-24 00:36:47,029 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-24 00:36:47,131 INFO L343 Elim1Store]: treesize reduction 8, result has 87.3 percent of original size [2019-11-24 00:36:47,132 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 62 treesize of output 109 [2019-11-24 00:36:47,133 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-24 00:36:47,328 WARN L192 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 40 [2019-11-24 00:36:47,328 INFO L567 ElimStorePlain]: treesize reduction 38, result has 76.4 percent of original size [2019-11-24 00:36:47,346 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-24 00:36:47,354 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-24 00:36:47,418 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 00:36:47,428 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-24 00:36:47,436 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 49 [2019-11-24 00:36:47,438 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-24 00:36:47,446 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-24 00:36:47,453 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 55 [2019-11-24 00:36:47,454 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-24 00:36:47,500 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 00:36:47,501 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-24 00:36:47,502 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:123, output treesize:85 [2019-11-24 00:36:47,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:36:47,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:36:47,621 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 00:36:47,622 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 74 treesize of output 84 [2019-11-24 00:36:47,623 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-24 00:36:47,652 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 00:36:47,653 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 77 treesize of output 87 [2019-11-24 00:36:47,654 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-24 00:36:47,697 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 00:36:47,698 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 79 treesize of output 111 [2019-11-24 00:36:47,699 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-24 00:36:47,864 WARN L192 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 55 [2019-11-24 00:36:47,865 INFO L567 ElimStorePlain]: treesize reduction 78, result has 63.4 percent of original size [2019-11-24 00:36:47,872 INFO L392 ElimStorePlain]: Different costs {6=[|v_#memory_int_28|], 28=[|v_#memory_int_30|]} [2019-11-24 00:36:47,879 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-24 00:36:47,886 INFO L496 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-24 00:36:47,964 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 00:36:47,972 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-24 00:36:47,993 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 56 [2019-11-24 00:36:47,994 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-24 00:36:48,002 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-24 00:36:48,010 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 56 [2019-11-24 00:36:48,011 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-24 00:36:48,048 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 00:36:48,051 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-11-24 00:36:48,051 INFO L221 ElimStorePlain]: Needed 8 recursive calls to eliminate 7 variables, input treesize:231, output treesize:87 [2019-11-24 00:36:48,127 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 33 treesize of output 13 [2019-11-24 00:36:48,128 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-24 00:36:48,143 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 00:36:48,144 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-24 00:36:48,145 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:45, output treesize:3 [2019-11-24 00:36:48,152 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:36:48,153 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-24 00:36:48,170 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-24 00:36:48,183 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 00:36:48,184 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-24 00:36:48,184 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:47, output treesize:52 [2019-11-24 00:36:48,228 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-24 00:36:48,248 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 00:36:48,249 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-11-24 00:36:48,249 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:77, output treesize:93 [2019-11-24 00:36:48,289 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 00:36:48,290 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-11-24 00:36:48,290 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 10 [2019-11-24 00:36:48,290 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136472664] [2019-11-24 00:36:48,291 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-24 00:36:48,291 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 00:36:48,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-24 00:36:48,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-11-24 00:36:48,292 INFO L87 Difference]: Start difference. First operand 45 states and 48 transitions. Second operand 6 states. [2019-11-24 00:36:51,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 00:36:51,391 INFO L93 Difference]: Finished difference Result 57 states and 61 transitions. [2019-11-24 00:36:51,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 00:36:51,392 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2019-11-24 00:36:51,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 00:36:51,393 INFO L225 Difference]: With dead ends: 57 [2019-11-24 00:36:51,393 INFO L226 Difference]: Without dead ends: 55 [2019-11-24 00:36:51,393 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2019-11-24 00:36:51,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-11-24 00:36:51,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 49. [2019-11-24 00:36:51,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-11-24 00:36:51,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2019-11-24 00:36:51,400 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 15 [2019-11-24 00:36:51,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 00:36:51,400 INFO L462 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2019-11-24 00:36:51,400 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-24 00:36:51,401 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2019-11-24 00:36:51,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-24 00:36:51,401 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 00:36:51,401 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 00:36:51,602 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-24 00:36:51,603 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 00:36:51,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 00:36:51,604 INFO L82 PathProgramCache]: Analyzing trace with hash 942499841, now seen corresponding path program 1 times [2019-11-24 00:36:51,604 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 00:36:51,605 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188172679] [2019-11-24 00:36:51,605 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 00:36:51,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 00:36:51,753 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:36:51,753 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188172679] [2019-11-24 00:36:51,753 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [460875377] [2019-11-24 00:36:51,754 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:36:51,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 00:36:51,801 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 31 conjunts are in the unsatisfiable core [2019-11-24 00:36:51,803 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-24 00:36:51,830 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 00:36:51,831 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:36:51,831 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-24 00:36:51,867 INFO L567 ElimStorePlain]: treesize reduction 10, result has 78.7 percent of original size [2019-11-24 00:36:51,871 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-24 00:36:51,872 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-24 00:36:51,889 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 00:36:51,890 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-24 00:36:51,890 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:33 [2019-11-24 00:36:51,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:36:52,009 INFO L343 Elim1Store]: treesize reduction 8, result has 87.3 percent of original size [2019-11-24 00:36:52,010 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 62 treesize of output 109 [2019-11-24 00:36:52,012 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-24 00:36:52,037 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 00:36:52,038 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 60 treesize of output 82 [2019-11-24 00:36:52,039 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-24 00:36:52,188 WARN L192 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 40 [2019-11-24 00:36:52,189 INFO L567 ElimStorePlain]: treesize reduction 38, result has 76.4 percent of original size [2019-11-24 00:36:52,196 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-24 00:36:52,200 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-24 00:36:52,264 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 00:36:52,272 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-24 00:36:52,280 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 49 [2019-11-24 00:36:52,281 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-24 00:36:52,285 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-24 00:36:52,291 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 55 [2019-11-24 00:36:52,292 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-24 00:36:52,341 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 00:36:52,342 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-24 00:36:52,343 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:123, output treesize:85 [2019-11-24 00:36:52,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:36:52,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:36:52,475 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 00:36:52,475 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 79 treesize of output 111 [2019-11-24 00:36:52,477 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-24 00:36:52,506 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 00:36:52,507 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 74 treesize of output 84 [2019-11-24 00:36:52,508 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-24 00:36:52,530 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 00:36:52,531 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 77 treesize of output 87 [2019-11-24 00:36:52,532 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-24 00:36:52,673 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 55 [2019-11-24 00:36:52,675 INFO L567 ElimStorePlain]: treesize reduction 78, result has 63.4 percent of original size [2019-11-24 00:36:52,677 INFO L392 ElimStorePlain]: Different costs {6=[|v_#memory_int_35|], 28=[|v_#memory_int_37|]} [2019-11-24 00:36:52,680 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-24 00:36:52,687 INFO L496 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-24 00:36:52,743 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 00:36:52,751 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-24 00:36:52,775 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 56 [2019-11-24 00:36:52,776 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-24 00:36:52,781 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-24 00:36:52,791 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 56 [2019-11-24 00:36:52,792 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-24 00:36:52,837 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 00:36:52,840 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-11-24 00:36:52,840 INFO L221 ElimStorePlain]: Needed 8 recursive calls to eliminate 7 variables, input treesize:231, output treesize:87 [2019-11-24 00:36:52,920 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 33 treesize of output 13 [2019-11-24 00:36:52,921 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-24 00:36:52,927 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 00:36:52,927 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-24 00:36:52,928 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:45, output treesize:3 [2019-11-24 00:36:52,939 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:36:52,939 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-24 00:36:52,944 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-24 00:36:52,957 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 00:36:52,958 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-24 00:36:52,958 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:53 [2019-11-24 00:36:52,996 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-24 00:36:53,008 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 00:36:53,009 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-11-24 00:36:53,009 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:78, output treesize:94 [2019-11-24 00:36:53,048 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:36:53,048 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [480356647] [2019-11-24 00:36:53,075 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2019-11-24 00:36:53,076 INFO L166 IcfgInterpreter]: Building call graph [2019-11-24 00:36:53,085 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-11-24 00:36:53,095 INFO L176 IcfgInterpreter]: Starting interpretation [2019-11-24 00:36:53,095 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-11-24 00:37:34,950 WARN L213 Elim1Store]: Array PQE input equivalent to false [2019-11-24 00:37:41,639 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-24 00:38:03,158 WARN L192 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 78