/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/bench/exp2x6.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.1-2abb09bbbae98a04ae2fcc735832bfdba44f6fbc-2abb09b [2021-06-05 21:40:33,669 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-06-05 21:40:33,670 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-06-05 21:40:33,692 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-06-05 21:40:33,692 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-06-05 21:40:33,696 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-06-05 21:40:33,698 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-06-05 21:40:33,704 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-06-05 21:40:33,706 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-06-05 21:40:33,708 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-06-05 21:40:33,708 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-06-05 21:40:33,709 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-06-05 21:40:33,709 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-06-05 21:40:33,710 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-06-05 21:40:33,710 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-06-05 21:40:33,711 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-06-05 21:40:33,711 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-06-05 21:40:33,712 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-06-05 21:40:33,713 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-06-05 21:40:33,714 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-06-05 21:40:33,714 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-06-05 21:40:33,718 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-06-05 21:40:33,719 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-06-05 21:40:33,721 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-06-05 21:40:33,727 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-06-05 21:40:33,728 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-06-05 21:40:33,728 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-06-05 21:40:33,728 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-06-05 21:40:33,728 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-06-05 21:40:33,729 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-06-05 21:40:33,729 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-06-05 21:40:33,729 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-06-05 21:40:33,730 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-06-05 21:40:33,730 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-06-05 21:40:33,731 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-06-05 21:40:33,731 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-06-05 21:40:33,731 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-06-05 21:40:33,731 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-06-05 21:40:33,732 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-06-05 21:40:33,732 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-06-05 21:40:33,732 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-06-05 21:40:33,740 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf [2021-06-05 21:40:33,760 INFO L113 SettingsManager]: Loading preferences was successful [2021-06-05 21:40:33,760 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-06-05 21:40:33,760 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-06-05 21:40:33,760 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-06-05 21:40:33,761 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-06-05 21:40:33,761 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-06-05 21:40:33,761 INFO L138 SettingsManager]: * Use SBE=true [2021-06-05 21:40:33,761 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-06-05 21:40:33,762 INFO L138 SettingsManager]: * sizeof long=4 [2021-06-05 21:40:33,762 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-06-05 21:40:33,762 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-06-05 21:40:33,762 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-06-05 21:40:33,762 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-06-05 21:40:33,762 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-06-05 21:40:33,762 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-06-05 21:40:33,762 INFO L138 SettingsManager]: * sizeof long double=12 [2021-06-05 21:40:33,762 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-06-05 21:40:33,762 INFO L138 SettingsManager]: * Use constant arrays=true [2021-06-05 21:40:33,762 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-06-05 21:40:33,763 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-06-05 21:40:33,763 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-06-05 21:40:33,763 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-06-05 21:40:33,763 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-06-05 21:40:33,763 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-05 21:40:33,763 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-06-05 21:40:33,763 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-06-05 21:40:33,763 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-06-05 21:40:33,763 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-06-05 21:40:33,763 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-06-05 21:40:33,763 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-06-05 21:40:33,763 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-06-05 21:40:33,764 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-06-05 21:40:33,957 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-06-05 21:40:33,973 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-06-05 21:40:33,975 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-06-05 21:40:33,976 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2021-06-05 21:40:33,977 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2021-06-05 21:40:33,978 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/bench/exp2x6.wvr.bpl [2021-06-05 21:40:33,978 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/bench/exp2x6.wvr.bpl' [2021-06-05 21:40:34,016 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-06-05 21:40:34,017 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2021-06-05 21:40:34,018 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-06-05 21:40:34,018 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-06-05 21:40:34,018 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-06-05 21:40:34,026 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "exp2x6.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.06 09:40:34" (1/1) ... [2021-06-05 21:40:34,030 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "exp2x6.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.06 09:40:34" (1/1) ... [2021-06-05 21:40:34,034 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-06-05 21:40:34,036 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-06-05 21:40:34,036 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-06-05 21:40:34,037 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-06-05 21:40:34,041 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "exp2x6.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.06 09:40:34" (1/1) ... [2021-06-05 21:40:34,041 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "exp2x6.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.06 09:40:34" (1/1) ... [2021-06-05 21:40:34,043 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "exp2x6.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.06 09:40:34" (1/1) ... [2021-06-05 21:40:34,043 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "exp2x6.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.06 09:40:34" (1/1) ... [2021-06-05 21:40:34,046 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "exp2x6.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.06 09:40:34" (1/1) ... [2021-06-05 21:40:34,048 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "exp2x6.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.06 09:40:34" (1/1) ... [2021-06-05 21:40:34,049 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "exp2x6.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.06 09:40:34" (1/1) ... [2021-06-05 21:40:34,049 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-06-05 21:40:34,050 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-06-05 21:40:34,050 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-06-05 21:40:34,050 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-06-05 21:40:34,051 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "exp2x6.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.06 09:40:34" (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 [2021-06-05 21:40:34,101 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2021-06-05 21:40:34,101 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2021-06-05 21:40:34,101 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2021-06-05 21:40:34,101 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2021-06-05 21:40:34,101 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2021-06-05 21:40:34,101 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2021-06-05 21:40:34,101 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2021-06-05 21:40:34,101 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-06-05 21:40:34,101 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-06-05 21:40:34,102 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2021-06-05 21:40:34,102 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2021-06-05 21:40:34,102 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2021-06-05 21:40:34,102 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread4 given in one single declaration [2021-06-05 21:40:34,102 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2021-06-05 21:40:34,102 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2021-06-05 21:40:34,103 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-06-05 21:40:34,228 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-06-05 21:40:34,228 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2021-06-05 21:40:34,229 INFO L202 PluginConnector]: Adding new model exp2x6.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.06 09:40:34 BoogieIcfgContainer [2021-06-05 21:40:34,229 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-06-05 21:40:34,232 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-06-05 21:40:34,233 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-06-05 21:40:34,234 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-06-05 21:40:34,234 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "exp2x6.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.06 09:40:34" (1/2) ... [2021-06-05 21:40:34,235 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18f32564 and model type exp2x6.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.06 09:40:34, skipping insertion in model container [2021-06-05 21:40:34,235 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "exp2x6.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.06 09:40:34" (2/2) ... [2021-06-05 21:40:34,236 INFO L111 eAbstractionObserver]: Analyzing ICFG exp2x6.wvr.bpl [2021-06-05 21:40:34,239 WARN L148 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-06-05 21:40:34,240 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-06-05 21:40:34,240 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-06-05 21:40:34,240 INFO L471 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-06-05 21:40:34,271 INFO L149 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2021-06-05 21:40:34,291 INFO L255 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-06-05 21:40:34,320 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-05 21:40:34,320 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-05 21:40:34,320 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-05 21:40:34,321 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-05 21:40:34,321 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-05 21:40:34,321 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-05 21:40:34,321 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-05 21:40:34,321 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.start======== [2021-06-05 21:40:34,327 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 54 places, 45 transitions, 122 flow [2021-06-05 21:40:34,507 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 3206 states, 3204 states have (on average 3.956616729088639) internal successors, (12677), 3205 states have internal predecessors, (12677), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:40:34,518 INFO L276 IsEmpty]: Start isEmpty. Operand has 3206 states, 3204 states have (on average 3.956616729088639) internal successors, (12677), 3205 states have internal predecessors, (12677), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:40:34,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 21:40:34,545 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:40:34,546 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:40:34,546 INFO L430 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:40:34,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:40:34,552 INFO L82 PathProgramCache]: Analyzing trace with hash -176416249, now seen corresponding path program 1 times [2021-06-05 21:40:34,558 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:40:34,558 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272096443] [2021-06-05 21:40:34,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:40:34,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:40:34,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:40:34,699 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:40:34,699 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272096443] [2021-06-05 21:40:34,700 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272096443] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 21:40:34,700 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 21:40:34,700 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-05 21:40:34,701 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414501294] [2021-06-05 21:40:34,703 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-05 21:40:34,703 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:40:34,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-05 21:40:34,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 21:40:34,720 INFO L87 Difference]: Start difference. First operand has 3206 states, 3204 states have (on average 3.956616729088639) internal successors, (12677), 3205 states have internal predecessors, (12677), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:40:34,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:40:34,837 INFO L93 Difference]: Finished difference Result 3629 states and 14324 transitions. [2021-06-05 21:40:34,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-05 21:40:34,838 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 21:40:34,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:40:34,878 INFO L225 Difference]: With dead ends: 3629 [2021-06-05 21:40:34,878 INFO L226 Difference]: Without dead ends: 3598 [2021-06-05 21:40:34,879 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 21:40:34,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3598 states. [2021-06-05 21:40:35,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3598 to 3333. [2021-06-05 21:40:35,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3333 states, 3332 states have (on average 3.952280912364946) internal successors, (13169), 3332 states have internal predecessors, (13169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:40:35,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3333 states to 3333 states and 13169 transitions. [2021-06-05 21:40:35,088 INFO L78 Accepts]: Start accepts. Automaton has 3333 states and 13169 transitions. Word has length 19 [2021-06-05 21:40:35,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:40:35,091 INFO L482 AbstractCegarLoop]: Abstraction has 3333 states and 13169 transitions. [2021-06-05 21:40:35,091 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:40:35,091 INFO L276 IsEmpty]: Start isEmpty. Operand 3333 states and 13169 transitions. [2021-06-05 21:40:35,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-06-05 21:40:35,102 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:40:35,103 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:40:35,103 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-06-05 21:40:35,103 INFO L430 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:40:35,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:40:35,106 INFO L82 PathProgramCache]: Analyzing trace with hash -1596364547, now seen corresponding path program 1 times [2021-06-05 21:40:35,106 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:40:35,107 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837368244] [2021-06-05 21:40:35,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:40:35,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:40:35,170 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:40:35,171 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:40:35,171 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837368244] [2021-06-05 21:40:35,171 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837368244] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:40:35,171 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1500535353] [2021-06-05 21:40:35,171 INFO L95 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 [2021-06-05 21:40:35,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:40:35,228 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 3 conjunts are in the unsatisfiable core [2021-06-05 21:40:35,233 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:40:35,324 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:40:35,325 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1500535353] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:40:35,325 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:40:35,325 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2021-06-05 21:40:35,326 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627304051] [2021-06-05 21:40:35,326 INFO L462 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-05 21:40:35,326 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:40:35,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-05 21:40:35,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-05 21:40:35,333 INFO L87 Difference]: Start difference. First operand 3333 states and 13169 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:40:35,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:40:35,442 INFO L93 Difference]: Finished difference Result 6091 states and 23571 transitions. [2021-06-05 21:40:35,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-05 21:40:35,442 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-06-05 21:40:35,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:40:35,474 INFO L225 Difference]: With dead ends: 6091 [2021-06-05 21:40:35,475 INFO L226 Difference]: Without dead ends: 6091 [2021-06-05 21:40:35,476 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.2ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-06-05 21:40:35,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6091 states. [2021-06-05 21:40:35,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6091 to 3780. [2021-06-05 21:40:35,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3780 states, 3779 states have (on average 3.988885948663668) internal successors, (15074), 3779 states have internal predecessors, (15074), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:40:35,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3780 states to 3780 states and 15074 transitions. [2021-06-05 21:40:35,734 INFO L78 Accepts]: Start accepts. Automaton has 3780 states and 15074 transitions. Word has length 24 [2021-06-05 21:40:35,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:40:35,734 INFO L482 AbstractCegarLoop]: Abstraction has 3780 states and 15074 transitions. [2021-06-05 21:40:35,735 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:40:35,735 INFO L276 IsEmpty]: Start isEmpty. Operand 3780 states and 15074 transitions. [2021-06-05 21:40:35,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-06-05 21:40:35,744 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:40:35,744 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:40:35,952 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2021-06-05 21:40:35,953 INFO L430 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:40:35,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:40:35,954 INFO L82 PathProgramCache]: Analyzing trace with hash 787684274, now seen corresponding path program 1 times [2021-06-05 21:40:35,954 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:40:35,954 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169131321] [2021-06-05 21:40:35,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:40:35,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:40:35,975 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:40:35,975 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:40:35,975 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169131321] [2021-06-05 21:40:35,975 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169131321] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 21:40:35,975 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 21:40:35,975 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-05 21:40:35,975 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350781799] [2021-06-05 21:40:35,976 INFO L462 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-05 21:40:35,976 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:40:35,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-05 21:40:35,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-05 21:40:35,976 INFO L87 Difference]: Start difference. First operand 3780 states and 15074 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:40:36,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:40:36,070 INFO L93 Difference]: Finished difference Result 4891 states and 19118 transitions. [2021-06-05 21:40:36,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-05 21:40:36,071 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-06-05 21:40:36,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:40:36,094 INFO L225 Difference]: With dead ends: 4891 [2021-06-05 21:40:36,094 INFO L226 Difference]: Without dead ends: 4883 [2021-06-05 21:40:36,095 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.7ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-06-05 21:40:36,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4883 states. [2021-06-05 21:40:36,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4883 to 3892. [2021-06-05 21:40:36,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3892 states, 3891 states have (on average 3.9671035723464403) internal successors, (15436), 3891 states have internal predecessors, (15436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:40:36,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3892 states to 3892 states and 15436 transitions. [2021-06-05 21:40:36,250 INFO L78 Accepts]: Start accepts. Automaton has 3892 states and 15436 transitions. Word has length 24 [2021-06-05 21:40:36,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:40:36,250 INFO L482 AbstractCegarLoop]: Abstraction has 3892 states and 15436 transitions. [2021-06-05 21:40:36,250 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:40:36,250 INFO L276 IsEmpty]: Start isEmpty. Operand 3892 states and 15436 transitions. [2021-06-05 21:40:36,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-06-05 21:40:36,258 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:40:36,258 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:40:36,258 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-06-05 21:40:36,258 INFO L430 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:40:36,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:40:36,259 INFO L82 PathProgramCache]: Analyzing trace with hash 1247895235, now seen corresponding path program 1 times [2021-06-05 21:40:36,260 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:40:36,260 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902873441] [2021-06-05 21:40:36,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:40:36,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:40:36,333 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:40:36,334 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:40:36,334 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902873441] [2021-06-05 21:40:36,334 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902873441] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:40:36,334 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [292151440] [2021-06-05 21:40:36,334 INFO L95 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 [2021-06-05 21:40:36,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:40:36,368 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 3 conjunts are in the unsatisfiable core [2021-06-05 21:40:36,369 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:40:36,449 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:40:36,450 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [292151440] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:40:36,450 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:40:36,450 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2021-06-05 21:40:36,450 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688389951] [2021-06-05 21:40:36,451 INFO L462 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-05 21:40:36,451 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:40:36,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-05 21:40:36,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-05 21:40:36,451 INFO L87 Difference]: Start difference. First operand 3892 states and 15436 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:40:36,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:40:36,529 INFO L93 Difference]: Finished difference Result 6588 states and 25636 transitions. [2021-06-05 21:40:36,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-05 21:40:36,530 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-06-05 21:40:36,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:40:36,552 INFO L225 Difference]: With dead ends: 6588 [2021-06-05 21:40:36,552 INFO L226 Difference]: Without dead ends: 6588 [2021-06-05 21:40:36,552 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.5ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-06-05 21:40:36,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6588 states. [2021-06-05 21:40:36,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6588 to 4463. [2021-06-05 21:40:36,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4463 states, 4462 states have (on average 4.017480950246526) internal successors, (17926), 4462 states have internal predecessors, (17926), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:40:36,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4463 states to 4463 states and 17926 transitions. [2021-06-05 21:40:36,700 INFO L78 Accepts]: Start accepts. Automaton has 4463 states and 17926 transitions. Word has length 24 [2021-06-05 21:40:36,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:40:36,700 INFO L482 AbstractCegarLoop]: Abstraction has 4463 states and 17926 transitions. [2021-06-05 21:40:36,700 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:40:36,700 INFO L276 IsEmpty]: Start isEmpty. Operand 4463 states and 17926 transitions. [2021-06-05 21:40:36,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-06-05 21:40:36,711 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:40:36,711 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:40:36,924 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:40:36,925 INFO L430 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:40:36,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:40:36,925 INFO L82 PathProgramCache]: Analyzing trace with hash 4371448, now seen corresponding path program 1 times [2021-06-05 21:40:36,925 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:40:36,926 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197332434] [2021-06-05 21:40:36,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:40:36,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:40:36,957 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:40:36,957 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:40:36,957 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197332434] [2021-06-05 21:40:36,957 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197332434] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 21:40:36,957 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 21:40:36,957 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-05 21:40:36,958 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998055601] [2021-06-05 21:40:36,958 INFO L462 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-05 21:40:36,959 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:40:36,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-05 21:40:36,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-05 21:40:36,960 INFO L87 Difference]: Start difference. First operand 4463 states and 17926 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:40:37,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:40:37,029 INFO L93 Difference]: Finished difference Result 5640 states and 22182 transitions. [2021-06-05 21:40:37,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-05 21:40:37,029 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-06-05 21:40:37,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:40:37,046 INFO L225 Difference]: With dead ends: 5640 [2021-06-05 21:40:37,046 INFO L226 Difference]: Without dead ends: 5622 [2021-06-05 21:40:37,047 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.3ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-06-05 21:40:37,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5622 states. [2021-06-05 21:40:37,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5622 to 4591. [2021-06-05 21:40:37,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4591 states, 4590 states have (on average 3.9971677559912853) internal successors, (18347), 4590 states have internal predecessors, (18347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:40:37,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4591 states to 4591 states and 18347 transitions. [2021-06-05 21:40:37,195 INFO L78 Accepts]: Start accepts. Automaton has 4591 states and 18347 transitions. Word has length 24 [2021-06-05 21:40:37,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:40:37,196 INFO L482 AbstractCegarLoop]: Abstraction has 4591 states and 18347 transitions. [2021-06-05 21:40:37,196 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:40:37,196 INFO L276 IsEmpty]: Start isEmpty. Operand 4591 states and 18347 transitions. [2021-06-05 21:40:37,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-06-05 21:40:37,206 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:40:37,206 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:40:37,206 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-06-05 21:40:37,206 INFO L430 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:40:37,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:40:37,207 INFO L82 PathProgramCache]: Analyzing trace with hash 979513020, now seen corresponding path program 2 times [2021-06-05 21:40:37,207 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:40:37,207 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535150461] [2021-06-05 21:40:37,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:40:37,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:40:37,241 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:40:37,241 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:40:37,242 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535150461] [2021-06-05 21:40:37,242 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535150461] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 21:40:37,242 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 21:40:37,242 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-05 21:40:37,243 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427267558] [2021-06-05 21:40:37,243 INFO L462 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-05 21:40:37,243 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:40:37,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-05 21:40:37,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-05 21:40:37,243 INFO L87 Difference]: Start difference. First operand 4591 states and 18347 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:40:37,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:40:37,311 INFO L93 Difference]: Finished difference Result 5958 states and 23476 transitions. [2021-06-05 21:40:37,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-05 21:40:37,311 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-06-05 21:40:37,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:40:37,328 INFO L225 Difference]: With dead ends: 5958 [2021-06-05 21:40:37,328 INFO L226 Difference]: Without dead ends: 5958 [2021-06-05 21:40:37,328 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.2ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-06-05 21:40:37,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5958 states. [2021-06-05 21:40:37,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5958 to 5142. [2021-06-05 21:40:37,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5142 states, 5141 states have (on average 3.9941645594242363) internal successors, (20534), 5141 states have internal predecessors, (20534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:40:37,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5142 states to 5142 states and 20534 transitions. [2021-06-05 21:40:37,498 INFO L78 Accepts]: Start accepts. Automaton has 5142 states and 20534 transitions. Word has length 24 [2021-06-05 21:40:37,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:40:37,498 INFO L482 AbstractCegarLoop]: Abstraction has 5142 states and 20534 transitions. [2021-06-05 21:40:37,498 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:40:37,498 INFO L276 IsEmpty]: Start isEmpty. Operand 5142 states and 20534 transitions. [2021-06-05 21:40:37,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-06-05 21:40:37,509 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:40:37,509 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:40:37,509 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-06-05 21:40:37,509 INFO L430 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:40:37,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:40:37,510 INFO L82 PathProgramCache]: Analyzing trace with hash -1301374515, now seen corresponding path program 2 times [2021-06-05 21:40:37,510 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:40:37,510 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96664392] [2021-06-05 21:40:37,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:40:37,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:40:37,532 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:40:37,532 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:40:37,532 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96664392] [2021-06-05 21:40:37,532 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96664392] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 21:40:37,532 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 21:40:37,532 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-05 21:40:37,532 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715510369] [2021-06-05 21:40:37,532 INFO L462 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-05 21:40:37,533 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:40:37,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-05 21:40:37,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-05 21:40:37,533 INFO L87 Difference]: Start difference. First operand 5142 states and 20534 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:40:37,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:40:37,607 INFO L93 Difference]: Finished difference Result 5957 states and 23318 transitions. [2021-06-05 21:40:37,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-05 21:40:37,609 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-06-05 21:40:37,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:40:37,626 INFO L225 Difference]: With dead ends: 5957 [2021-06-05 21:40:37,626 INFO L226 Difference]: Without dead ends: 5926 [2021-06-05 21:40:37,626 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.8ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-06-05 21:40:37,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5926 states. [2021-06-05 21:40:37,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5926 to 5271. [2021-06-05 21:40:37,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5271 states, 5270 states have (on average 3.97438330170778) internal successors, (20945), 5270 states have internal predecessors, (20945), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:40:37,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5271 states to 5271 states and 20945 transitions. [2021-06-05 21:40:37,815 INFO L78 Accepts]: Start accepts. Automaton has 5271 states and 20945 transitions. Word has length 24 [2021-06-05 21:40:37,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:40:37,815 INFO L482 AbstractCegarLoop]: Abstraction has 5271 states and 20945 transitions. [2021-06-05 21:40:37,815 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:40:37,815 INFO L276 IsEmpty]: Start isEmpty. Operand 5271 states and 20945 transitions. [2021-06-05 21:40:37,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-06-05 21:40:37,827 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:40:37,827 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:40:37,828 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-06-05 21:40:37,828 INFO L430 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:40:37,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:40:37,828 INFO L82 PathProgramCache]: Analyzing trace with hash -1091376970, now seen corresponding path program 2 times [2021-06-05 21:40:37,828 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:40:37,828 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817618260] [2021-06-05 21:40:37,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:40:37,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:40:37,859 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:40:37,859 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:40:37,859 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817618260] [2021-06-05 21:40:37,859 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817618260] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 21:40:37,859 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 21:40:37,859 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-05 21:40:37,859 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806415746] [2021-06-05 21:40:37,859 INFO L462 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-05 21:40:37,860 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:40:37,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-05 21:40:37,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-05 21:40:37,860 INFO L87 Difference]: Start difference. First operand 5271 states and 20945 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:40:37,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:40:37,937 INFO L93 Difference]: Finished difference Result 7039 states and 27626 transitions. [2021-06-05 21:40:37,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-05 21:40:37,938 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-06-05 21:40:37,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:40:37,959 INFO L225 Difference]: With dead ends: 7039 [2021-06-05 21:40:37,960 INFO L226 Difference]: Without dead ends: 7039 [2021-06-05 21:40:37,960 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.4ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-06-05 21:40:37,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7039 states. [2021-06-05 21:40:38,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7039 to 5864. [2021-06-05 21:40:38,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5864 states, 5863 states have (on average 3.980897151628859) internal successors, (23340), 5863 states have internal predecessors, (23340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:40:38,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5864 states to 5864 states and 23340 transitions. [2021-06-05 21:40:38,172 INFO L78 Accepts]: Start accepts. Automaton has 5864 states and 23340 transitions. Word has length 24 [2021-06-05 21:40:38,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:40:38,172 INFO L482 AbstractCegarLoop]: Abstraction has 5864 states and 23340 transitions. [2021-06-05 21:40:38,172 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:40:38,173 INFO L276 IsEmpty]: Start isEmpty. Operand 5864 states and 23340 transitions. [2021-06-05 21:40:38,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-06-05 21:40:38,184 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:40:38,185 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:40:38,185 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-06-05 21:40:38,185 INFO L430 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:40:38,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:40:38,185 INFO L82 PathProgramCache]: Analyzing trace with hash 815941149, now seen corresponding path program 2 times [2021-06-05 21:40:38,186 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:40:38,186 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733698705] [2021-06-05 21:40:38,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:40:38,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:40:38,201 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:40:38,202 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:40:38,202 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733698705] [2021-06-05 21:40:38,202 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733698705] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 21:40:38,202 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 21:40:38,202 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-05 21:40:38,202 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175984774] [2021-06-05 21:40:38,202 INFO L462 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-05 21:40:38,202 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:40:38,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-05 21:40:38,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-05 21:40:38,203 INFO L87 Difference]: Start difference. First operand 5864 states and 23340 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:40:38,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:40:38,269 INFO L93 Difference]: Finished difference Result 6971 states and 27116 transitions. [2021-06-05 21:40:38,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-05 21:40:38,270 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-06-05 21:40:38,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:40:38,286 INFO L225 Difference]: With dead ends: 6971 [2021-06-05 21:40:38,286 INFO L226 Difference]: Without dead ends: 6943 [2021-06-05 21:40:38,287 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.2ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-06-05 21:40:38,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6943 states. [2021-06-05 21:40:38,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6943 to 6067. [2021-06-05 21:40:38,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6067 states, 6066 states have (on average 3.9658753709198815) internal successors, (24057), 6066 states have internal predecessors, (24057), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:40:38,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6067 states to 6067 states and 24057 transitions. [2021-06-05 21:40:38,415 INFO L78 Accepts]: Start accepts. Automaton has 6067 states and 24057 transitions. Word has length 24 [2021-06-05 21:40:38,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:40:38,416 INFO L482 AbstractCegarLoop]: Abstraction has 6067 states and 24057 transitions. [2021-06-05 21:40:38,416 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:40:38,416 INFO L276 IsEmpty]: Start isEmpty. Operand 6067 states and 24057 transitions. [2021-06-05 21:40:38,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-06-05 21:40:38,428 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:40:38,428 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:40:38,429 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-06-05 21:40:38,429 INFO L430 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:40:38,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:40:38,429 INFO L82 PathProgramCache]: Analyzing trace with hash -746670468, now seen corresponding path program 1 times [2021-06-05 21:40:38,429 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:40:38,429 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078519407] [2021-06-05 21:40:38,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:40:38,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:40:38,527 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:40:38,527 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:40:38,527 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078519407] [2021-06-05 21:40:38,527 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078519407] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:40:38,528 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [554235815] [2021-06-05 21:40:38,528 INFO L95 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 [2021-06-05 21:40:38,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:40:38,560 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 21 conjunts are in the unsatisfiable core [2021-06-05 21:40:38,561 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:40:39,009 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:40:39,009 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [554235815] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:40:39,009 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:40:39,009 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10] total 10 [2021-06-05 21:40:39,010 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946864564] [2021-06-05 21:40:39,010 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 21:40:39,010 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:40:39,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 21:40:39,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-06-05 21:40:39,011 INFO L87 Difference]: Start difference. First operand 6067 states and 24057 transitions. Second operand has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 10 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:40:39,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:40:39,582 INFO L93 Difference]: Finished difference Result 8499 states and 32997 transitions. [2021-06-05 21:40:39,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 21:40:39,583 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 10 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-06-05 21:40:39,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:40:39,602 INFO L225 Difference]: With dead ends: 8499 [2021-06-05 21:40:39,602 INFO L226 Difference]: Without dead ends: 8363 [2021-06-05 21:40:39,602 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 23 SyntacticMatches, 6 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 122.6ms TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-06-05 21:40:39,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8363 states. [2021-06-05 21:40:39,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8363 to 6744. [2021-06-05 21:40:39,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6744 states, 6743 states have (on average 3.9549162094023433) internal successors, (26668), 6743 states have internal predecessors, (26668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:40:39,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6744 states to 6744 states and 26668 transitions. [2021-06-05 21:40:39,790 INFO L78 Accepts]: Start accepts. Automaton has 6744 states and 26668 transitions. Word has length 29 [2021-06-05 21:40:39,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:40:39,791 INFO L482 AbstractCegarLoop]: Abstraction has 6744 states and 26668 transitions. [2021-06-05 21:40:39,791 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 10 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:40:39,791 INFO L276 IsEmpty]: Start isEmpty. Operand 6744 states and 26668 transitions. [2021-06-05 21:40:39,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-06-05 21:40:39,804 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:40:39,804 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:40:40,018 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-06-05 21:40:40,019 INFO L430 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:40:40,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:40:40,019 INFO L82 PathProgramCache]: Analyzing trace with hash 1040906004, now seen corresponding path program 2 times [2021-06-05 21:40:40,019 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:40:40,019 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436251554] [2021-06-05 21:40:40,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:40:40,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:40:40,085 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 21:40:40,086 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:40:40,086 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436251554] [2021-06-05 21:40:40,086 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436251554] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:40:40,086 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [104033286] [2021-06-05 21:40:40,086 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-06-05 21:40:40,125 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 21:40:40,125 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:40:40,126 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 21 conjunts are in the unsatisfiable core [2021-06-05 21:40:40,128 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:40:40,406 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 21:40:40,406 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [104033286] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:40:40,406 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 21:40:40,406 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10] total 11 [2021-06-05 21:40:40,406 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585625290] [2021-06-05 21:40:40,406 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 21:40:40,406 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 21:40:40,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 21:40:40,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2021-06-05 21:40:40,407 INFO L87 Difference]: Start difference. First operand 6744 states and 26668 transitions. Second operand has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 11 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:40:41,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 21:40:41,259 INFO L93 Difference]: Finished difference Result 10094 states and 39061 transitions. [2021-06-05 21:40:41,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 21:40:41,260 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 11 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-06-05 21:40:41,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 21:40:41,282 INFO L225 Difference]: With dead ends: 10094 [2021-06-05 21:40:41,283 INFO L226 Difference]: Without dead ends: 9890 [2021-06-05 21:40:41,283 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 23 SyntacticMatches, 5 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 158.6ms TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2021-06-05 21:40:41,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9890 states. [2021-06-05 21:40:41,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9890 to 7521. [2021-06-05 21:40:41,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7521 states, 7520 states have (on average 3.9558510638297872) internal successors, (29748), 7520 states have internal predecessors, (29748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:40:41,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7521 states to 7521 states and 29748 transitions. [2021-06-05 21:40:41,464 INFO L78 Accepts]: Start accepts. Automaton has 7521 states and 29748 transitions. Word has length 29 [2021-06-05 21:40:41,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 21:40:41,464 INFO L482 AbstractCegarLoop]: Abstraction has 7521 states and 29748 transitions. [2021-06-05 21:40:41,464 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 11 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 21:40:41,464 INFO L276 IsEmpty]: Start isEmpty. Operand 7521 states and 29748 transitions. [2021-06-05 21:40:41,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-06-05 21:40:41,480 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 21:40:41,480 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 21:40:41,696 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:40:41,697 INFO L430 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 21:40:41,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 21:40:41,697 INFO L82 PathProgramCache]: Analyzing trace with hash 984395042, now seen corresponding path program 3 times [2021-06-05 21:40:41,697 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 21:40:41,697 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772548561] [2021-06-05 21:40:41,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 21:40:41,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 21:40:41,770 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 21:40:41,770 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 21:40:41,770 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772548561] [2021-06-05 21:40:41,770 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772548561] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 21:40:41,770 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [733051237] [2021-06-05 21:40:41,770 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 21:40:41,798 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 21:40:41,799 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 21:40:41,799 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 21 conjunts are in the unsatisfiable core [2021-06-05 21:40:41,800 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 21:40:42,061 WARN L348 FreeRefinementEngine]: Global settings require throwing the following exception [2021-06-05 21:40:42,276 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2021-06-05 21:40:42,277 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: Possible infinite loop detected aux_div_aux_div_aux_mod_x1_24_53_119 already exists at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.polynomials.SolveForSubjectUtils.tryToHandleDivModSubterm(SolveForSubjectUtils.java:198) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.polynomials.SolveForSubjectUtils.findTreatableDivModSubterm(SolveForSubjectUtils.java:585) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.polynomials.SolveForSubjectUtils.findTreatableDivModSubterm(SolveForSubjectUtils.java:573) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.polynomials.SolveForSubjectUtils.solveForSubject(SolveForSubjectUtils.java:76) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.polynomials.PolynomialRelation.solveForSubject(PolynomialRelation.java:451) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.polynomials.SolveForSubjectUtils.tryToHandleDivModSubterm(SolveForSubjectUtils.java:212) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.polynomials.SolveForSubjectUtils.findTreatableDivModSubterm(SolveForSubjectUtils.java:585) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.polynomials.SolveForSubjectUtils.findTreatableDivModSubterm(SolveForSubjectUtils.java:573) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.polynomials.SolveForSubjectUtils.solveForSubject(SolveForSubjectUtils.java:76) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.polynomials.PolynomialRelation.solveForSubject(PolynomialRelation.java:451) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionDer$DerHelperMcsbr.solveForSubject(DualJunctionDer.java:408) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionDer$DerHelperMcsbr.solveForSubject(DualJunctionDer.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionDer$IDerHelper.findBestReplacementSbr(DualJunctionDer.java:312) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionDer$IDerHelper.tryToEliminateSbr(DualJunctionDer.java:328) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionDer.tryToEliminateOne(DualJunctionDer.java:231) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionDer.tryExhaustivelyToEliminate(DualJunctionDer.java:198) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionDer.tryToEliminateOne(DualJunctionDer.java:182) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionDer.tryExhaustivelyToEliminate(DualJunctionDer.java:149) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionDer.tryToEliminate(DualJunctionDer.java:127) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:869) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:835) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:753) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:384) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:316) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.convert(QuantifierPusher.java:227) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.cacheConvert(TermTransformer.java:131) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$Convert.walk(TermTransformer.java:79) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:272) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.eliminate(QuantifierPusher.java:144) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.eliminate(QuantifierPusher.java:166) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp$LiveVariablesPostprocessorForward.postprocess(TraceCheckSpWp.java:539) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:440) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:201) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:299) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) 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:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) 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:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:643) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:374) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:69) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:63) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:364) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:293) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:238) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:167) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-06-05 21:40:42,280 INFO L168 Benchmark]: Toolchain (without parser) took 8263.35 ms. Allocated memory was 360.7 MB in the beginning and 4.1 GB in the end (delta: 3.7 GB). Free memory was 340.5 MB in the beginning and 3.5 GB in the end (delta: -3.2 GB). Peak memory consumption was 522.1 MB. Max. memory is 16.0 GB. [2021-06-05 21:40:42,280 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.10 ms. Allocated memory is still 360.7 MB. Free memory was 341.7 MB in the beginning and 341.6 MB in the end (delta: 76.2 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-06-05 21:40:42,280 INFO L168 Benchmark]: Boogie Procedure Inliner took 17.05 ms. Allocated memory is still 360.7 MB. Free memory was 340.5 MB in the beginning and 339.0 MB in the end (delta: 1.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-06-05 21:40:42,280 INFO L168 Benchmark]: Boogie Preprocessor took 13.70 ms. Allocated memory is still 360.7 MB. Free memory was 339.0 MB in the beginning and 338.0 MB in the end (delta: 1.0 MB). There was no memory consumed. Max. memory is 16.0 GB. [2021-06-05 21:40:42,281 INFO L168 Benchmark]: RCFGBuilder took 179.50 ms. Allocated memory is still 360.7 MB. Free memory was 337.9 MB in the beginning and 325.2 MB in the end (delta: 12.7 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.0 GB. [2021-06-05 21:40:42,281 INFO L168 Benchmark]: TraceAbstraction took 8047.24 ms. Allocated memory was 360.7 MB in the beginning and 4.1 GB in the end (delta: 3.7 GB). Free memory was 324.8 MB in the beginning and 3.5 GB in the end (delta: -3.2 GB). Peak memory consumption was 505.4 MB. Max. memory is 16.0 GB. [2021-06-05 21:40:42,281 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.10 ms. Allocated memory is still 360.7 MB. Free memory was 341.7 MB in the beginning and 341.6 MB in the end (delta: 76.2 kB). There was no memory consumed. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 17.05 ms. Allocated memory is still 360.7 MB. Free memory was 340.5 MB in the beginning and 339.0 MB in the end (delta: 1.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 13.70 ms. Allocated memory is still 360.7 MB. Free memory was 339.0 MB in the beginning and 338.0 MB in the end (delta: 1.0 MB). There was no memory consumed. Max. memory is 16.0 GB. * RCFGBuilder took 179.50 ms. Allocated memory is still 360.7 MB. Free memory was 337.9 MB in the beginning and 325.2 MB in the end (delta: 12.7 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.0 GB. * TraceAbstraction took 8047.24 ms. Allocated memory was 360.7 MB in the beginning and 4.1 GB in the end (delta: 3.7 GB). Free memory was 324.8 MB in the beginning and 3.5 GB in the end (delta: -3.2 GB). Peak memory consumption was 505.4 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: Possible infinite loop detected aux_div_aux_div_aux_mod_x1_24_53_119 already exists de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: Possible infinite loop detected aux_div_aux_div_aux_mod_x1_24_53_119 already exists: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.polynomials.SolveForSubjectUtils.tryToHandleDivModSubterm(SolveForSubjectUtils.java:198) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...