/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-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-24 00:35:31,423 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-24 00:35:31,425 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-24 00:35:31,438 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-24 00:35:31,438 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-24 00:35:31,439 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-24 00:35:31,440 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-24 00:35:31,442 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-24 00:35:31,444 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-24 00:35:31,445 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-24 00:35:31,445 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-24 00:35:31,446 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-24 00:35:31,447 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-24 00:35:31,448 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-24 00:35:31,449 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-24 00:35:31,450 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-24 00:35:31,450 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-24 00:35:31,451 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-24 00:35:31,453 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-24 00:35:31,455 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-24 00:35:31,456 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-24 00:35:31,457 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-24 00:35:31,459 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-24 00:35:31,459 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-24 00:35:31,462 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-24 00:35:31,462 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-24 00:35:31,462 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-24 00:35:31,463 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-24 00:35:31,463 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-24 00:35:31,467 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-24 00:35:31,467 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-24 00:35:31,468 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-24 00:35:31,468 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-24 00:35:31,469 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-24 00:35:31,472 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-24 00:35:31,472 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-24 00:35:31,472 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-24 00:35:31,473 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-24 00:35:31,473 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-24 00:35:31,474 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-24 00:35:31,474 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-24 00:35:31,478 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:31,500 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-24 00:35:31,500 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-24 00:35:31,501 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-24 00:35:31,501 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-24 00:35:31,501 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-24 00:35:31,502 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-24 00:35:31,502 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-24 00:35:31,502 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-24 00:35:31,502 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-24 00:35:31,502 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-24 00:35:31,503 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-24 00:35:31,504 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-24 00:35:31,504 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-24 00:35:31,504 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-24 00:35:31,505 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-24 00:35:31,505 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-24 00:35:31,506 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-24 00:35:31,506 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-24 00:35:31,506 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-24 00:35:31,506 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-24 00:35:31,507 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-24 00:35:31,507 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-24 00:35:31,507 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-24 00:35:31,507 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-24 00:35:31,508 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-24 00:35:31,508 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-24 00:35:31,508 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-24 00:35:31,508 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-24 00:35:31,509 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-24 00:35:31,510 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-24 00:35:31,510 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-24 00:35:31,510 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-24 00:35:31,510 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-24 00:35:31,510 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-24 00:35:31,511 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-24 00:35:31,511 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-24 00:35:31,511 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-24 00:35:31,512 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-11-24 00:35:31,770 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-24 00:35:31,780 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-24 00:35:31,784 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-24 00:35:31,785 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-24 00:35:31,786 INFO L275 PluginConnector]: CDTParser initialized [2019-11-24 00:35:31,786 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/sll-queue-2.i [2019-11-24 00:35:31,858 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71cbde63d/e04f594dd142492a9816bda18a5ee04f/FLAG93cd5e167 [2019-11-24 00:35:32,376 INFO L306 CDTParser]: Found 1 translation units. [2019-11-24 00:35:32,377 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-queue-2.i [2019-11-24 00:35:32,394 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71cbde63d/e04f594dd142492a9816bda18a5ee04f/FLAG93cd5e167 [2019-11-24 00:35:32,627 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71cbde63d/e04f594dd142492a9816bda18a5ee04f [2019-11-24 00:35:32,636 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-24 00:35:32,638 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-24 00:35:32,639 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-24 00:35:32,639 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-24 00:35:32,642 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-24 00:35:32,643 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 12:35:32" (1/1) ... [2019-11-24 00:35:32,648 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35d622ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:35:32, skipping insertion in model container [2019-11-24 00:35:32,648 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 12:35:32" (1/1) ... [2019-11-24 00:35:32,655 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-24 00:35:32,714 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-24 00:35:33,138 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 00:35:33,150 INFO L203 MainTranslator]: Completed pre-run [2019-11-24 00:35:33,197 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 00:35:33,259 INFO L208 MainTranslator]: Completed translation [2019-11-24 00:35:33,259 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:35:33 WrapperNode [2019-11-24 00:35:33,259 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-24 00:35:33,260 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-24 00:35:33,260 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-24 00:35:33,260 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-24 00:35:33,267 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:33" (1/1) ... [2019-11-24 00:35:33,287 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:33" (1/1) ... [2019-11-24 00:35:33,313 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-24 00:35:33,314 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-24 00:35:33,314 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-24 00:35:33,314 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-24 00:35:33,325 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:33" (1/1) ... [2019-11-24 00:35:33,325 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:33" (1/1) ... [2019-11-24 00:35:33,329 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:33" (1/1) ... [2019-11-24 00:35:33,330 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:33" (1/1) ... [2019-11-24 00:35:33,339 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:33" (1/1) ... [2019-11-24 00:35:33,353 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:33" (1/1) ... [2019-11-24 00:35:33,356 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:33" (1/1) ... [2019-11-24 00:35:33,360 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-24 00:35:33,360 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-24 00:35:33,360 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-24 00:35:33,360 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-24 00:35:33,361 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:35:33" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-24 00:35:33,414 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-24 00:35:33,414 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-24 00:35:33,414 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-24 00:35:33,414 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-24 00:35:33,414 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-24 00:35:33,415 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-24 00:35:33,415 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-24 00:35:33,415 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-24 00:35:34,085 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-24 00:35:34,086 INFO L284 CfgBuilder]: Removed 35 assume(true) statements. [2019-11-24 00:35:34,087 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 12:35:34 BoogieIcfgContainer [2019-11-24 00:35:34,087 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-24 00:35:34,088 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-24 00:35:34,088 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-24 00:35:34,091 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-24 00:35:34,092 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 12:35:32" (1/3) ... [2019-11-24 00:35:34,092 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a5e238f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 12:35:34, skipping insertion in model container [2019-11-24 00:35:34,093 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:35:33" (2/3) ... [2019-11-24 00:35:34,093 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a5e238f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 12:35:34, skipping insertion in model container [2019-11-24 00:35:34,093 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 12:35:34" (3/3) ... [2019-11-24 00:35:34,095 INFO L109 eAbstractionObserver]: Analyzing ICFG sll-queue-2.i [2019-11-24 00:35:34,105 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-24 00:35:34,114 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 14 error locations. [2019-11-24 00:35:34,126 INFO L249 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2019-11-24 00:35:34,158 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-24 00:35:34,158 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-24 00:35:34,158 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-24 00:35:34,159 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-24 00:35:34,159 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-24 00:35:34,159 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-24 00:35:34,159 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-24 00:35:34,160 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-24 00:35:34,183 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states. [2019-11-24 00:35:34,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-11-24 00:35:34,189 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 00:35:34,190 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-11-24 00:35:34,191 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:34,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 00:35:34,197 INFO L82 PathProgramCache]: Analyzing trace with hash 11175788, now seen corresponding path program 1 times [2019-11-24 00:35:34,206 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 00:35:34,207 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539810105] [2019-11-24 00:35:34,207 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 00:35:34,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 00:35:34,339 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:34,340 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539810105] [2019-11-24 00:35:34,341 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 00:35:34,341 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 00:35:34,342 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802901082] [2019-11-24 00:35:34,347 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-24 00:35:34,348 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 00:35:34,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-24 00:35:34,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-24 00:35:34,365 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 2 states. [2019-11-24 00:35:34,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 00:35:34,398 INFO L93 Difference]: Finished difference Result 151 states and 249 transitions. [2019-11-24 00:35:34,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-24 00:35:34,399 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 4 [2019-11-24 00:35:34,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 00:35:34,414 INFO L225 Difference]: With dead ends: 151 [2019-11-24 00:35:34,414 INFO L226 Difference]: Without dead ends: 74 [2019-11-24 00:35:34,418 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:34,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-11-24 00:35:34,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-11-24 00:35:34,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-11-24 00:35:34,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 78 transitions. [2019-11-24 00:35:34,467 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 78 transitions. Word has length 4 [2019-11-24 00:35:34,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 00:35:34,468 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 78 transitions. [2019-11-24 00:35:34,468 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-24 00:35:34,468 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 78 transitions. [2019-11-24 00:35:34,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-11-24 00:35:34,469 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 00:35:34,469 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-11-24 00:35:34,470 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:34,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 00:35:34,471 INFO L82 PathProgramCache]: Analyzing trace with hash 345025043, now seen corresponding path program 1 times [2019-11-24 00:35:34,471 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 00:35:34,472 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038765569] [2019-11-24 00:35:34,472 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 00:35:34,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 00:35:34,574 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:34,575 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038765569] [2019-11-24 00:35:34,575 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 00:35:34,575 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 00:35:34,576 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948070952] [2019-11-24 00:35:34,577 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 00:35:34,577 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 00:35:34,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 00:35:34,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 00:35:34,578 INFO L87 Difference]: Start difference. First operand 74 states and 78 transitions. Second operand 3 states. [2019-11-24 00:35:34,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 00:35:34,641 INFO L93 Difference]: Finished difference Result 74 states and 78 transitions. [2019-11-24 00:35:34,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 00:35:34,642 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-11-24 00:35:34,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 00:35:34,643 INFO L225 Difference]: With dead ends: 74 [2019-11-24 00:35:34,644 INFO L226 Difference]: Without dead ends: 64 [2019-11-24 00:35:34,645 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:34,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-11-24 00:35:34,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-11-24 00:35:34,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-11-24 00:35:34,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 68 transitions. [2019-11-24 00:35:34,661 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 68 transitions. Word has length 5 [2019-11-24 00:35:34,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 00:35:34,662 INFO L462 AbstractCegarLoop]: Abstraction has 64 states and 68 transitions. [2019-11-24 00:35:34,662 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 00:35:34,662 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2019-11-24 00:35:34,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-24 00:35:34,662 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 00:35:34,691 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-24 00:35:34,691 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:34,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 00:35:34,692 INFO L82 PathProgramCache]: Analyzing trace with hash 856712023, now seen corresponding path program 1 times [2019-11-24 00:35:34,693 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 00:35:34,693 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016137343] [2019-11-24 00:35:34,693 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 00:35:34,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 00:35:34,793 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:34,793 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016137343] [2019-11-24 00:35:34,794 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 00:35:34,794 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 00:35:34,794 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799815142] [2019-11-24 00:35:34,794 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 00:35:34,795 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 00:35:34,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 00:35:34,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 00:35:34,796 INFO L87 Difference]: Start difference. First operand 64 states and 68 transitions. Second operand 3 states. [2019-11-24 00:35:34,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 00:35:34,833 INFO L93 Difference]: Finished difference Result 64 states and 68 transitions. [2019-11-24 00:35:34,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 00:35:34,834 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-11-24 00:35:34,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 00:35:34,835 INFO L225 Difference]: With dead ends: 64 [2019-11-24 00:35:34,835 INFO L226 Difference]: Without dead ends: 62 [2019-11-24 00:35:34,835 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:34,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-11-24 00:35:34,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-11-24 00:35:34,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-11-24 00:35:34,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 66 transitions. [2019-11-24 00:35:34,842 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 66 transitions. Word has length 7 [2019-11-24 00:35:34,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 00:35:34,842 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 66 transitions. [2019-11-24 00:35:34,842 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 00:35:34,843 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 66 transitions. [2019-11-24 00:35:34,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-24 00:35:34,843 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 00:35:34,844 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 00:35:34,844 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:34,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 00:35:34,844 INFO L82 PathProgramCache]: Analyzing trace with hash 630794574, now seen corresponding path program 1 times [2019-11-24 00:35:34,845 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 00:35:34,845 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240241311] [2019-11-24 00:35:34,845 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 00:35:34,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 00:35:34,872 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:34,872 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240241311] [2019-11-24 00:35:34,873 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 00:35:34,873 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 00:35:34,873 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66675262] [2019-11-24 00:35:34,873 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 00:35:34,874 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 00:35:34,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 00:35:34,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 00:35:34,874 INFO L87 Difference]: Start difference. First operand 62 states and 66 transitions. Second operand 3 states. [2019-11-24 00:35:34,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 00:35:34,925 INFO L93 Difference]: Finished difference Result 130 states and 140 transitions. [2019-11-24 00:35:34,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 00:35:34,926 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-11-24 00:35:34,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 00:35:34,927 INFO L225 Difference]: With dead ends: 130 [2019-11-24 00:35:34,927 INFO L226 Difference]: Without dead ends: 78 [2019-11-24 00:35:34,928 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:34,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-11-24 00:35:34,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 69. [2019-11-24 00:35:34,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-11-24 00:35:34,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 74 transitions. [2019-11-24 00:35:34,935 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 74 transitions. Word has length 11 [2019-11-24 00:35:34,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 00:35:34,936 INFO L462 AbstractCegarLoop]: Abstraction has 69 states and 74 transitions. [2019-11-24 00:35:34,936 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 00:35:34,936 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 74 transitions. [2019-11-24 00:35:34,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-24 00:35:34,937 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 00:35:34,937 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 00:35:34,937 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:34,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 00:35:34,938 INFO L82 PathProgramCache]: Analyzing trace with hash 2084416662, now seen corresponding path program 1 times [2019-11-24 00:35:34,938 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 00:35:34,938 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135455682] [2019-11-24 00:35:34,938 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 00:35:34,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 00:35:34,986 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:34,987 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135455682] [2019-11-24 00:35:34,988 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 00:35:34,988 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 00:35:34,988 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841933860] [2019-11-24 00:35:34,989 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 00:35:34,989 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 00:35:34,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 00:35:34,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 00:35:34,990 INFO L87 Difference]: Start difference. First operand 69 states and 74 transitions. Second operand 4 states. [2019-11-24 00:35:35,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 00:35:35,081 INFO L93 Difference]: Finished difference Result 78 states and 83 transitions. [2019-11-24 00:35:35,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 00:35:35,082 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-11-24 00:35:35,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 00:35:35,083 INFO L225 Difference]: With dead ends: 78 [2019-11-24 00:35:35,083 INFO L226 Difference]: Without dead ends: 64 [2019-11-24 00:35:35,085 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:35,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-11-24 00:35:35,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-11-24 00:35:35,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-11-24 00:35:35,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 68 transitions. [2019-11-24 00:35:35,093 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 68 transitions. Word has length 14 [2019-11-24 00:35:35,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 00:35:35,094 INFO L462 AbstractCegarLoop]: Abstraction has 64 states and 68 transitions. [2019-11-24 00:35:35,094 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 00:35:35,094 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2019-11-24 00:35:35,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-24 00:35:35,097 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 00:35:35,097 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:35,099 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:35,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 00:35:35,100 INFO L82 PathProgramCache]: Analyzing trace with hash 257003891, now seen corresponding path program 1 times [2019-11-24 00:35:35,100 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 00:35:35,100 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644931795] [2019-11-24 00:35:35,100 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 00:35:35,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 00:35:35,339 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:35,340 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644931795] [2019-11-24 00:35:35,340 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [759993960] [2019-11-24 00:35:35,341 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:35,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 00:35:35,404 INFO L255 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-24 00:35:35,409 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-24 00:35:35,493 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 00:35:35,494 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:35,495 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-24 00:35:35,526 INFO L567 ElimStorePlain]: treesize reduction 10, result has 70.6 percent of original size [2019-11-24 00:35:35,528 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-24 00:35:35,528 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:24 [2019-11-24 00:35:35,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:35:35,618 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 00:35:35,619 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:35,620 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-24 00:35:35,634 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:35,635 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-24 00:35:35,715 INFO L567 ElimStorePlain]: treesize reduction 89, result has 48.9 percent of original size [2019-11-24 00:35:35,726 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-24 00:35:35,736 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 00:35:35,755 INFO L343 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-11-24 00:35:35,756 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:35,756 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-24 00:35:35,766 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 00:35:35,766 INFO L464 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.offset_41| vanished before elimination [2019-11-24 00:35:35,767 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:35,767 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:191, output treesize:28 [2019-11-24 00:35:35,848 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 00:35:35,848 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:35,849 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-24 00:35:35,862 INFO L567 ElimStorePlain]: treesize reduction 12, result has 42.9 percent of original size [2019-11-24 00:35:35,863 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:35,864 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:4 [2019-11-24 00:35:35,870 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:35,871 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-24 00:35:35,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:35:35,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:35:35,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:35:35,943 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:35,958 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-24 00:35:37,251 WARN L192 SmtUtils]: Spent 1.29 s on a formula simplification. DAG size of input: 138 DAG size of output: 138 [2019-11-24 00:35:37,253 INFO L567 ElimStorePlain]: treesize reduction 9, result has 97.2 percent of original size [2019-11-24 00:35:37,292 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-24 00:35:37,365 INFO L343 Elim1Store]: treesize reduction 49, result has 43.7 percent of original size [2019-11-24 00:35:37,365 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:37,366 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-24 00:35:38,061 WARN L192 SmtUtils]: Spent 694.00 ms on a formula simplification that was a NOOP. DAG size: 143 [2019-11-24 00:35:38,061 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 00:35:38,076 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-24 00:35:38,131 INFO L343 Elim1Store]: treesize reduction 49, result has 43.7 percent of original size [2019-11-24 00:35:38,132 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:38,133 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-24 00:35:38,479 WARN L192 SmtUtils]: Spent 345.00 ms on a formula simplification that was a NOOP. DAG size: 140 [2019-11-24 00:35:38,480 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 00:35:38,512 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-24 00:35:38,557 INFO L343 Elim1Store]: treesize reduction 49, result has 43.7 percent of original size [2019-11-24 00:35:38,558 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:38,559 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-24 00:35:38,855 WARN L192 SmtUtils]: Spent 295.00 ms on a formula simplification that was a NOOP. DAG size: 145 [2019-11-24 00:35:38,856 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 00:35:38,867 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-24 00:35:38,939 INFO L343 Elim1Store]: treesize reduction 49, result has 43.7 percent of original size [2019-11-24 00:35:38,940 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:38,941 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-24 00:35:39,112 WARN L192 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 142 [2019-11-24 00:35:39,113 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 00:35:39,144 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 00:35:39,145 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:39,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:35:39,146 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-24 00:35:39,459 WARN L192 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 131 [2019-11-24 00:35:39,460 INFO L567 ElimStorePlain]: treesize reduction 31, result has 89.6 percent of original size [2019-11-24 00:35:39,538 INFO L343 Elim1Store]: treesize reduction 76, result has 33.3 percent of original size [2019-11-24 00:35:39,539 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:39,540 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-24 00:35:39,708 WARN L192 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 136 [2019-11-24 00:35:39,709 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 00:35:39,723 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 00:35:39,724 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:39,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:35:39,725 INFO L496 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-11-24 00:35:39,956 WARN L192 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 125 [2019-11-24 00:35:39,957 INFO L567 ElimStorePlain]: treesize reduction 31, result has 88.1 percent of original size [2019-11-24 00:35:39,957 INFO L464 ElimStorePlain]: Eliminatee v_prenex_7 vanished before elimination [2019-11-24 00:35:39,975 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:39,977 INFO L496 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-11-24 00:35:40,382 WARN L192 SmtUtils]: Spent 404.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 123 [2019-11-24 00:35:40,383 INFO L567 ElimStorePlain]: treesize reduction 94, result has 69.4 percent of original size [2019-11-24 00:35:40,429 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 00:35:40,429 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:40,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:35:40,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:35:40,432 INFO L496 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-11-24 00:35:40,690 WARN L192 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 110 [2019-11-24 00:35:40,691 INFO L567 ElimStorePlain]: treesize reduction 17, result has 92.0 percent of original size [2019-11-24 00:35:40,728 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 00:35:40,729 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:40,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:35:40,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:35:40,732 INFO L496 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-11-24 00:35:40,988 WARN L192 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 97 [2019-11-24 00:35:40,989 INFO L567 ElimStorePlain]: treesize reduction 17, result has 91.2 percent of original size [2019-11-24 00:35:41,019 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 00:35:41,020 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:41,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:35:41,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:35:41,022 INFO L496 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-11-24 00:35:41,241 WARN L192 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 84 [2019-11-24 00:35:41,242 INFO L567 ElimStorePlain]: treesize reduction 17, result has 90.3 percent of original size [2019-11-24 00:35:41,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-24 00:35:41,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:35:41,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-24 00:35:41,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-24 00:35:41,250 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:41,250 INFO L221 ElimStorePlain]: Needed 13 recursive calls to eliminate 24 variables, input treesize:361, output treesize:174 [2019-11-24 00:35:41,340 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:41,340 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1656301972] [2019-11-24 00:35:41,364 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2019-11-24 00:35:41,365 INFO L166 IcfgInterpreter]: Building call graph [2019-11-24 00:35:41,370 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-11-24 00:35:41,377 INFO L176 IcfgInterpreter]: Starting interpretation [2019-11-24 00:35:41,377 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-11-24 00:35:41,779 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-24 00:35:42,462 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-24 00:35:44,542 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-24 00:35:46,346 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-24 00:35:46,361 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-24 00:35:46,375 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-24 00:35:53,294 WARN L192 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 84 [2019-11-24 00:35:55,336 WARN L192 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 61 [2019-11-24 00:35:56,091 WARN L192 SmtUtils]: Spent 539.00 ms on a formula simplification. DAG size of input: 1026 DAG size of output: 894