/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/ldv-sets/test_mutex_double_unlock.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-24 03:57:10,148 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-24 03:57:10,150 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-24 03:57:10,168 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-24 03:57:10,169 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-24 03:57:10,171 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-24 03:57:10,173 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-24 03:57:10,182 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-24 03:57:10,186 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-24 03:57:10,188 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-24 03:57:10,190 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-24 03:57:10,192 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-24 03:57:10,193 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-24 03:57:10,194 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-24 03:57:10,196 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-24 03:57:10,198 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-24 03:57:10,199 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-24 03:57:10,201 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-24 03:57:10,202 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-24 03:57:10,206 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-24 03:57:10,210 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-24 03:57:10,214 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-24 03:57:10,215 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-24 03:57:10,216 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-24 03:57:10,218 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-24 03:57:10,218 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-24 03:57:10,219 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-24 03:57:10,220 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-24 03:57:10,221 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-24 03:57:10,222 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-24 03:57:10,222 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-24 03:57:10,224 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-24 03:57:10,225 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-24 03:57:10,225 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-24 03:57:10,227 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-24 03:57:10,227 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-24 03:57:10,227 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-24 03:57:10,228 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-24 03:57:10,228 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-24 03:57:10,229 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-24 03:57:10,230 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-24 03:57:10,231 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 03:57:10,266 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-24 03:57:10,266 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-24 03:57:10,267 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-24 03:57:10,267 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-24 03:57:10,268 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-24 03:57:10,268 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-24 03:57:10,268 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-24 03:57:10,268 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-24 03:57:10,268 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-24 03:57:10,269 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-24 03:57:10,269 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-24 03:57:10,269 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-24 03:57:10,269 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-24 03:57:10,269 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-24 03:57:10,270 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-24 03:57:10,270 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-24 03:57:10,270 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-24 03:57:10,271 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-24 03:57:10,272 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-24 03:57:10,272 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-24 03:57:10,272 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-24 03:57:10,272 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-24 03:57:10,272 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-24 03:57:10,273 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-24 03:57:10,273 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-24 03:57:10,273 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-24 03:57:10,273 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-24 03:57:10,273 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-24 03:57:10,274 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-24 03:57:10,275 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-24 03:57:10,275 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-24 03:57:10,275 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-24 03:57:10,275 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-24 03:57:10,276 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-24 03:57:10,276 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-24 03:57:10,276 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-24 03:57:10,276 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-24 03:57:10,276 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-11-24 03:57:10,551 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-24 03:57:10,564 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-24 03:57:10,568 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-24 03:57:10,570 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-24 03:57:10,570 INFO L275 PluginConnector]: CDTParser initialized [2019-11-24 03:57:10,571 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-sets/test_mutex_double_unlock.i [2019-11-24 03:57:10,647 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a129de452/95488422b19b4fe4b946051add51a851/FLAG8e9b2c68c [2019-11-24 03:57:11,204 INFO L306 CDTParser]: Found 1 translation units. [2019-11-24 03:57:11,205 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-sets/test_mutex_double_unlock.i [2019-11-24 03:57:11,220 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a129de452/95488422b19b4fe4b946051add51a851/FLAG8e9b2c68c [2019-11-24 03:57:11,475 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a129de452/95488422b19b4fe4b946051add51a851 [2019-11-24 03:57:11,484 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-24 03:57:11,485 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-24 03:57:11,486 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-24 03:57:11,487 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-24 03:57:11,490 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-24 03:57:11,491 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 03:57:11" (1/1) ... [2019-11-24 03:57:11,494 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1cd6405c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 03:57:11, skipping insertion in model container [2019-11-24 03:57:11,495 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 03:57:11" (1/1) ... [2019-11-24 03:57:11,502 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-24 03:57:11,568 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-24 03:57:12,071 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 03:57:12,082 INFO L203 MainTranslator]: Completed pre-run [2019-11-24 03:57:12,151 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 03:57:12,211 INFO L208 MainTranslator]: Completed translation [2019-11-24 03:57:12,212 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 03:57:12 WrapperNode [2019-11-24 03:57:12,212 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-24 03:57:12,213 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-24 03:57:12,213 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-24 03:57:12,213 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-24 03:57:12,221 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 03:57:12" (1/1) ... [2019-11-24 03:57:12,240 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 03:57:12" (1/1) ... [2019-11-24 03:57:12,284 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-24 03:57:12,284 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-24 03:57:12,284 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-24 03:57:12,284 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-24 03:57:12,297 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 03:57:12" (1/1) ... [2019-11-24 03:57:12,297 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 03:57:12" (1/1) ... [2019-11-24 03:57:12,309 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 03:57:12" (1/1) ... [2019-11-24 03:57:12,310 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 03:57:12" (1/1) ... [2019-11-24 03:57:12,332 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 03:57:12" (1/1) ... [2019-11-24 03:57:12,339 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 03:57:12" (1/1) ... [2019-11-24 03:57:12,342 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 03:57:12" (1/1) ... [2019-11-24 03:57:12,348 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-24 03:57:12,349 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-24 03:57:12,349 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-24 03:57:12,349 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-24 03:57:12,350 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 03:57:12" (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 03:57:12,405 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-24 03:57:12,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-24 03:57:12,408 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-24 03:57:12,408 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-24 03:57:12,408 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-24 03:57:12,409 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-24 03:57:12,409 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-24 03:57:12,409 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-24 03:57:13,907 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-24 03:57:13,908 INFO L284 CfgBuilder]: Removed 74 assume(true) statements. [2019-11-24 03:57:13,909 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 03:57:13 BoogieIcfgContainer [2019-11-24 03:57:13,909 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-24 03:57:13,910 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-24 03:57:13,910 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-24 03:57:13,914 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-24 03:57:13,914 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 03:57:11" (1/3) ... [2019-11-24 03:57:13,915 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69e5c1ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 03:57:13, skipping insertion in model container [2019-11-24 03:57:13,915 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 03:57:12" (2/3) ... [2019-11-24 03:57:13,916 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69e5c1ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 03:57:13, skipping insertion in model container [2019-11-24 03:57:13,916 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 03:57:13" (3/3) ... [2019-11-24 03:57:13,918 INFO L109 eAbstractionObserver]: Analyzing ICFG test_mutex_double_unlock.i [2019-11-24 03:57:13,928 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-24 03:57:13,936 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2019-11-24 03:57:13,948 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-11-24 03:57:13,974 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-24 03:57:13,974 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-24 03:57:13,974 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-24 03:57:13,974 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-24 03:57:13,975 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-24 03:57:13,975 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-24 03:57:13,975 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-24 03:57:13,975 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-24 03:57:13,992 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states. [2019-11-24 03:57:13,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-11-24 03:57:13,998 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 03:57:13,999 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-11-24 03:57:14,000 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 03:57:14,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 03:57:14,007 INFO L82 PathProgramCache]: Analyzing trace with hash 292725469, now seen corresponding path program 1 times [2019-11-24 03:57:14,017 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 03:57:14,017 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361490219] [2019-11-24 03:57:14,018 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 03:57:14,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 03:57:14,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 03:57:14,224 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361490219] [2019-11-24 03:57:14,225 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 03:57:14,225 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 03:57:14,227 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383541736] [2019-11-24 03:57:14,232 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 03:57:14,232 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 03:57:14,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 03:57:14,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 03:57:14,249 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 4 states. [2019-11-24 03:57:14,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 03:57:14,453 INFO L93 Difference]: Finished difference Result 104 states and 143 transitions. [2019-11-24 03:57:14,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 03:57:14,455 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-11-24 03:57:14,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 03:57:14,471 INFO L225 Difference]: With dead ends: 104 [2019-11-24 03:57:14,471 INFO L226 Difference]: Without dead ends: 63 [2019-11-24 03:57:14,475 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 03:57:14,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-11-24 03:57:14,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 44. [2019-11-24 03:57:14,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-11-24 03:57:14,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 57 transitions. [2019-11-24 03:57:14,526 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 57 transitions. Word has length 5 [2019-11-24 03:57:14,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 03:57:14,527 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 57 transitions. [2019-11-24 03:57:14,527 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 03:57:14,528 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 57 transitions. [2019-11-24 03:57:14,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-11-24 03:57:14,528 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 03:57:14,529 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-11-24 03:57:14,529 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 03:57:14,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 03:57:14,530 INFO L82 PathProgramCache]: Analyzing trace with hash 214586024, now seen corresponding path program 1 times [2019-11-24 03:57:14,531 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 03:57:14,531 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695608697] [2019-11-24 03:57:14,531 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 03:57:14,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 03:57:14,629 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 03:57:14,630 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695608697] [2019-11-24 03:57:14,630 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 03:57:14,630 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 03:57:14,631 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052424825] [2019-11-24 03:57:14,632 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 03:57:14,633 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 03:57:14,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 03:57:14,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 03:57:14,634 INFO L87 Difference]: Start difference. First operand 44 states and 57 transitions. Second operand 3 states. [2019-11-24 03:57:14,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 03:57:14,720 INFO L93 Difference]: Finished difference Result 100 states and 126 transitions. [2019-11-24 03:57:14,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 03:57:14,721 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2019-11-24 03:57:14,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 03:57:14,722 INFO L225 Difference]: With dead ends: 100 [2019-11-24 03:57:14,722 INFO L226 Difference]: Without dead ends: 57 [2019-11-24 03:57:14,723 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 03:57:14,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-11-24 03:57:14,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 39. [2019-11-24 03:57:14,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-11-24 03:57:14,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 50 transitions. [2019-11-24 03:57:14,731 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 50 transitions. Word has length 6 [2019-11-24 03:57:14,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 03:57:14,732 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 50 transitions. [2019-11-24 03:57:14,732 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 03:57:14,732 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 50 transitions. [2019-11-24 03:57:14,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-24 03:57:14,733 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 03:57:14,733 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 03:57:14,733 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 03:57:14,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 03:57:14,734 INFO L82 PathProgramCache]: Analyzing trace with hash 38813237, now seen corresponding path program 1 times [2019-11-24 03:57:14,734 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 03:57:14,734 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319975740] [2019-11-24 03:57:14,735 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 03:57:14,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 03:57:15,120 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 03:57:15,121 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319975740] [2019-11-24 03:57:15,121 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 03:57:15,122 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-24 03:57:15,122 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465311401] [2019-11-24 03:57:15,122 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-24 03:57:15,122 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 03:57:15,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-24 03:57:15,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-24 03:57:15,124 INFO L87 Difference]: Start difference. First operand 39 states and 50 transitions. Second operand 7 states. [2019-11-24 03:57:15,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 03:57:15,457 INFO L93 Difference]: Finished difference Result 72 states and 92 transitions. [2019-11-24 03:57:15,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-24 03:57:15,459 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2019-11-24 03:57:15,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 03:57:15,460 INFO L225 Difference]: With dead ends: 72 [2019-11-24 03:57:15,460 INFO L226 Difference]: Without dead ends: 45 [2019-11-24 03:57:15,462 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-11-24 03:57:15,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-11-24 03:57:15,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 42. [2019-11-24 03:57:15,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-11-24 03:57:15,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 54 transitions. [2019-11-24 03:57:15,475 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 54 transitions. Word has length 12 [2019-11-24 03:57:15,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 03:57:15,475 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 54 transitions. [2019-11-24 03:57:15,475 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-24 03:57:15,475 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 54 transitions. [2019-11-24 03:57:15,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-24 03:57:15,481 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 03:57:15,481 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 03:57:15,482 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 03:57:15,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 03:57:15,482 INFO L82 PathProgramCache]: Analyzing trace with hash 1695117893, now seen corresponding path program 1 times [2019-11-24 03:57:15,483 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 03:57:15,483 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714334624] [2019-11-24 03:57:15,483 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 03:57:15,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 03:57:15,623 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 03:57:15,623 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714334624] [2019-11-24 03:57:15,623 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 03:57:15,624 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 03:57:15,624 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609571548] [2019-11-24 03:57:15,624 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 03:57:15,624 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 03:57:15,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 03:57:15,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-24 03:57:15,625 INFO L87 Difference]: Start difference. First operand 42 states and 54 transitions. Second operand 5 states. [2019-11-24 03:57:15,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 03:57:15,789 INFO L93 Difference]: Finished difference Result 94 states and 118 transitions. [2019-11-24 03:57:15,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 03:57:15,790 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-11-24 03:57:15,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 03:57:15,791 INFO L225 Difference]: With dead ends: 94 [2019-11-24 03:57:15,791 INFO L226 Difference]: Without dead ends: 57 [2019-11-24 03:57:15,792 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-24 03:57:15,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-11-24 03:57:15,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 40. [2019-11-24 03:57:15,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-11-24 03:57:15,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 50 transitions. [2019-11-24 03:57:15,798 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 50 transitions. Word has length 13 [2019-11-24 03:57:15,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 03:57:15,798 INFO L462 AbstractCegarLoop]: Abstraction has 40 states and 50 transitions. [2019-11-24 03:57:15,799 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 03:57:15,799 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 50 transitions. [2019-11-24 03:57:15,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-24 03:57:15,799 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 03:57:15,800 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 03:57:15,800 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 03:57:15,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 03:57:15,800 INFO L82 PathProgramCache]: Analyzing trace with hash -337523944, now seen corresponding path program 1 times [2019-11-24 03:57:15,801 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 03:57:15,801 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000929076] [2019-11-24 03:57:15,801 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 03:57:15,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 03:57:16,047 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 03:57:16,047 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000929076] [2019-11-24 03:57:16,048 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1302120816] [2019-11-24 03:57:16,048 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 03:57:16,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 03:57:16,158 INFO L255 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 55 conjunts are in the unsatisfiable core [2019-11-24 03:57:16,166 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-24 03:57:16,345 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-11-24 03:57:16,345 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-24 03:57:16,455 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2019-11-24 03:57:16,456 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 03:57:16,469 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-24 03:57:16,481 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-24 03:57:16,667 WARN L192 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 47 [2019-11-24 03:57:16,668 INFO L343 Elim1Store]: treesize reduction 93, result has 72.6 percent of original size [2019-11-24 03:57:16,670 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 474 treesize of output 483 [2019-11-24 03:57:16,673 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-24 03:57:16,887 WARN L192 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 57 [2019-11-24 03:57:16,888 INFO L567 ElimStorePlain]: treesize reduction 210, result has 58.6 percent of original size [2019-11-24 03:57:16,893 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-24 03:57:16,905 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-24 03:57:16,906 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-24 03:57:16,932 INFO L343 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2019-11-24 03:57:16,933 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 182 treesize of output 53 [2019-11-24 03:57:16,934 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-24 03:57:16,991 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 03:57:16,992 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-24 03:57:16,993 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:661, output treesize:129 [2019-11-24 03:57:17,057 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-24 03:57:17,059 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-24 03:57:17,085 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 03:57:17,086 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 132 treesize of output 125 [2019-11-24 03:57:17,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 03:57:17,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 03:57:17,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 03:57:17,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 03:57:17,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 03:57:17,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 03:57:17,103 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-24 03:57:17,155 INFO L567 ElimStorePlain]: treesize reduction 40, result has 62.3 percent of original size [2019-11-24 03:57:17,159 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-24 03:57:17,174 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 03:57:17,175 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 50 [2019-11-24 03:57:17,175 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-24 03:57:17,187 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 03:57:17,187 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-24 03:57:17,188 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:145, output treesize:15 [2019-11-24 03:57:17,211 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 03:57:17,212 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-24 03:57:17,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 03:57:17,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 03:57:17,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 03:57:17,303 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 938 treesize of output 936 [2019-11-24 03:57:17,304 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-24 03:57:17,693 WARN L192 SmtUtils]: Spent 388.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2019-11-24 03:57:17,693 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 03:57:17,775 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 938 treesize of output 936 [2019-11-24 03:57:17,776 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-24 03:57:18,016 WARN L192 SmtUtils]: Spent 238.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-11-24 03:57:18,018 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 03:57:18,024 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, End of recursive call: 6 dim-0 vars, and 4 xjuncts. [2019-11-24 03:57:18,025 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:1915, output treesize:1903 [2019-11-24 03:57:26,887 WARN L192 SmtUtils]: Spent 8.32 s on a formula simplification that was a NOOP. DAG size: 118 [2019-11-24 03:57:33,008 WARN L192 SmtUtils]: Spent 1.69 s on a formula simplification that was a NOOP. DAG size: 101 [2019-11-24 03:57:39,082 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 03:57:39,082 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1543849899] [2019-11-24 03:57:39,108 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-11-24 03:57:39,108 INFO L166 IcfgInterpreter]: Building call graph [2019-11-24 03:57:39,114 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-11-24 03:57:39,121 INFO L176 IcfgInterpreter]: Starting interpretation [2019-11-24 03:57:39,122 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-11-24 03:57:39,210 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-24 03:57:39,582 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-24 03:57:40,452 INFO L180 IcfgInterpreter]: Interpretation finished [2019-11-24 03:57:40,985 WARN L192 SmtUtils]: Spent 382.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 107 [2019-11-24 03:57:41,480 WARN L192 SmtUtils]: Spent 393.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 108 [2019-11-24 03:57:41,969 WARN L192 SmtUtils]: Spent 396.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 110 [2019-11-24 03:57:42,603 WARN L192 SmtUtils]: Spent 456.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 123 [2019-11-24 03:57:43,212 WARN L192 SmtUtils]: Spent 505.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 124 [2019-11-24 03:57:43,351 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-24 03:57:43,351 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-11-24 03:57:43,351 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 13 [2019-11-24 03:57:43,352 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390185838] [2019-11-24 03:57:43,352 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-24 03:57:43,352 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 03:57:43,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-24 03:57:43,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=349, Unknown=4, NotChecked=0, Total=462 [2019-11-24 03:57:43,353 INFO L87 Difference]: Start difference. First operand 40 states and 50 transitions. Second operand 14 states. [2019-11-24 03:57:45,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 03:57:45,111 INFO L93 Difference]: Finished difference Result 82 states and 101 transitions. [2019-11-24 03:57:45,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-24 03:57:45,112 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2019-11-24 03:57:45,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 03:57:45,113 INFO L225 Difference]: With dead ends: 82 [2019-11-24 03:57:45,113 INFO L226 Difference]: Without dead ends: 51 [2019-11-24 03:57:45,114 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 24.4s TimeCoverageRelationStatistics Valid=154, Invalid=442, Unknown=4, NotChecked=0, Total=600 [2019-11-24 03:57:45,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-11-24 03:57:45,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 35. [2019-11-24 03:57:45,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-11-24 03:57:45,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 42 transitions. [2019-11-24 03:57:45,120 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 42 transitions. Word has length 14 [2019-11-24 03:57:45,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 03:57:45,120 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 42 transitions. [2019-11-24 03:57:45,120 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-24 03:57:45,120 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 42 transitions. [2019-11-24 03:57:45,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-24 03:57:45,121 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 03:57:45,121 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 03:57:45,325 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-24 03:57:45,326 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 03:57:45,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 03:57:45,326 INFO L82 PathProgramCache]: Analyzing trace with hash 353669757, now seen corresponding path program 1 times [2019-11-24 03:57:45,326 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 03:57:45,327 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976615039] [2019-11-24 03:57:45,327 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 03:57:45,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 03:57:45,494 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-24 03:57:45,494 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976615039] [2019-11-24 03:57:45,494 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 03:57:45,495 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-24 03:57:45,495 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112567643] [2019-11-24 03:57:45,495 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-24 03:57:45,495 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 03:57:45,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-24 03:57:45,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-24 03:57:45,496 INFO L87 Difference]: Start difference. First operand 35 states and 42 transitions. Second operand 8 states. [2019-11-24 03:57:46,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 03:57:46,076 INFO L93 Difference]: Finished difference Result 152 states and 181 transitions. [2019-11-24 03:57:46,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-24 03:57:46,076 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2019-11-24 03:57:46,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 03:57:46,080 INFO L225 Difference]: With dead ends: 152 [2019-11-24 03:57:46,080 INFO L226 Difference]: Without dead ends: 135 [2019-11-24 03:57:46,081 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2019-11-24 03:57:46,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-11-24 03:57:46,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 44. [2019-11-24 03:57:46,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-11-24 03:57:46,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 55 transitions. [2019-11-24 03:57:46,094 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 55 transitions. Word has length 19 [2019-11-24 03:57:46,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 03:57:46,094 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 55 transitions. [2019-11-24 03:57:46,095 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-24 03:57:46,097 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 55 transitions. [2019-11-24 03:57:46,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-24 03:57:46,098 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 03:57:46,098 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 03:57:46,098 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 03:57:46,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 03:57:46,099 INFO L82 PathProgramCache]: Analyzing trace with hash -2062738797, now seen corresponding path program 1 times [2019-11-24 03:57:46,099 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 03:57:46,099 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321719962] [2019-11-24 03:57:46,101 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 03:57:46,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 03:57:46,191 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-24 03:57:46,191 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321719962] [2019-11-24 03:57:46,191 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 03:57:46,192 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 03:57:46,192 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992439710] [2019-11-24 03:57:46,192 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 03:57:46,192 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 03:57:46,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 03:57:46,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 03:57:46,193 INFO L87 Difference]: Start difference. First operand 44 states and 55 transitions. Second operand 4 states. [2019-11-24 03:57:46,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 03:57:46,298 INFO L93 Difference]: Finished difference Result 60 states and 72 transitions. [2019-11-24 03:57:46,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 03:57:46,299 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2019-11-24 03:57:46,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 03:57:46,300 INFO L225 Difference]: With dead ends: 60 [2019-11-24 03:57:46,300 INFO L226 Difference]: Without dead ends: 56 [2019-11-24 03:57:46,301 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 03:57:46,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-11-24 03:57:46,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 48. [2019-11-24 03:57:46,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-11-24 03:57:46,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 58 transitions. [2019-11-24 03:57:46,309 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 58 transitions. Word has length 20 [2019-11-24 03:57:46,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 03:57:46,310 INFO L462 AbstractCegarLoop]: Abstraction has 48 states and 58 transitions. [2019-11-24 03:57:46,310 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 03:57:46,310 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 58 transitions. [2019-11-24 03:57:46,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-24 03:57:46,311 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 03:57:46,311 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 03:57:46,311 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 03:57:46,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 03:57:46,312 INFO L82 PathProgramCache]: Analyzing trace with hash 1475490139, now seen corresponding path program 1 times [2019-11-24 03:57:46,312 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 03:57:46,312 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447673737] [2019-11-24 03:57:46,313 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 03:57:46,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 03:57:46,594 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-24 03:57:46,594 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447673737] [2019-11-24 03:57:46,594 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 03:57:46,594 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-24 03:57:46,595 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103321098] [2019-11-24 03:57:46,595 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-24 03:57:46,595 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 03:57:46,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-24 03:57:46,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-24 03:57:46,599 INFO L87 Difference]: Start difference. First operand 48 states and 58 transitions. Second operand 8 states. [2019-11-24 03:57:47,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 03:57:47,366 INFO L93 Difference]: Finished difference Result 101 states and 123 transitions. [2019-11-24 03:57:47,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-24 03:57:47,367 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2019-11-24 03:57:47,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 03:57:47,369 INFO L225 Difference]: With dead ends: 101 [2019-11-24 03:57:47,369 INFO L226 Difference]: Without dead ends: 70 [2019-11-24 03:57:47,370 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2019-11-24 03:57:47,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-11-24 03:57:47,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 43. [2019-11-24 03:57:47,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-11-24 03:57:47,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 51 transitions. [2019-11-24 03:57:47,378 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 51 transitions. Word has length 20 [2019-11-24 03:57:47,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 03:57:47,378 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 51 transitions. [2019-11-24 03:57:47,378 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-24 03:57:47,378 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 51 transitions. [2019-11-24 03:57:47,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-24 03:57:47,379 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 03:57:47,379 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 03:57:47,380 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 03:57:47,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 03:57:47,380 INFO L82 PathProgramCache]: Analyzing trace with hash 628116567, now seen corresponding path program 1 times [2019-11-24 03:57:47,380 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 03:57:47,380 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570411491] [2019-11-24 03:57:47,381 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 03:57:47,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 03:57:47,949 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-24 03:57:47,949 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570411491] [2019-11-24 03:57:47,949 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1182772964] [2019-11-24 03:57:47,950 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-24 03:57:48,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 03:57:48,053 INFO L255 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 92 conjunts are in the unsatisfiable core [2019-11-24 03:57:48,061 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-24 03:57:48,120 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-24 03:57:49,186 WARN L192 SmtUtils]: Spent 1.03 s on a formula simplification. DAG size of input: 135 DAG size of output: 133 [2019-11-24 03:57:49,781 WARN L192 SmtUtils]: Spent 564.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2019-11-24 03:57:50,196 WARN L192 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 46 [2019-11-24 03:57:50,985 WARN L192 SmtUtils]: Spent 785.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 138 [2019-11-24 03:57:51,246 WARN L192 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 51 [2019-11-24 03:57:51,864 WARN L192 SmtUtils]: Spent 614.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 140 [2019-11-24 03:57:52,101 WARN L192 SmtUtils]: Spent 192.00 ms on a formula simplification that was a NOOP. DAG size: 121 [2019-11-24 03:57:52,362 WARN L192 SmtUtils]: Spent 204.00 ms on a formula simplification that was a NOOP. DAG size: 126 [2019-11-24 03:57:52,616 WARN L192 SmtUtils]: Spent 188.00 ms on a formula simplification that was a NOOP. DAG size: 123 [2019-11-24 03:57:52,944 WARN L192 SmtUtils]: Spent 232.00 ms on a formula simplification that was a NOOP. DAG size: 136 [2019-11-24 03:57:53,252 WARN L192 SmtUtils]: Spent 226.00 ms on a formula simplification that was a NOOP. DAG size: 140 [2019-11-24 03:57:53,274 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-24 03:57:53,274 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-24 03:57:53,628 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-24 03:57:53,628 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-11-24 03:57:53,628 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10, 9] total 22 [2019-11-24 03:57:53,629 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15203710] [2019-11-24 03:57:53,629 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-24 03:57:53,629 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 03:57:53,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-24 03:57:53,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=391, Unknown=0, NotChecked=0, Total=462 [2019-11-24 03:57:53,635 INFO L87 Difference]: Start difference. First operand 43 states and 51 transitions. Second operand 8 states. [2019-11-24 03:57:54,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 03:57:54,050 INFO L93 Difference]: Finished difference Result 71 states and 86 transitions. [2019-11-24 03:57:54,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-24 03:57:54,056 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2019-11-24 03:57:54,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 03:57:54,057 INFO L225 Difference]: With dead ends: 71 [2019-11-24 03:57:54,057 INFO L226 Difference]: Without dead ends: 44 [2019-11-24 03:57:54,058 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 30 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=96, Invalid=504, Unknown=0, NotChecked=0, Total=600 [2019-11-24 03:57:54,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-11-24 03:57:54,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-11-24 03:57:54,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-11-24 03:57:54,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 52 transitions. [2019-11-24 03:57:54,070 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 52 transitions. Word has length 22 [2019-11-24 03:57:54,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 03:57:54,070 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 52 transitions. [2019-11-24 03:57:54,070 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-24 03:57:54,070 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2019-11-24 03:57:54,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-24 03:57:54,071 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 03:57:54,071 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 03:57:54,274 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-24 03:57:54,274 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 03:57:54,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 03:57:54,275 INFO L82 PathProgramCache]: Analyzing trace with hash -1632354524, now seen corresponding path program 1 times [2019-11-24 03:57:54,275 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 03:57:54,276 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583027035] [2019-11-24 03:57:54,276 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 03:57:54,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 03:57:54,680 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-24 03:57:54,681 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583027035] [2019-11-24 03:57:54,681 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1290750973] [2019-11-24 03:57:54,681 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-24 03:57:54,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 03:57:54,815 INFO L255 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 71 conjunts are in the unsatisfiable core [2019-11-24 03:57:54,824 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-24 03:57:54,894 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-24 03:57:56,058 WARN L192 SmtUtils]: Spent 1.16 s on a formula simplification. DAG size of input: 122 DAG size of output: 120 [2019-11-24 03:57:56,605 WARN L192 SmtUtils]: Spent 520.00 ms on a formula simplification that was a NOOP. DAG size: 117 [2019-11-24 03:57:56,985 WARN L192 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 43 [2019-11-24 03:57:57,774 WARN L192 SmtUtils]: Spent 786.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 121 [2019-11-24 03:57:57,980 WARN L192 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 48 [2019-11-24 03:57:58,454 WARN L192 SmtUtils]: Spent 471.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 121 [2019-11-24 03:57:58,662 WARN L192 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2019-11-24 03:57:58,944 WARN L192 SmtUtils]: Spent 202.00 ms on a formula simplification that was a NOOP. DAG size: 112 [2019-11-24 03:57:59,209 WARN L192 SmtUtils]: Spent 207.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-11-24 03:57:59,380 WARN L192 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2019-11-24 03:57:59,515 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-11-24 03:57:59,725 WARN L192 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 77 [2019-11-24 03:58:00,209 WARN L192 SmtUtils]: Spent 427.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-11-24 03:58:00,603 WARN L192 SmtUtils]: Spent 318.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-11-24 03:58:01,910 WARN L192 SmtUtils]: Spent 1.11 s on a formula simplification. DAG size of input: 115 DAG size of output: 109 [2019-11-24 03:58:02,479 WARN L192 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 68 [2019-11-24 03:58:03,729 WARN L192 SmtUtils]: Spent 559.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 81 [2019-11-24 03:58:03,981 WARN L192 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 54 [2019-11-24 03:58:04,402 WARN L192 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-11-24 03:58:04,610 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2019-11-24 03:58:05,243 WARN L192 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 30 [2019-11-24 03:58:05,303 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-24 03:58:05,304 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-24 03:58:06,704 WARN L192 SmtUtils]: Spent 771.00 ms on a formula simplification that was a NOOP. DAG size: 158 [2019-11-24 03:58:07,277 WARN L192 SmtUtils]: Spent 513.00 ms on a formula simplification that was a NOOP. DAG size: 150 [2019-11-24 03:58:07,649 WARN L192 SmtUtils]: Spent 340.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 94 [2019-11-24 03:58:08,473 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-24 03:58:08,474 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: This case should habe been handled by DER at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:212) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:192) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.(DerPreprocessor.java:95) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:291) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:253) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:256) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:256) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:246) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:440) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:419) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:291) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:334) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:177) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:297) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:180) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:333) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:171) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-11-24 03:58:08,480 INFO L168 Benchmark]: Toolchain (without parser) took 56994.74 ms. Allocated memory was 138.4 MB in the beginning and 452.5 MB in the end (delta: 314.0 MB). Free memory was 101.5 MB in the beginning and 302.1 MB in the end (delta: -200.6 MB). Peak memory consumption was 333.7 MB. Max. memory is 7.1 GB. [2019-11-24 03:58:08,480 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 138.4 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-11-24 03:58:08,481 INFO L168 Benchmark]: CACSL2BoogieTranslator took 725.85 ms. Allocated memory was 138.4 MB in the beginning and 202.4 MB in the end (delta: 64.0 MB). Free memory was 101.1 MB in the beginning and 162.6 MB in the end (delta: -61.5 MB). Peak memory consumption was 24.3 MB. Max. memory is 7.1 GB. [2019-11-24 03:58:08,481 INFO L168 Benchmark]: Boogie Procedure Inliner took 71.28 ms. Allocated memory is still 202.4 MB. Free memory was 162.6 MB in the beginning and 159.3 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. [2019-11-24 03:58:08,484 INFO L168 Benchmark]: Boogie Preprocessor took 64.32 ms. Allocated memory is still 202.4 MB. Free memory was 159.3 MB in the beginning and 155.9 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. [2019-11-24 03:58:08,485 INFO L168 Benchmark]: RCFGBuilder took 1560.54 ms. Allocated memory was 202.4 MB in the beginning and 235.4 MB in the end (delta: 33.0 MB). Free memory was 155.9 MB in the beginning and 139.8 MB in the end (delta: 16.2 MB). Peak memory consumption was 74.3 MB. Max. memory is 7.1 GB. [2019-11-24 03:58:08,486 INFO L168 Benchmark]: TraceAbstraction took 54568.43 ms. Allocated memory was 235.4 MB in the beginning and 452.5 MB in the end (delta: 217.1 MB). Free memory was 138.4 MB in the beginning and 302.1 MB in the end (delta: -163.8 MB). Peak memory consumption was 273.6 MB. Max. memory is 7.1 GB. [2019-11-24 03:58:08,490 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28 ms. Allocated memory is still 138.4 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 725.85 ms. Allocated memory was 138.4 MB in the beginning and 202.4 MB in the end (delta: 64.0 MB). Free memory was 101.1 MB in the beginning and 162.6 MB in the end (delta: -61.5 MB). Peak memory consumption was 24.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 71.28 ms. Allocated memory is still 202.4 MB. Free memory was 162.6 MB in the beginning and 159.3 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 64.32 ms. Allocated memory is still 202.4 MB. Free memory was 159.3 MB in the beginning and 155.9 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1560.54 ms. Allocated memory was 202.4 MB in the beginning and 235.4 MB in the end (delta: 33.0 MB). Free memory was 155.9 MB in the beginning and 139.8 MB in the end (delta: 16.2 MB). Peak memory consumption was 74.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 54568.43 ms. Allocated memory was 235.4 MB in the beginning and 452.5 MB in the end (delta: 217.1 MB). Free memory was 138.4 MB in the beginning and 302.1 MB in the end (delta: -163.8 MB). Peak memory consumption was 273.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: This case should habe been handled by DER de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: This case should habe been handled by DER: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:212) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...