/usr/bin/java -Xmx8000000000 -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/parallel/barrier-loop.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.1-9bbddad6b14272d9691b7fb6f1c011d15ab18596-9bbddad [2021-06-12 20:24:31,684 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-06-12 20:24:31,686 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-06-12 20:24:31,711 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-06-12 20:24:31,711 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-06-12 20:24:31,712 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-06-12 20:24:31,714 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-06-12 20:24:31,715 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-06-12 20:24:31,717 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-06-12 20:24:31,718 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-06-12 20:24:31,719 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-06-12 20:24:31,720 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-06-12 20:24:31,720 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-06-12 20:24:31,721 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-06-12 20:24:31,722 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-06-12 20:24:31,723 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-06-12 20:24:31,724 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-06-12 20:24:31,724 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-06-12 20:24:31,726 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-06-12 20:24:31,727 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-06-12 20:24:31,729 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-06-12 20:24:31,730 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-06-12 20:24:31,731 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-06-12 20:24:31,732 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-06-12 20:24:31,734 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-06-12 20:24:31,734 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-06-12 20:24:31,735 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-06-12 20:24:31,735 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-06-12 20:24:31,736 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-06-12 20:24:31,737 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-06-12 20:24:31,737 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-06-12 20:24:31,738 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-06-12 20:24:31,738 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-06-12 20:24:31,739 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-06-12 20:24:31,740 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-06-12 20:24:31,740 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-06-12 20:24:31,741 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-06-12 20:24:31,741 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-06-12 20:24:31,741 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-06-12 20:24:31,751 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-06-12 20:24:31,752 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-06-12 20:24:31,753 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-12 20:24:31,772 INFO L113 SettingsManager]: Loading preferences was successful [2021-06-12 20:24:31,773 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-06-12 20:24:31,773 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-06-12 20:24:31,773 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-06-12 20:24:31,774 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-06-12 20:24:31,774 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-06-12 20:24:31,774 INFO L138 SettingsManager]: * Use SBE=true [2021-06-12 20:24:31,775 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-06-12 20:24:31,775 INFO L138 SettingsManager]: * sizeof long=4 [2021-06-12 20:24:31,775 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-06-12 20:24:31,775 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-06-12 20:24:31,775 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-06-12 20:24:31,775 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-06-12 20:24:31,775 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-06-12 20:24:31,776 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-06-12 20:24:31,776 INFO L138 SettingsManager]: * sizeof long double=12 [2021-06-12 20:24:31,776 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-06-12 20:24:31,776 INFO L138 SettingsManager]: * Use constant arrays=true [2021-06-12 20:24:31,776 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-06-12 20:24:31,776 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-06-12 20:24:31,776 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-06-12 20:24:31,777 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-06-12 20:24:31,777 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-06-12 20:24:31,777 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-12 20:24:31,777 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-06-12 20:24:31,777 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-06-12 20:24:31,777 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-06-12 20:24:31,777 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-06-12 20:24:31,777 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-06-12 20:24:31,778 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-06-12 20:24:31,778 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-06-12 20:24:31,778 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-12 20:24:32,042 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-06-12 20:24:32,074 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-06-12 20:24:32,077 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-06-12 20:24:32,078 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2021-06-12 20:24:32,079 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2021-06-12 20:24:32,080 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/parallel/barrier-loop.wvr.bpl [2021-06-12 20:24:32,080 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/parallel/barrier-loop.wvr.bpl' [2021-06-12 20:24:32,110 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-06-12 20:24:32,111 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2021-06-12 20:24:32,112 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-06-12 20:24:32,112 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-06-12 20:24:32,112 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-06-12 20:24:32,122 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.06 08:24:32" (1/1) ... [2021-06-12 20:24:32,128 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.06 08:24:32" (1/1) ... [2021-06-12 20:24:32,133 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-06-12 20:24:32,134 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-06-12 20:24:32,134 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-06-12 20:24:32,134 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-06-12 20:24:32,140 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.06 08:24:32" (1/1) ... [2021-06-12 20:24:32,140 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.06 08:24:32" (1/1) ... [2021-06-12 20:24:32,141 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.06 08:24:32" (1/1) ... [2021-06-12 20:24:32,141 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.06 08:24:32" (1/1) ... [2021-06-12 20:24:32,144 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.06 08:24:32" (1/1) ... [2021-06-12 20:24:32,146 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.06 08:24:32" (1/1) ... [2021-06-12 20:24:32,147 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.06 08:24:32" (1/1) ... [2021-06-12 20:24:32,148 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-06-12 20:24:32,149 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-06-12 20:24:32,149 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-06-12 20:24:32,149 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-06-12 20:24:32,152 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.06 08:24:32" (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-12 20:24:32,233 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2021-06-12 20:24:32,234 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2021-06-12 20:24:32,234 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2021-06-12 20:24:32,234 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2021-06-12 20:24:32,234 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2021-06-12 20:24:32,235 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2021-06-12 20:24:32,235 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2021-06-12 20:24:32,235 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-06-12 20:24:32,235 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-06-12 20:24:32,236 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2021-06-12 20:24:32,236 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2021-06-12 20:24:32,237 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2021-06-12 20:24:32,237 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread4 given in one single declaration [2021-06-12 20:24:32,237 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2021-06-12 20:24:32,237 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2021-06-12 20:24:32,237 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread5 given in one single declaration [2021-06-12 20:24:32,237 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2021-06-12 20:24:32,237 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2021-06-12 20:24:32,238 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread6 given in one single declaration [2021-06-12 20:24:32,238 INFO L130 BoogieDeclarations]: Found specification of procedure thread6 [2021-06-12 20:24:32,238 INFO L138 BoogieDeclarations]: Found implementation of procedure thread6 [2021-06-12 20:24:32,239 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-06-12 20:24:32,422 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-06-12 20:24:32,422 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2021-06-12 20:24:32,424 INFO L202 PluginConnector]: Adding new model barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.06 08:24:32 BoogieIcfgContainer [2021-06-12 20:24:32,424 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-06-12 20:24:32,426 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-06-12 20:24:32,426 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-06-12 20:24:32,429 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-06-12 20:24:32,429 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.06 08:24:32" (1/2) ... [2021-06-12 20:24:32,430 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22780f09 and model type barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.06 08:24:32, skipping insertion in model container [2021-06-12 20:24:32,430 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.06 08:24:32" (2/2) ... [2021-06-12 20:24:32,431 INFO L111 eAbstractionObserver]: Analyzing ICFG barrier-loop.wvr.bpl [2021-06-12 20:24:32,435 WARN L148 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-06-12 20:24:32,436 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-06-12 20:24:32,436 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-06-12 20:24:32,437 INFO L471 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-06-12 20:24:32,532 INFO L149 ThreadInstanceAdder]: Constructed 18 joinOtherThreadTransitions. [2021-06-12 20:24:32,549 INFO L255 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-06-12 20:24:32,568 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-12 20:24:32,568 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-12 20:24:32,568 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-12 20:24:32,569 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-12 20:24:32,569 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-12 20:24:32,569 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-12 20:24:32,569 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-12 20:24:32,569 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == thread4Thread1of1ForFork3======== [2021-06-12 20:24:32,590 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 84 places, 73 transitions, 218 flow [2021-06-12 20:24:33,328 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 10822 states, 10820 states have (on average 4.095101663585952) internal successors, (44309), 10821 states have internal predecessors, (44309), 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-12 20:24:33,412 INFO L276 IsEmpty]: Start isEmpty. Operand has 10822 states, 10820 states have (on average 4.095101663585952) internal successors, (44309), 10821 states have internal predecessors, (44309), 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-12 20:24:33,516 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-06-12 20:24:33,516 INFO L301 ceAbstractionStarter]: Result for error location thread4Thread1of1ForFork3 was SAFE (1/5) [2021-06-12 20:24:33,520 INFO L255 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-06-12 20:24:33,522 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-12 20:24:33,524 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-12 20:24:33,524 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-12 20:24:33,524 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-12 20:24:33,524 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-12 20:24:33,524 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-12 20:24:33,524 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-12 20:24:33,524 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == thread1======== [2021-06-12 20:24:33,528 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 84 places, 73 transitions, 218 flow [2021-06-12 20:24:34,055 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 10822 states, 10820 states have (on average 4.095101663585952) internal successors, (44309), 10821 states have internal predecessors, (44309), 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-12 20:24:34,083 INFO L276 IsEmpty]: Start isEmpty. Operand has 10822 states, 10820 states have (on average 4.095101663585952) internal successors, (44309), 10821 states have internal predecessors, (44309), 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-12 20:24:34,124 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-06-12 20:24:34,125 INFO L301 ceAbstractionStarter]: Result for error location thread1 was SAFE (2/5) [2021-06-12 20:24:34,127 INFO L255 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-06-12 20:24:34,133 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-12 20:24:34,133 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-12 20:24:34,133 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-12 20:24:34,134 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-12 20:24:34,134 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-12 20:24:34,134 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-12 20:24:34,134 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-12 20:24:34,134 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == thread1Thread1of1ForFork2======== [2021-06-12 20:24:34,142 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 84 places, 73 transitions, 218 flow [2021-06-12 20:24:34,539 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 10822 states, 10820 states have (on average 4.095101663585952) internal successors, (44309), 10821 states have internal predecessors, (44309), 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-12 20:24:34,558 INFO L276 IsEmpty]: Start isEmpty. Operand has 10822 states, 10820 states have (on average 4.095101663585952) internal successors, (44309), 10821 states have internal predecessors, (44309), 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-12 20:24:34,608 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-06-12 20:24:34,609 INFO L301 ceAbstractionStarter]: Result for error location thread1Thread1of1ForFork2 was SAFE (3/5) [2021-06-12 20:24:34,610 INFO L255 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-06-12 20:24:34,621 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-12 20:24:34,621 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-12 20:24:34,621 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-12 20:24:34,621 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-12 20:24:34,621 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-12 20:24:34,621 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-12 20:24:34,621 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-12 20:24:34,621 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == thread4======== [2021-06-12 20:24:34,623 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 84 places, 73 transitions, 218 flow [2021-06-12 20:24:34,987 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 10822 states, 10820 states have (on average 4.095101663585952) internal successors, (44309), 10821 states have internal predecessors, (44309), 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-12 20:24:35,007 INFO L276 IsEmpty]: Start isEmpty. Operand has 10822 states, 10820 states have (on average 4.095101663585952) internal successors, (44309), 10821 states have internal predecessors, (44309), 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-12 20:24:35,056 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-06-12 20:24:35,057 INFO L301 ceAbstractionStarter]: Result for error location thread4 was SAFE (4/5) [2021-06-12 20:24:35,057 INFO L255 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2021-06-12 20:24:35,058 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-12 20:24:35,058 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-12 20:24:35,059 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-12 20:24:35,059 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-12 20:24:35,059 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-12 20:24:35,059 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-12 20:24:35,059 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-12 20:24:35,059 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.start======== [2021-06-12 20:24:35,061 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 84 places, 73 transitions, 218 flow [2021-06-12 20:24:35,444 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 10822 states, 10820 states have (on average 4.095101663585952) internal successors, (44309), 10821 states have internal predecessors, (44309), 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-12 20:24:35,462 INFO L276 IsEmpty]: Start isEmpty. Operand has 10822 states, 10820 states have (on average 4.095101663585952) internal successors, (44309), 10821 states have internal predecessors, (44309), 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-12 20:24:35,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-06-12 20:24:35,493 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 20:24:35,495 INFO L472 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] [2021-06-12 20:24:35,495 INFO L430 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-12 20:24:35,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 20:24:35,501 INFO L82 PathProgramCache]: Analyzing trace with hash -1662194858, now seen corresponding path program 1 times [2021-06-12 20:24:35,508 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 20:24:35,509 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643953492] [2021-06-12 20:24:35,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 20:24:35,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 20:24:35,684 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-12 20:24:35,685 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 20:24:35,685 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643953492] [2021-06-12 20:24:35,686 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643953492] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 20:24:35,686 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 20:24:35,686 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-12 20:24:35,686 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743534013] [2021-06-12 20:24:35,690 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-12 20:24:35,690 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 20:24:35,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-12 20:24:35,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-12 20:24:35,719 INFO L87 Difference]: Start difference. First operand has 10822 states, 10820 states have (on average 4.095101663585952) internal successors, (44309), 10821 states have internal predecessors, (44309), 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 7.666666666666667) internal successors, (23), 2 states have internal predecessors, (23), 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-12 20:24:35,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 20:24:35,935 INFO L93 Difference]: Finished difference Result 11214 states and 45854 transitions. [2021-06-12 20:24:35,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-12 20:24:35,937 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 2 states have internal predecessors, (23), 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 23 [2021-06-12 20:24:35,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 20:24:36,044 INFO L225 Difference]: With dead ends: 11214 [2021-06-12 20:24:36,044 INFO L226 Difference]: Without dead ends: 11193 [2021-06-12 20:24:36,045 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 31.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-12 20:24:36,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11193 states. [2021-06-12 20:24:36,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11193 to 10962. [2021-06-12 20:24:36,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10962 states, 10961 states have (on average 4.090958854119149) internal successors, (44841), 10961 states have internal predecessors, (44841), 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-12 20:24:36,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10962 states to 10962 states and 44841 transitions. [2021-06-12 20:24:36,737 INFO L78 Accepts]: Start accepts. Automaton has 10962 states and 44841 transitions. Word has length 23 [2021-06-12 20:24:36,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 20:24:36,739 INFO L482 AbstractCegarLoop]: Abstraction has 10962 states and 44841 transitions. [2021-06-12 20:24:36,739 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 2 states have internal predecessors, (23), 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-12 20:24:36,739 INFO L276 IsEmpty]: Start isEmpty. Operand 10962 states and 44841 transitions. [2021-06-12 20:24:36,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-06-12 20:24:36,789 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 20:24:36,790 INFO L472 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, 1, 1] [2021-06-12 20:24:36,791 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-06-12 20:24:36,793 INFO L430 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-12 20:24:36,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 20:24:36,794 INFO L82 PathProgramCache]: Analyzing trace with hash -271254563, now seen corresponding path program 1 times [2021-06-12 20:24:36,794 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 20:24:36,799 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233153046] [2021-06-12 20:24:36,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 20:24:36,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 20:24:36,839 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-12 20:24:36,839 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 20:24:36,840 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233153046] [2021-06-12 20:24:36,840 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233153046] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 20:24:36,840 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 20:24:36,840 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-12 20:24:36,840 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687511835] [2021-06-12 20:24:36,841 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-12 20:24:36,842 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 20:24:36,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-12 20:24:36,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-12 20:24:36,842 INFO L87 Difference]: Start difference. First operand 10962 states and 44841 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 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-12 20:24:37,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 20:24:37,003 INFO L93 Difference]: Finished difference Result 13038 states and 52625 transitions. [2021-06-12 20:24:37,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-12 20:24:37,004 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 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 31 [2021-06-12 20:24:37,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 20:24:37,091 INFO L225 Difference]: With dead ends: 13038 [2021-06-12 20:24:37,091 INFO L226 Difference]: Without dead ends: 12721 [2021-06-12 20:24:37,092 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-12 20:24:37,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12721 states. [2021-06-12 20:24:37,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12721 to 11889. [2021-06-12 20:24:37,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11889 states, 11888 states have (on average 4.034909152086137) internal successors, (47967), 11888 states have internal predecessors, (47967), 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-12 20:24:37,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11889 states to 11889 states and 47967 transitions. [2021-06-12 20:24:37,965 INFO L78 Accepts]: Start accepts. Automaton has 11889 states and 47967 transitions. Word has length 31 [2021-06-12 20:24:37,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 20:24:37,966 INFO L482 AbstractCegarLoop]: Abstraction has 11889 states and 47967 transitions. [2021-06-12 20:24:37,966 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 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-12 20:24:37,966 INFO L276 IsEmpty]: Start isEmpty. Operand 11889 states and 47967 transitions. [2021-06-12 20:24:37,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-06-12 20:24:37,991 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 20:24:37,992 INFO L472 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, 1, 1] [2021-06-12 20:24:37,992 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-06-12 20:24:37,992 INFO L430 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-12 20:24:37,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 20:24:37,993 INFO L82 PathProgramCache]: Analyzing trace with hash -532176069, now seen corresponding path program 1 times [2021-06-12 20:24:37,993 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 20:24:37,994 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186757027] [2021-06-12 20:24:37,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 20:24:38,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 20:24:38,042 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-12 20:24:38,042 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 20:24:38,042 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186757027] [2021-06-12 20:24:38,043 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186757027] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 20:24:38,043 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 20:24:38,043 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-12 20:24:38,043 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655014167] [2021-06-12 20:24:38,043 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-12 20:24:38,043 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 20:24:38,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-12 20:24:38,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-12 20:24:38,044 INFO L87 Difference]: Start difference. First operand 11889 states and 47967 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 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-12 20:24:38,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 20:24:38,453 INFO L93 Difference]: Finished difference Result 11681 states and 45149 transitions. [2021-06-12 20:24:38,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-12 20:24:38,453 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 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 31 [2021-06-12 20:24:38,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 20:24:38,519 INFO L225 Difference]: With dead ends: 11681 [2021-06-12 20:24:38,519 INFO L226 Difference]: Without dead ends: 9378 [2021-06-12 20:24:38,519 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-12 20:24:38,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9378 states. [2021-06-12 20:24:38,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9378 to 9378. [2021-06-12 20:24:38,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9378 states, 9377 states have (on average 3.84099392129679) internal successors, (36017), 9377 states have internal predecessors, (36017), 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-12 20:24:39,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9378 states to 9378 states and 36017 transitions. [2021-06-12 20:24:39,017 INFO L78 Accepts]: Start accepts. Automaton has 9378 states and 36017 transitions. Word has length 31 [2021-06-12 20:24:39,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 20:24:39,018 INFO L482 AbstractCegarLoop]: Abstraction has 9378 states and 36017 transitions. [2021-06-12 20:24:39,018 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 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-12 20:24:39,018 INFO L276 IsEmpty]: Start isEmpty. Operand 9378 states and 36017 transitions. [2021-06-12 20:24:39,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-06-12 20:24:39,035 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 20:24:39,035 INFO L472 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, 1, 1] [2021-06-12 20:24:39,035 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-06-12 20:24:39,036 INFO L430 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-12 20:24:39,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 20:24:39,036 INFO L82 PathProgramCache]: Analyzing trace with hash -1106136239, now seen corresponding path program 1 times [2021-06-12 20:24:39,036 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 20:24:39,036 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821126216] [2021-06-12 20:24:39,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 20:24:39,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 20:24:39,094 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-12 20:24:39,094 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 20:24:39,094 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821126216] [2021-06-12 20:24:39,094 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821126216] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 20:24:39,094 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 20:24:39,094 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-12 20:24:39,095 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625000096] [2021-06-12 20:24:39,095 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-12 20:24:39,095 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 20:24:39,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-12 20:24:39,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-12 20:24:39,096 INFO L87 Difference]: Start difference. First operand 9378 states and 36017 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 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-12 20:24:39,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 20:24:39,158 INFO L93 Difference]: Finished difference Result 11158 states and 41887 transitions. [2021-06-12 20:24:39,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-12 20:24:39,158 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 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 31 [2021-06-12 20:24:39,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 20:24:39,201 INFO L225 Difference]: With dead ends: 11158 [2021-06-12 20:24:39,201 INFO L226 Difference]: Without dead ends: 10600 [2021-06-12 20:24:39,201 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-12 20:24:39,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10600 states. [2021-06-12 20:24:39,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10600 to 10244. [2021-06-12 20:24:39,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10244 states, 10243 states have (on average 3.7574929219955093) internal successors, (38488), 10243 states have internal predecessors, (38488), 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-12 20:24:39,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10244 states to 10244 states and 38488 transitions. [2021-06-12 20:24:39,748 INFO L78 Accepts]: Start accepts. Automaton has 10244 states and 38488 transitions. Word has length 31 [2021-06-12 20:24:39,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 20:24:39,748 INFO L482 AbstractCegarLoop]: Abstraction has 10244 states and 38488 transitions. [2021-06-12 20:24:39,749 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 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-12 20:24:39,749 INFO L276 IsEmpty]: Start isEmpty. Operand 10244 states and 38488 transitions. [2021-06-12 20:24:39,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-06-12 20:24:39,761 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 20:24:39,761 INFO L472 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, 1, 1] [2021-06-12 20:24:39,761 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-06-12 20:24:39,761 INFO L430 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-12 20:24:39,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 20:24:39,762 INFO L82 PathProgramCache]: Analyzing trace with hash -1819688453, now seen corresponding path program 1 times [2021-06-12 20:24:39,762 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 20:24:39,762 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331584387] [2021-06-12 20:24:39,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 20:24:39,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 20:24:39,816 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-12 20:24:39,816 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 20:24:39,816 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331584387] [2021-06-12 20:24:39,816 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331584387] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 20:24:39,817 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 20:24:39,817 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-12 20:24:39,817 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035722480] [2021-06-12 20:24:39,817 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-12 20:24:39,817 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 20:24:39,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-12 20:24:39,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-12 20:24:39,818 INFO L87 Difference]: Start difference. First operand 10244 states and 38488 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 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-12 20:24:39,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 20:24:39,861 INFO L93 Difference]: Finished difference Result 9700 states and 34735 transitions. [2021-06-12 20:24:39,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-12 20:24:39,862 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 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 31 [2021-06-12 20:24:39,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 20:24:39,888 INFO L225 Difference]: With dead ends: 9700 [2021-06-12 20:24:39,889 INFO L226 Difference]: Without dead ends: 8001 [2021-06-12 20:24:39,889 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-12 20:24:40,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8001 states. [2021-06-12 20:24:40,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8001 to 8001. [2021-06-12 20:24:40,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8001 states, 8000 states have (on average 3.590375) internal successors, (28723), 8000 states have internal predecessors, (28723), 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-12 20:24:40,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8001 states to 8001 states and 28723 transitions. [2021-06-12 20:24:40,359 INFO L78 Accepts]: Start accepts. Automaton has 8001 states and 28723 transitions. Word has length 31 [2021-06-12 20:24:40,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 20:24:40,359 INFO L482 AbstractCegarLoop]: Abstraction has 8001 states and 28723 transitions. [2021-06-12 20:24:40,359 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 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-12 20:24:40,359 INFO L276 IsEmpty]: Start isEmpty. Operand 8001 states and 28723 transitions. [2021-06-12 20:24:40,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-06-12 20:24:40,374 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 20:24:40,374 INFO L472 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-12 20:24:40,374 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-06-12 20:24:40,375 INFO L430 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-12 20:24:40,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 20:24:40,375 INFO L82 PathProgramCache]: Analyzing trace with hash 185522314, now seen corresponding path program 1 times [2021-06-12 20:24:40,375 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 20:24:40,375 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707741441] [2021-06-12 20:24:40,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 20:24:40,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 20:24:40,409 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 20:24:40,409 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 20:24:40,410 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707741441] [2021-06-12 20:24:40,410 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707741441] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 20:24:40,416 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 20:24:40,417 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-12 20:24:40,417 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578544955] [2021-06-12 20:24:40,417 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-12 20:24:40,417 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 20:24:40,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-12 20:24:40,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-12 20:24:40,418 INFO L87 Difference]: Start difference. First operand 8001 states and 28723 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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-12 20:24:40,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 20:24:40,546 INFO L93 Difference]: Finished difference Result 6666 states and 23386 transitions. [2021-06-12 20:24:40,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-12 20:24:40,549 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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 39 [2021-06-12 20:24:40,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 20:24:40,568 INFO L225 Difference]: With dead ends: 6666 [2021-06-12 20:24:40,568 INFO L226 Difference]: Without dead ends: 6666 [2021-06-12 20:24:40,568 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-12 20:24:40,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6666 states. [2021-06-12 20:24:40,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6666 to 6666. [2021-06-12 20:24:40,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6666 states, 6665 states have (on average 3.508777194298575) internal successors, (23386), 6665 states have internal predecessors, (23386), 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-12 20:24:40,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6666 states to 6666 states and 23386 transitions. [2021-06-12 20:24:40,827 INFO L78 Accepts]: Start accepts. Automaton has 6666 states and 23386 transitions. Word has length 39 [2021-06-12 20:24:40,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 20:24:40,827 INFO L482 AbstractCegarLoop]: Abstraction has 6666 states and 23386 transitions. [2021-06-12 20:24:40,827 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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-12 20:24:40,827 INFO L276 IsEmpty]: Start isEmpty. Operand 6666 states and 23386 transitions. [2021-06-12 20:24:40,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-06-12 20:24:40,839 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 20:24:40,839 INFO L472 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-12 20:24:40,839 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-06-12 20:24:40,839 INFO L430 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-12 20:24:40,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 20:24:40,840 INFO L82 PathProgramCache]: Analyzing trace with hash 257566338, now seen corresponding path program 2 times [2021-06-12 20:24:40,840 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 20:24:40,840 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633781109] [2021-06-12 20:24:40,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 20:24:40,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-12 20:24:40,852 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-12 20:24:40,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-12 20:24:40,861 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-12 20:24:40,897 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-12 20:24:40,898 INFO L573 BasicCegarLoop]: Counterexample might be feasible [2021-06-12 20:24:40,898 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-06-12 20:24:40,898 INFO L301 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (5/5) [2021-06-12 20:24:40,899 INFO L247 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-06-12 20:24:40,932 INFO L202 PluginConnector]: Adding new model barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.06 08:24:40 BasicIcfg [2021-06-12 20:24:40,932 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-06-12 20:24:40,933 INFO L168 Benchmark]: Toolchain (without parser) took 8821.37 ms. Allocated memory was 180.4 MB in the beginning and 3.8 GB in the end (delta: 3.7 GB). Free memory was 160.7 MB in the beginning and 3.2 GB in the end (delta: -3.1 GB). Peak memory consumption was 577.3 MB. Max. memory is 8.0 GB. [2021-06-12 20:24:40,933 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.11 ms. Allocated memory is still 180.4 MB. Free memory is still 161.9 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-06-12 20:24:40,933 INFO L168 Benchmark]: Boogie Procedure Inliner took 21.52 ms. Allocated memory is still 180.4 MB. Free memory was 160.6 MB in the beginning and 159.1 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2021-06-12 20:24:40,934 INFO L168 Benchmark]: Boogie Preprocessor took 14.39 ms. Allocated memory is still 180.4 MB. Free memory was 159.1 MB in the beginning and 158.0 MB in the end (delta: 1.2 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2021-06-12 20:24:40,934 INFO L168 Benchmark]: RCFGBuilder took 275.44 ms. Allocated memory is still 180.4 MB. Free memory was 158.0 MB in the beginning and 142.5 MB in the end (delta: 15.4 MB). Peak memory consumption was 15.7 MB. Max. memory is 8.0 GB. [2021-06-12 20:24:40,935 INFO L168 Benchmark]: TraceAbstraction took 8505.86 ms. Allocated memory was 180.4 MB in the beginning and 3.8 GB in the end (delta: 3.7 GB). Free memory was 142.0 MB in the beginning and 3.2 GB in the end (delta: -3.1 GB). Peak memory consumption was 559.5 MB. Max. memory is 8.0 GB. [2021-06-12 20:24:40,937 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.11 ms. Allocated memory is still 180.4 MB. Free memory is still 161.9 MB. There was no memory consumed. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 21.52 ms. Allocated memory is still 180.4 MB. Free memory was 160.6 MB in the beginning and 159.1 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 14.39 ms. Allocated memory is still 180.4 MB. Free memory was 159.1 MB in the beginning and 158.0 MB in the end (delta: 1.2 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * RCFGBuilder took 275.44 ms. Allocated memory is still 180.4 MB. Free memory was 158.0 MB in the beginning and 142.5 MB in the end (delta: 15.4 MB). Peak memory consumption was 15.7 MB. Max. memory is 8.0 GB. * TraceAbstraction took 8505.86 ms. Allocated memory was 180.4 MB in the beginning and 3.8 GB in the end (delta: 3.7 GB). Free memory was 142.0 MB in the beginning and 3.2 GB in the end (delta: -3.1 GB). Peak memory consumption was 559.5 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 121]: assertion can be violated assertion can be violated We found a FailurePath: [L115] 0 assume x_0 == x_8 && y_1 == y_9; VAL [x_0=-1, x_8=-1, y_1=-1, y_9=-1] [L116] FORK 0 fork 1 thread1(); VAL [x_0=-1, x_8=-1, y_1=-1, y_9=-1] [L60] 1 f1_2 := false; [L61] 1 f2_3 := false; VAL [f1_2=false, f2_3=false, x_0=-1, x_8=-1, y_1=-1, y_9=-1] [L117] FORK 0 fork 4, 4, 4, 4 thread4(); VAL [f1_2=false, f2_3=false, x_0=-1, x_8=-1, y_1=-1, y_9=-1] [L103] 2 f1_10 := false; [L104] 2 f2_11 := false; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, x_0=-1, x_8=-1, y_1=-1, y_9=-1] [L106] FORK 2 fork 5, 5, 5, 5, 5 thread5(); VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, x_0=-1, x_8=-1, y_1=-1, y_9=-1] [L73] 3 temp_12 := x_8; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_12=-1, x_0=-1, x_8=-1, y_1=-1, y_9=-1] [L74] 3 x_8 := temp_12 + 1; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_12=-1, x_0=-1, x_8=0, y_1=-1, y_9=-1] [L75] 3 f1_10 := true; VAL [f1_10=true, f1_2=false, f2_11=false, f2_3=false, temp_12=-1, x_0=-1, x_8=0, y_1=-1, y_9=-1] [L107] FORK 2 fork 6, 6, 6, 6, 6, 6 thread6(); VAL [f1_10=true, f1_2=false, f2_11=false, f2_3=false, temp_12=-1, x_0=-1, x_8=0, y_1=-1, y_9=-1] [L88] 4 temp_14 := y_9; VAL [f1_10=true, f1_2=false, f2_11=false, f2_3=false, temp_12=-1, temp_14=-1, x_0=-1, x_8=0, y_1=-1, y_9=-1] [L89] 4 y_9 := temp_14 + 1; VAL [f1_10=true, f1_2=false, f2_11=false, f2_3=false, temp_12=-1, temp_14=-1, x_0=-1, x_8=0, y_1=-1, y_9=0] [L90] 4 f2_11 := true; VAL [f1_10=true, f1_2=false, f2_11=true, f2_3=false, temp_12=-1, temp_14=-1, x_0=-1, x_8=0, y_1=-1, y_9=0] [L76] 3 assume f2_11; VAL [f1_10=true, f1_2=false, f2_11=true, f2_3=false, temp_12=-1, temp_14=-1, x_0=-1, x_8=0, y_1=-1, y_9=0] [L77] 3 temp_13 := y_9; VAL [f1_10=true, f1_2=false, f2_11=true, f2_3=false, temp_12=-1, temp_13=0, temp_14=-1, x_0=-1, x_8=0, y_1=-1, y_9=0] [L78] 3 y_9 := temp_13 + 1; VAL [f1_10=true, f1_2=false, f2_11=true, f2_3=false, temp_12=-1, temp_13=0, temp_14=-1, x_0=-1, x_8=0, y_1=-1, y_9=1] [L91] 4 assume f1_10; VAL [f1_10=true, f1_2=false, f2_11=true, f2_3=false, temp_12=-1, temp_13=0, temp_14=-1, x_0=-1, x_8=0, y_1=-1, y_9=1] [L79] 3 f1_10 := false; VAL [f1_10=false, f1_2=false, f2_11=true, f2_3=false, temp_12=-1, temp_13=0, temp_14=-1, x_0=-1, x_8=0, y_1=-1, y_9=1] [L92] 4 temp_15 := x_8; VAL [f1_10=false, f1_2=false, f2_11=true, f2_3=false, temp_12=-1, temp_13=0, temp_14=-1, temp_15=0, x_0=-1, x_8=0, y_1=-1, y_9=1] [L63] FORK 1 fork 2, 2 thread2(); VAL [f1_10=false, f1_2=false, f2_11=true, f2_3=false, temp_12=-1, temp_13=0, temp_14=-1, temp_15=0, x_0=-1, x_8=0, y_1=-1, y_9=1] [L64] FORK 1 fork 3, 3, 3 thread3(); VAL [f1_10=false, f1_2=false, f2_11=true, f2_3=false, temp_12=-1, temp_13=0, temp_14=-1, temp_15=0, x_0=-1, x_8=0, y_1=-1, y_9=1] [L65] JOIN 5 join 2, 2; VAL [f1_10=false, f1_2=false, f2_11=true, f2_3=false, temp_12=-1, temp_13=0, temp_14=-1, temp_15=0, x_0=-1, x_8=0, y_1=-1, y_9=1] [L66] JOIN 6 join 3, 3, 3; VAL [f1_10=false, f1_2=false, f2_11=true, f2_3=false, temp_12=-1, temp_13=0, temp_14=-1, temp_15=0, x_0=-1, x_8=0, y_1=-1, y_9=1] [L118] JOIN 1 join 1; VAL [f1_10=false, f1_2=false, f2_11=true, f2_3=false, temp_12=-1, temp_13=0, temp_14=-1, temp_15=0, x_0=-1, x_8=0, y_1=-1, y_9=1] [L93] 4 x_8 := temp_15 + 1; VAL [f1_10=false, f1_2=false, f2_11=true, f2_3=false, temp_12=-1, temp_13=0, temp_14=-1, temp_15=0, x_0=-1, x_8=1, y_1=-1, y_9=1] [L94] 4 f2_11 := false; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_12=-1, temp_13=0, temp_14=-1, temp_15=0, x_0=-1, x_8=1, y_1=-1, y_9=1] [L95] 4 assume !f1_10; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_12=-1, temp_13=0, temp_14=-1, temp_15=0, x_0=-1, x_8=1, y_1=-1, y_9=1] [L80] 3 assume !f2_11; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_12=-1, temp_13=0, temp_14=-1, temp_15=0, x_0=-1, x_8=1, y_1=-1, y_9=1] [L108] JOIN 3 join 5, 5, 5, 5, 5; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_12=-1, temp_13=0, temp_14=-1, temp_15=0, x_0=-1, x_8=1, y_1=-1, y_9=1] [L109] JOIN 4 join 6, 6, 6, 6, 6, 6; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_12=-1, temp_13=0, temp_14=-1, temp_15=0, x_0=-1, x_8=1, y_1=-1, y_9=1] [L119] JOIN 2 join 4, 4, 4, 4; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_12=-1, temp_13=0, temp_14=-1, temp_15=0, x_0=-1, x_8=1, y_1=-1, y_9=1] [L120] 0 assume !(x_0 == x_8 && y_1 == y_9); VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_12=-1, temp_13=0, temp_14=-1, temp_15=0, x_0=-1, x_8=1, y_1=-1, y_9=1] [L121] 0 assert false; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_12=-1, temp_13=0, temp_14=-1, temp_15=0, x_0=-1, x_8=1, y_1=-1, y_9=1] - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: thread4Thread1of1ForFork3 with 1 thread instances CFG has 13 procedures, 120 locations, 11 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 950.1ms, OverallIterations: 0, TraceHistogramMax: 0, EmptinessCheckTime: 187.5ms, AutomataDifference: 0.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 758.8ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=10822occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: thread1 with 1 thread instances CFG has 13 procedures, 120 locations, 11 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 602.9ms, OverallIterations: 0, TraceHistogramMax: 0, EmptinessCheckTime: 69.9ms, AutomataDifference: 0.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 530.6ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=10822occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: thread1Thread1of1ForFork2 with 1 thread instances CFG has 13 procedures, 120 locations, 11 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 475.5ms, OverallIterations: 0, TraceHistogramMax: 0, EmptinessCheckTime: 69.3ms, AutomataDifference: 0.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 404.7ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=10822occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: thread4 with 1 thread instances CFG has 13 procedures, 120 locations, 11 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 436.2ms, OverallIterations: 0, TraceHistogramMax: 0, EmptinessCheckTime: 69.6ms, AutomataDifference: 0.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 365.4ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=10822occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 13 procedures, 120 locations, 11 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 5839.8ms, OverallIterations: 7, TraceHistogramMax: 1, EmptinessCheckTime: 179.9ms, AutomataDifference: 1409.5ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 385.3ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 515 SDtfs, 206 SDslu, 251 SDs, 0 SdLazy, 37 SolverSat, 8 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 49.1ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 42.9ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=11889occurred in iteration=2, InterpolantAutomatonStates: 18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 3328.9ms AutomataMinimizationTime, 6 MinimizatonAttempts, 1419 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 27.3ms SsaConstructionTime, 100.9ms SatisfiabilityAnalysisTime, 225.8ms InterpolantComputationTime, 225 NumberOfCodeBlocks, 225 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 180 ConstructedInterpolants, 0 QuantifiedInterpolants, 350 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 6/6 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...