/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-queue-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-24 00:35:21,222 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-24 00:35:21,224 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-24 00:35:21,238 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-24 00:35:21,238 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-24 00:35:21,239 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-24 00:35:21,241 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-24 00:35:21,242 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-24 00:35:21,244 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-24 00:35:21,245 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-24 00:35:21,246 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-24 00:35:21,247 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-24 00:35:21,247 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-24 00:35:21,248 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-24 00:35:21,249 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-24 00:35:21,251 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-24 00:35:21,252 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-24 00:35:21,253 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-24 00:35:21,254 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-24 00:35:21,256 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-24 00:35:21,258 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-24 00:35:21,259 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-24 00:35:21,260 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-24 00:35:21,261 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-24 00:35:21,263 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-24 00:35:21,264 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-24 00:35:21,264 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-24 00:35:21,265 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-24 00:35:21,265 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-24 00:35:21,266 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-24 00:35:21,266 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-24 00:35:21,267 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-24 00:35:21,268 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-24 00:35:21,270 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-24 00:35:21,271 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-24 00:35:21,271 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-24 00:35:21,271 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-24 00:35:21,272 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-24 00:35:21,272 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-24 00:35:21,274 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-24 00:35:21,278 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-24 00:35:21,279 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:35:21,304 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-24 00:35:21,304 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-24 00:35:21,305 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-24 00:35:21,305 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-24 00:35:21,306 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-24 00:35:21,306 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-24 00:35:21,306 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-24 00:35:21,306 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-24 00:35:21,306 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-24 00:35:21,307 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-24 00:35:21,308 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-24 00:35:21,308 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-24 00:35:21,308 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-24 00:35:21,309 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-24 00:35:21,309 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-24 00:35:21,310 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-24 00:35:21,310 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-24 00:35:21,311 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-24 00:35:21,311 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-24 00:35:21,311 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-24 00:35:21,312 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-24 00:35:21,312 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-24 00:35:21,312 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-24 00:35:21,312 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-24 00:35:21,312 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-24 00:35:21,312 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-24 00:35:21,313 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-24 00:35:21,313 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-24 00:35:21,314 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-24 00:35:21,315 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-24 00:35:21,315 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-24 00:35:21,315 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-24 00:35:21,315 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-24 00:35:21,316 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-24 00:35:21,316 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-24 00:35:21,316 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-24 00:35:21,317 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-24 00:35:21,317 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-11-24 00:35:21,614 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-24 00:35:21,626 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-24 00:35:21,630 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-24 00:35:21,631 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-24 00:35:21,632 INFO L275 PluginConnector]: CDTParser initialized [2019-11-24 00:35:21,632 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/sll-queue-1.i [2019-11-24 00:35:21,690 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/46be20552/282a91c71d574c38b3a6fd4ff6048204/FLAGfcc89f4d3 [2019-11-24 00:35:22,225 INFO L306 CDTParser]: Found 1 translation units. [2019-11-24 00:35:22,228 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-queue-1.i [2019-11-24 00:35:22,244 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/46be20552/282a91c71d574c38b3a6fd4ff6048204/FLAGfcc89f4d3 [2019-11-24 00:35:22,522 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/46be20552/282a91c71d574c38b3a6fd4ff6048204 [2019-11-24 00:35:22,532 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-24 00:35:22,535 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-24 00:35:22,536 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-24 00:35:22,536 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-24 00:35:22,539 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-24 00:35:22,540 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 12:35:22" (1/1) ... [2019-11-24 00:35:22,543 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f2ff70c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:35:22, skipping insertion in model container [2019-11-24 00:35:22,543 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 12:35:22" (1/1) ... [2019-11-24 00:35:22,551 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-24 00:35:22,603 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-24 00:35:23,020 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 00:35:23,031 INFO L203 MainTranslator]: Completed pre-run [2019-11-24 00:35:23,095 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 00:35:23,145 INFO L208 MainTranslator]: Completed translation [2019-11-24 00:35:23,146 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:35:23 WrapperNode [2019-11-24 00:35:23,146 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-24 00:35:23,147 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-24 00:35:23,147 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-24 00:35:23,147 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-24 00:35:23,156 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:35:23" (1/1) ... [2019-11-24 00:35:23,180 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:35:23" (1/1) ... [2019-11-24 00:35:23,208 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-24 00:35:23,208 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-24 00:35:23,209 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-24 00:35:23,209 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-24 00:35:23,216 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:35:23" (1/1) ... [2019-11-24 00:35:23,216 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:35:23" (1/1) ... [2019-11-24 00:35:23,221 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:35:23" (1/1) ... [2019-11-24 00:35:23,221 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:35:23" (1/1) ... [2019-11-24 00:35:23,230 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:35:23" (1/1) ... [2019-11-24 00:35:23,238 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:35:23" (1/1) ... [2019-11-24 00:35:23,241 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:35:23" (1/1) ... [2019-11-24 00:35:23,245 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-24 00:35:23,245 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-24 00:35:23,246 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-24 00:35:23,246 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-24 00:35:23,247 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:35:23" (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:35:23,312 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-24 00:35:23,312 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-24 00:35:23,312 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-24 00:35:23,312 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-24 00:35:23,313 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-24 00:35:23,313 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-24 00:35:23,313 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-24 00:35:23,313 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-24 00:35:23,972 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-24 00:35:23,972 INFO L284 CfgBuilder]: Removed 35 assume(true) statements. [2019-11-24 00:35:23,973 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 12:35:23 BoogieIcfgContainer [2019-11-24 00:35:23,974 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-24 00:35:23,975 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-24 00:35:23,975 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-24 00:35:23,978 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-24 00:35:23,978 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 12:35:22" (1/3) ... [2019-11-24 00:35:23,979 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13f3835e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 12:35:23, skipping insertion in model container [2019-11-24 00:35:23,979 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:35:23" (2/3) ... [2019-11-24 00:35:23,980 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13f3835e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 12:35:23, skipping insertion in model container [2019-11-24 00:35:23,980 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 12:35:23" (3/3) ... [2019-11-24 00:35:23,982 INFO L109 eAbstractionObserver]: Analyzing ICFG sll-queue-1.i [2019-11-24 00:35:23,992 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-24 00:35:24,000 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 14 error locations. [2019-11-24 00:35:24,012 INFO L249 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2019-11-24 00:35:24,046 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-24 00:35:24,046 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-24 00:35:24,046 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-24 00:35:24,047 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-24 00:35:24,047 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-24 00:35:24,047 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-24 00:35:24,047 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-24 00:35:24,047 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-24 00:35:24,072 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states. [2019-11-24 00:35:24,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-11-24 00:35:24,078 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 00:35:24,079 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-11-24 00:35:24,080 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.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 00:35:24,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 00:35:24,086 INFO L82 PathProgramCache]: Analyzing trace with hash 11175788, now seen corresponding path program 1 times [2019-11-24 00:35:24,095 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 00:35:24,095 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936737375] [2019-11-24 00:35:24,096 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 00:35:24,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 00:35:24,223 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:35:24,223 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936737375] [2019-11-24 00:35:24,224 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 00:35:24,224 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 00:35:24,225 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908590187] [2019-11-24 00:35:24,229 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-24 00:35:24,230 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 00:35:24,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-24 00:35:24,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-24 00:35:24,247 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 2 states. [2019-11-24 00:35:24,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 00:35:24,275 INFO L93 Difference]: Finished difference Result 151 states and 249 transitions. [2019-11-24 00:35:24,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-24 00:35:24,277 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 4 [2019-11-24 00:35:24,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 00:35:24,288 INFO L225 Difference]: With dead ends: 151 [2019-11-24 00:35:24,289 INFO L226 Difference]: Without dead ends: 74 [2019-11-24 00:35:24,293 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:35:24,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-11-24 00:35:24,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-11-24 00:35:24,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-11-24 00:35:24,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 78 transitions. [2019-11-24 00:35:24,336 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 78 transitions. Word has length 4 [2019-11-24 00:35:24,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 00:35:24,336 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 78 transitions. [2019-11-24 00:35:24,337 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-24 00:35:24,337 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 78 transitions. [2019-11-24 00:35:24,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-11-24 00:35:24,337 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 00:35:24,338 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-11-24 00:35:24,338 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.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 00:35:24,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 00:35:24,339 INFO L82 PathProgramCache]: Analyzing trace with hash 345025043, now seen corresponding path program 1 times [2019-11-24 00:35:24,339 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 00:35:24,339 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107351116] [2019-11-24 00:35:24,340 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 00:35:24,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 00:35:24,434 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:35:24,435 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107351116] [2019-11-24 00:35:24,435 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 00:35:24,435 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 00:35:24,436 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63899609] [2019-11-24 00:35:24,438 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 00:35:24,438 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 00:35:24,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 00:35:24,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 00:35:24,439 INFO L87 Difference]: Start difference. First operand 74 states and 78 transitions. Second operand 3 states. [2019-11-24 00:35:24,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 00:35:24,497 INFO L93 Difference]: Finished difference Result 74 states and 78 transitions. [2019-11-24 00:35:24,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 00:35:24,498 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-11-24 00:35:24,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 00:35:24,499 INFO L225 Difference]: With dead ends: 74 [2019-11-24 00:35:24,500 INFO L226 Difference]: Without dead ends: 64 [2019-11-24 00:35:24,501 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:35:24,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-11-24 00:35:24,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-11-24 00:35:24,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-11-24 00:35:24,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 68 transitions. [2019-11-24 00:35:24,509 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 68 transitions. Word has length 5 [2019-11-24 00:35:24,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 00:35:24,510 INFO L462 AbstractCegarLoop]: Abstraction has 64 states and 68 transitions. [2019-11-24 00:35:24,510 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 00:35:24,510 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2019-11-24 00:35:24,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-24 00:35:24,511 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 00:35:24,511 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-24 00:35:24,511 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.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 00:35:24,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 00:35:24,512 INFO L82 PathProgramCache]: Analyzing trace with hash 856712023, now seen corresponding path program 1 times [2019-11-24 00:35:24,512 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 00:35:24,512 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910172620] [2019-11-24 00:35:24,513 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 00:35:24,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 00:35:24,603 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:35:24,603 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910172620] [2019-11-24 00:35:24,603 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 00:35:24,603 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 00:35:24,606 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212103442] [2019-11-24 00:35:24,606 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 00:35:24,607 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 00:35:24,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 00:35:24,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 00:35:24,607 INFO L87 Difference]: Start difference. First operand 64 states and 68 transitions. Second operand 3 states. [2019-11-24 00:35:24,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 00:35:24,648 INFO L93 Difference]: Finished difference Result 64 states and 68 transitions. [2019-11-24 00:35:24,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 00:35:24,648 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-11-24 00:35:24,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 00:35:24,649 INFO L225 Difference]: With dead ends: 64 [2019-11-24 00:35:24,649 INFO L226 Difference]: Without dead ends: 62 [2019-11-24 00:35:24,650 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:35:24,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-11-24 00:35:24,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-11-24 00:35:24,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-11-24 00:35:24,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 66 transitions. [2019-11-24 00:35:24,656 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 66 transitions. Word has length 7 [2019-11-24 00:35:24,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 00:35:24,657 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 66 transitions. [2019-11-24 00:35:24,657 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 00:35:24,657 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 66 transitions. [2019-11-24 00:35:24,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-24 00:35:24,658 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 00:35:24,658 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 00:35:24,658 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.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 00:35:24,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 00:35:24,659 INFO L82 PathProgramCache]: Analyzing trace with hash 630794574, now seen corresponding path program 1 times [2019-11-24 00:35:24,659 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 00:35:24,659 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424390691] [2019-11-24 00:35:24,659 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 00:35:24,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 00:35:24,719 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:35:24,720 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424390691] [2019-11-24 00:35:24,720 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 00:35:24,720 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 00:35:24,720 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655288665] [2019-11-24 00:35:24,721 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 00:35:24,723 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 00:35:24,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 00:35:24,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 00:35:24,724 INFO L87 Difference]: Start difference. First operand 62 states and 66 transitions. Second operand 3 states. [2019-11-24 00:35:24,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 00:35:24,781 INFO L93 Difference]: Finished difference Result 130 states and 140 transitions. [2019-11-24 00:35:24,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 00:35:24,785 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-11-24 00:35:24,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 00:35:24,785 INFO L225 Difference]: With dead ends: 130 [2019-11-24 00:35:24,786 INFO L226 Difference]: Without dead ends: 78 [2019-11-24 00:35:24,786 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:35:24,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-11-24 00:35:24,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 69. [2019-11-24 00:35:24,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-11-24 00:35:24,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 74 transitions. [2019-11-24 00:35:24,794 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 74 transitions. Word has length 11 [2019-11-24 00:35:24,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 00:35:24,795 INFO L462 AbstractCegarLoop]: Abstraction has 69 states and 74 transitions. [2019-11-24 00:35:24,795 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 00:35:24,795 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 74 transitions. [2019-11-24 00:35:24,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-24 00:35:24,796 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 00:35:24,796 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 00:35:24,796 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.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 00:35:24,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 00:35:24,797 INFO L82 PathProgramCache]: Analyzing trace with hash 2084416662, now seen corresponding path program 1 times [2019-11-24 00:35:24,797 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 00:35:24,797 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524959850] [2019-11-24 00:35:24,797 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 00:35:24,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 00:35:24,848 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:35:24,849 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524959850] [2019-11-24 00:35:24,849 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 00:35:24,849 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 00:35:24,849 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709457453] [2019-11-24 00:35:24,850 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 00:35:24,850 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 00:35:24,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 00:35:24,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 00:35:24,851 INFO L87 Difference]: Start difference. First operand 69 states and 74 transitions. Second operand 4 states. [2019-11-24 00:35:24,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 00:35:24,917 INFO L93 Difference]: Finished difference Result 78 states and 83 transitions. [2019-11-24 00:35:24,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 00:35:24,917 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-11-24 00:35:24,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 00:35:24,918 INFO L225 Difference]: With dead ends: 78 [2019-11-24 00:35:24,918 INFO L226 Difference]: Without dead ends: 64 [2019-11-24 00:35:24,919 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:35:24,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-11-24 00:35:24,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-11-24 00:35:24,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-11-24 00:35:24,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 68 transitions. [2019-11-24 00:35:24,925 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 68 transitions. Word has length 14 [2019-11-24 00:35:24,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 00:35:24,925 INFO L462 AbstractCegarLoop]: Abstraction has 64 states and 68 transitions. [2019-11-24 00:35:24,925 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 00:35:24,925 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2019-11-24 00:35:24,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-24 00:35:24,926 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 00:35:24,926 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 00:35:24,926 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.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 00:35:24,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 00:35:24,927 INFO L82 PathProgramCache]: Analyzing trace with hash 257003891, now seen corresponding path program 1 times [2019-11-24 00:35:24,927 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 00:35:24,927 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750558434] [2019-11-24 00:35:24,928 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 00:35:24,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 00:35:25,192 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 00:35:25,192 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750558434] [2019-11-24 00:35:25,192 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1131247765] [2019-11-24 00:35:25,193 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:35:25,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 00:35:25,258 INFO L255 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-24 00:35:25,264 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-24 00:35:25,339 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 00:35:25,339 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:35:25,340 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-24 00:35:25,372 INFO L567 ElimStorePlain]: treesize reduction 10, result has 70.6 percent of original size [2019-11-24 00:35:25,373 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-24 00:35:25,373 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:24 [2019-11-24 00:35:25,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:35:25,447 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 00:35:25,448 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 96 treesize of output 106 [2019-11-24 00:35:25,449 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-24 00:35:25,459 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 90 [2019-11-24 00:35:25,459 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-24 00:35:25,534 INFO L567 ElimStorePlain]: treesize reduction 89, result has 48.9 percent of original size [2019-11-24 00:35:25,541 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-24 00:35:25,556 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 00:35:25,571 INFO L343 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-11-24 00:35:25,572 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 15 [2019-11-24 00:35:25,572 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-24 00:35:25,585 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 00:35:25,585 INFO L464 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.offset_41| vanished before elimination [2019-11-24 00:35:25,587 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-24 00:35:25,587 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:191, output treesize:28 [2019-11-24 00:35:25,686 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 00:35:25,686 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 30 [2019-11-24 00:35:25,687 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-24 00:35:25,702 INFO L567 ElimStorePlain]: treesize reduction 12, result has 42.9 percent of original size [2019-11-24 00:35:25,703 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-24 00:35:25,703 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:4 [2019-11-24 00:35:25,709 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 00:35:25,709 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-24 00:35:25,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:35:25,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:35:25,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:35:25,774 INFO L392 ElimStorePlain]: Different costs {0=[v_prenex_10, |#memory_$Pointer$.base|, |#memory_$Pointer$.offset|, v_prenex_14, v_prenex_13, v_prenex_17, v_prenex_6, |v_#memory_$Pointer$.offset_42|, v_prenex_7], 2=[v_prenex_2, v_prenex_11, |v_#memory_$Pointer$.base_42|, v_prenex_4]} [2019-11-24 00:35:25,786 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-24 00:35:26,696 WARN L192 SmtUtils]: Spent 907.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 138 [2019-11-24 00:35:26,699 INFO L567 ElimStorePlain]: treesize reduction 9, result has 97.2 percent of original size [2019-11-24 00:35:26,743 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-24 00:35:26,907 INFO L343 Elim1Store]: treesize reduction 49, result has 43.7 percent of original size [2019-11-24 00:35:26,908 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 100 treesize of output 98 [2019-11-24 00:35:26,909 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-24 00:35:27,488 WARN L192 SmtUtils]: Spent 578.00 ms on a formula simplification that was a NOOP. DAG size: 143 [2019-11-24 00:35:27,489 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 00:35:27,504 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-24 00:35:27,582 INFO L343 Elim1Store]: treesize reduction 49, result has 43.7 percent of original size [2019-11-24 00:35:27,583 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 98 treesize of output 96 [2019-11-24 00:35:27,584 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-24 00:35:27,868 WARN L192 SmtUtils]: Spent 283.00 ms on a formula simplification that was a NOOP. DAG size: 140 [2019-11-24 00:35:27,868 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 00:35:27,901 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-24 00:35:27,956 INFO L343 Elim1Store]: treesize reduction 49, result has 43.7 percent of original size [2019-11-24 00:35:27,957 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 100 treesize of output 98 [2019-11-24 00:35:27,958 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-24 00:35:28,234 WARN L192 SmtUtils]: Spent 275.00 ms on a formula simplification that was a NOOP. DAG size: 145 [2019-11-24 00:35:28,234 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 00:35:28,243 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-24 00:35:28,304 INFO L343 Elim1Store]: treesize reduction 49, result has 43.7 percent of original size [2019-11-24 00:35:28,304 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 98 treesize of output 96 [2019-11-24 00:35:28,305 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-24 00:35:28,476 WARN L192 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 142 [2019-11-24 00:35:28,478 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 00:35:28,498 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 00:35:28,499 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 96 treesize of output 99 [2019-11-24 00:35:28,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:35:28,500 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-24 00:35:28,813 WARN L192 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 131 [2019-11-24 00:35:28,814 INFO L567 ElimStorePlain]: treesize reduction 31, result has 89.6 percent of original size [2019-11-24 00:35:28,882 INFO L343 Elim1Store]: treesize reduction 76, result has 33.3 percent of original size [2019-11-24 00:35:28,882 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 2 case distinctions, treesize of input 61 treesize of output 59 [2019-11-24 00:35:28,883 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-24 00:35:29,045 WARN L192 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 136 [2019-11-24 00:35:29,046 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 00:35:29,060 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 00:35:29,060 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 96 treesize of output 99 [2019-11-24 00:35:29,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:35:29,062 INFO L496 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-11-24 00:35:29,311 WARN L192 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 125 [2019-11-24 00:35:29,313 INFO L567 ElimStorePlain]: treesize reduction 31, result has 88.1 percent of original size [2019-11-24 00:35:29,313 INFO L464 ElimStorePlain]: Eliminatee v_prenex_7 vanished before elimination [2019-11-24 00:35:29,325 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 149 treesize of output 141 [2019-11-24 00:35:29,327 INFO L496 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-11-24 00:35:29,720 WARN L192 SmtUtils]: Spent 392.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 123 [2019-11-24 00:35:29,722 INFO L567 ElimStorePlain]: treesize reduction 94, result has 69.4 percent of original size [2019-11-24 00:35:29,750 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 00:35:29,750 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 3 case distinctions, treesize of input 59 treesize of output 80 [2019-11-24 00:35:29,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:35:29,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:35:29,753 INFO L496 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-11-24 00:35:30,002 WARN L192 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 110 [2019-11-24 00:35:30,003 INFO L567 ElimStorePlain]: treesize reduction 17, result has 92.0 percent of original size [2019-11-24 00:35:30,034 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 00:35:30,035 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 3 case distinctions, treesize of input 59 treesize of output 80 [2019-11-24 00:35:30,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:35:30,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:35:30,039 INFO L496 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-11-24 00:35:30,298 WARN L192 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 97 [2019-11-24 00:35:30,299 INFO L567 ElimStorePlain]: treesize reduction 17, result has 91.2 percent of original size [2019-11-24 00:35:30,335 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 00:35:30,336 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 3 case distinctions, treesize of input 59 treesize of output 80 [2019-11-24 00:35:30,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:35:30,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:35:30,340 INFO L496 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-11-24 00:35:30,564 WARN L192 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 84 [2019-11-24 00:35:30,565 INFO L567 ElimStorePlain]: treesize reduction 17, result has 90.3 percent of original size [2019-11-24 00:35:30,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-24 00:35:30,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:35:30,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-24 00:35:30,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-24 00:35:30,574 INFO L496 ElimStorePlain]: Start of recursive call 1: 11 dim-0 vars, 13 dim-2 vars, End of recursive call: 8 dim-0 vars, and 4 xjuncts. [2019-11-24 00:35:30,574 INFO L221 ElimStorePlain]: Needed 13 recursive calls to eliminate 24 variables, input treesize:361, output treesize:174 [2019-11-24 00:35:30,667 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 00:35:30,667 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2139307369] [2019-11-24 00:35:30,692 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2019-11-24 00:35:30,692 INFO L166 IcfgInterpreter]: Building call graph [2019-11-24 00:35:30,699 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-11-24 00:35:30,706 INFO L176 IcfgInterpreter]: Starting interpretation [2019-11-24 00:35:30,706 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-11-24 00:35:31,098 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-24 00:35:31,603 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 222 DAG size of output: 112 [2019-11-24 00:35:31,921 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-24 00:35:33,260 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2019-11-24 00:35:34,310 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-24 00:35:36,421 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-24 00:35:36,437 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-24 00:35:36,452 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-24 00:35:43,673 WARN L192 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 84 [2019-11-24 00:35:45,496 WARN L192 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 61 [2019-11-24 00:35:45,927 WARN L192 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 1026 DAG size of output: 894