/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/fork_loop_inc.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-29289db [2021-06-05 03:09:37,855 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-06-05 03:09:37,858 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-06-05 03:09:37,897 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-06-05 03:09:37,897 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-06-05 03:09:37,900 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-06-05 03:09:37,902 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-06-05 03:09:37,908 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-06-05 03:09:37,910 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-06-05 03:09:37,914 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-06-05 03:09:37,915 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-06-05 03:09:37,916 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-06-05 03:09:37,917 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-06-05 03:09:37,918 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-06-05 03:09:37,920 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-06-05 03:09:37,921 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-06-05 03:09:37,924 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-06-05 03:09:37,924 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-06-05 03:09:37,926 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-06-05 03:09:37,932 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-06-05 03:09:37,933 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-06-05 03:09:37,934 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-06-05 03:09:37,935 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-06-05 03:09:37,937 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-06-05 03:09:37,943 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-06-05 03:09:37,943 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-06-05 03:09:37,943 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-06-05 03:09:37,945 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-06-05 03:09:37,945 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-06-05 03:09:37,946 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-06-05 03:09:37,946 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-06-05 03:09:37,947 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-06-05 03:09:37,948 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-06-05 03:09:37,949 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-06-05 03:09:37,950 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-06-05 03:09:37,950 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-06-05 03:09:37,951 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-06-05 03:09:37,951 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-06-05 03:09:37,951 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-06-05 03:09:37,952 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-06-05 03:09:37,952 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-06-05 03:09:37,960 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 03:09:37,997 INFO L113 SettingsManager]: Loading preferences was successful [2021-06-05 03:09:37,997 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-06-05 03:09:37,998 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-06-05 03:09:37,998 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-06-05 03:09:38,000 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-06-05 03:09:38,000 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-06-05 03:09:38,000 INFO L138 SettingsManager]: * Use SBE=true [2021-06-05 03:09:38,001 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-06-05 03:09:38,001 INFO L138 SettingsManager]: * sizeof long=4 [2021-06-05 03:09:38,001 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-06-05 03:09:38,002 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-06-05 03:09:38,002 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-06-05 03:09:38,002 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-06-05 03:09:38,002 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-06-05 03:09:38,002 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-06-05 03:09:38,002 INFO L138 SettingsManager]: * sizeof long double=12 [2021-06-05 03:09:38,002 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-06-05 03:09:38,003 INFO L138 SettingsManager]: * Use constant arrays=true [2021-06-05 03:09:38,003 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-06-05 03:09:38,003 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-06-05 03:09:38,003 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-06-05 03:09:38,003 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-06-05 03:09:38,003 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-06-05 03:09:38,003 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-05 03:09:38,004 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-06-05 03:09:38,004 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-06-05 03:09:38,004 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-06-05 03:09:38,004 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-06-05 03:09:38,004 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-06-05 03:09:38,004 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-06-05 03:09:38,004 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-06-05 03:09:38,004 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 03:09:38,334 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-06-05 03:09:38,358 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-06-05 03:09:38,360 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-06-05 03:09:38,361 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2021-06-05 03:09:38,362 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2021-06-05 03:09:38,363 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/fork_loop_inc.bpl [2021-06-05 03:09:38,363 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/fork_loop_inc.bpl' [2021-06-05 03:09:38,712 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-06-05 03:09:38,713 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2021-06-05 03:09:38,714 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-06-05 03:09:38,714 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-06-05 03:09:38,715 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-06-05 03:09:38,726 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "fork_loop_inc.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.06 03:09:38" (1/1) ... [2021-06-05 03:09:38,734 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "fork_loop_inc.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.06 03:09:38" (1/1) ... [2021-06-05 03:09:38,741 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-06-05 03:09:38,743 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-06-05 03:09:38,743 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-06-05 03:09:38,744 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-06-05 03:09:38,751 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "fork_loop_inc.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.06 03:09:38" (1/1) ... [2021-06-05 03:09:38,751 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "fork_loop_inc.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.06 03:09:38" (1/1) ... [2021-06-05 03:09:38,752 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "fork_loop_inc.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.06 03:09:38" (1/1) ... [2021-06-05 03:09:38,752 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "fork_loop_inc.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.06 03:09:38" (1/1) ... [2021-06-05 03:09:38,753 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "fork_loop_inc.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.06 03:09:38" (1/1) ... [2021-06-05 03:09:38,756 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "fork_loop_inc.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.06 03:09:38" (1/1) ... [2021-06-05 03:09:38,757 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "fork_loop_inc.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.06 03:09:38" (1/1) ... [2021-06-05 03:09:38,757 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-06-05 03:09:38,759 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-06-05 03:09:38,759 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-06-05 03:09:38,759 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-06-05 03:09:38,761 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "fork_loop_inc.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.06 03:09:38" (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 03:09:38,828 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2021-06-05 03:09:38,829 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-06-05 03:09:38,829 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-06-05 03:09:38,829 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread given in one single declaration [2021-06-05 03:09:38,829 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2021-06-05 03:09:38,829 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2021-06-05 03:09:38,830 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 03:09:38,940 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-06-05 03:09:38,940 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2021-06-05 03:09:38,942 INFO L202 PluginConnector]: Adding new model fork_loop_inc.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.06 03:09:38 BoogieIcfgContainer [2021-06-05 03:09:38,942 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-06-05 03:09:38,944 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-06-05 03:09:38,944 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-06-05 03:09:38,946 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-06-05 03:09:38,947 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "fork_loop_inc.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.06 03:09:38" (1/2) ... [2021-06-05 03:09:38,947 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66a40464 and model type fork_loop_inc.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.06 03:09:38, skipping insertion in model container [2021-06-05 03:09:38,947 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "fork_loop_inc.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.06 03:09:38" (2/2) ... [2021-06-05 03:09:38,949 INFO L111 eAbstractionObserver]: Analyzing ICFG fork_loop_inc.bpl [2021-06-05 03:09:38,956 WARN L148 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-06-05 03:09:38,956 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-06-05 03:09:38,957 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-06-05 03:09:38,958 INFO L510 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-06-05 03:09:38,989 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-05 03:09:39,017 INFO L255 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-06-05 03:09:39,044 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-05 03:09:39,045 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-05 03:09:39,045 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-05 03:09:39,045 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-05 03:09:39,045 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-05 03:09:39,045 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-05 03:09:39,045 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-05 03:09:39,045 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-05 03:09:39,053 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 11 places, 8 transitions, 21 flow [2021-06-05 03:09:39,062 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 20 states, 15 states have (on average 1.8) internal successors, (27), 19 states have internal predecessors, (27), 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 03:09:39,064 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 15 states have (on average 1.8) internal successors, (27), 19 states have internal predecessors, (27), 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 03:09:39,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2021-06-05 03:09:39,068 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 03:09:39,069 INFO L521 BasicCegarLoop]: trace histogram [1, 1] [2021-06-05 03:09:39,069 INFO L430 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 03:09:39,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 03:09:39,075 INFO L82 PathProgramCache]: Analyzing trace with hash 1315, now seen corresponding path program 1 times [2021-06-05 03:09:39,082 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 03:09:39,082 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073214217] [2021-06-05 03:09:39,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 03:09:39,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 03:09:39,204 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 03:09:39,205 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 03:09:39,206 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073214217] [2021-06-05 03:09:39,206 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073214217] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 03:09:39,206 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 03:09:39,206 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-05 03:09:39,207 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358935161] [2021-06-05 03:09:39,210 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-05 03:09:39,211 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 03:09:39,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-05 03:09:39,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 03:09:39,227 INFO L87 Difference]: Start difference. First operand has 20 states, 15 states have (on average 1.8) internal successors, (27), 19 states have internal predecessors, (27), 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, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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 03:09:39,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 03:09:39,246 INFO L93 Difference]: Finished difference Result 16 states and 21 transitions. [2021-06-05 03:09:39,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-05 03:09:39,248 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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 2 [2021-06-05 03:09:39,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 03:09:39,253 INFO L225 Difference]: With dead ends: 16 [2021-06-05 03:09:39,253 INFO L226 Difference]: Without dead ends: 8 [2021-06-05 03:09:39,254 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.8ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 03:09:39,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2021-06-05 03:09:39,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2021-06-05 03:09:39,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 7 states have internal predecessors, (9), 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 03:09:39,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2021-06-05 03:09:39,282 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 9 transitions. Word has length 2 [2021-06-05 03:09:39,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 03:09:39,282 INFO L482 AbstractCegarLoop]: Abstraction has 8 states and 9 transitions. [2021-06-05 03:09:39,282 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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 03:09:39,282 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 9 transitions. [2021-06-05 03:09:39,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-06-05 03:09:39,283 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 03:09:39,283 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-06-05 03:09:39,283 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-06-05 03:09:39,284 INFO L430 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 03:09:39,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 03:09:39,286 INFO L82 PathProgramCache]: Analyzing trace with hash 41033, now seen corresponding path program 1 times [2021-06-05 03:09:39,286 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 03:09:39,286 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152653397] [2021-06-05 03:09:39,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 03:09:39,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-05 03:09:39,295 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-05 03:09:39,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-05 03:09:39,300 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-05 03:09:39,311 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-05 03:09:39,311 INFO L622 BasicCegarLoop]: Counterexample might be feasible [2021-06-05 03:09:39,312 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-06-05 03:09:39,313 WARN L242 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2021-06-05 03:09:39,313 INFO L510 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2021-06-05 03:09:39,338 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-05 03:09:39,339 INFO L255 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-06-05 03:09:39,340 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-05 03:09:39,340 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-05 03:09:39,340 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-05 03:09:39,340 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-05 03:09:39,340 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-05 03:09:39,340 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-05 03:09:39,340 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-05 03:09:39,340 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-05 03:09:39,341 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 16 places, 11 transitions, 34 flow [2021-06-05 03:09:39,350 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 62 states, 55 states have (on average 2.2) internal successors, (121), 61 states have internal predecessors, (121), 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 03:09:39,351 INFO L276 IsEmpty]: Start isEmpty. Operand has 62 states, 55 states have (on average 2.2) internal successors, (121), 61 states have internal predecessors, (121), 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 03:09:39,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2021-06-05 03:09:39,351 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 03:09:39,351 INFO L521 BasicCegarLoop]: trace histogram [1, 1] [2021-06-05 03:09:39,352 INFO L430 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 03:09:39,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 03:09:39,352 INFO L82 PathProgramCache]: Analyzing trace with hash 1667, now seen corresponding path program 1 times [2021-06-05 03:09:39,352 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 03:09:39,352 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268514779] [2021-06-05 03:09:39,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 03:09:39,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 03:09:39,366 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 03:09:39,366 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 03:09:39,366 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268514779] [2021-06-05 03:09:39,366 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268514779] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 03:09:39,366 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 03:09:39,367 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-05 03:09:39,367 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799313983] [2021-06-05 03:09:39,368 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-05 03:09:39,368 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 03:09:39,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-05 03:09:39,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 03:09:39,372 INFO L87 Difference]: Start difference. First operand has 62 states, 55 states have (on average 2.2) internal successors, (121), 61 states have internal predecessors, (121), 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, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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 03:09:39,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 03:09:39,406 INFO L93 Difference]: Finished difference Result 49 states and 94 transitions. [2021-06-05 03:09:39,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-05 03:09:39,410 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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 2 [2021-06-05 03:09:39,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 03:09:39,411 INFO L225 Difference]: With dead ends: 49 [2021-06-05 03:09:39,411 INFO L226 Difference]: Without dead ends: 23 [2021-06-05 03:09:39,412 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.2ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 03:09:39,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2021-06-05 03:09:39,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2021-06-05 03:09:39,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.8181818181818181) internal successors, (40), 22 states have internal predecessors, (40), 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 03:09:39,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 40 transitions. [2021-06-05 03:09:39,416 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 40 transitions. Word has length 2 [2021-06-05 03:09:39,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 03:09:39,416 INFO L482 AbstractCegarLoop]: Abstraction has 23 states and 40 transitions. [2021-06-05 03:09:39,416 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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 03:09:39,416 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 40 transitions. [2021-06-05 03:09:39,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2021-06-05 03:09:39,416 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 03:09:39,416 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2021-06-05 03:09:39,416 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-06-05 03:09:39,417 INFO L430 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 03:09:39,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 03:09:39,417 INFO L82 PathProgramCache]: Analyzing trace with hash 1612715, now seen corresponding path program 1 times [2021-06-05 03:09:39,417 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 03:09:39,417 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236050109] [2021-06-05 03:09:39,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 03:09:39,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-05 03:09:39,420 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-05 03:09:39,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-05 03:09:39,422 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-05 03:09:39,423 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-05 03:09:39,423 INFO L622 BasicCegarLoop]: Counterexample might be feasible [2021-06-05 03:09:39,423 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-06-05 03:09:39,424 WARN L242 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2021-06-05 03:09:39,424 INFO L510 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2021-06-05 03:09:39,458 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-05 03:09:39,458 INFO L255 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-06-05 03:09:39,459 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-05 03:09:39,460 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-05 03:09:39,460 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-05 03:09:39,460 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-05 03:09:39,460 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-05 03:09:39,460 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-05 03:09:39,460 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-05 03:09:39,460 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-05 03:09:39,461 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 21 places, 14 transitions, 49 flow [2021-06-05 03:09:39,480 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 188 states, 179 states have (on average 2.7206703910614527) internal successors, (487), 187 states have internal predecessors, (487), 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 03:09:39,481 INFO L276 IsEmpty]: Start isEmpty. Operand has 188 states, 179 states have (on average 2.7206703910614527) internal successors, (487), 187 states have internal predecessors, (487), 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 03:09:39,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2021-06-05 03:09:39,482 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 03:09:39,482 INFO L521 BasicCegarLoop]: trace histogram [1, 1] [2021-06-05 03:09:39,482 INFO L430 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 03:09:39,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 03:09:39,482 INFO L82 PathProgramCache]: Analyzing trace with hash 2115, now seen corresponding path program 1 times [2021-06-05 03:09:39,483 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 03:09:39,483 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417843506] [2021-06-05 03:09:39,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 03:09:39,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 03:09:39,493 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 03:09:39,493 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 03:09:39,493 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417843506] [2021-06-05 03:09:39,493 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417843506] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 03:09:39,493 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 03:09:39,493 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-05 03:09:39,494 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566656033] [2021-06-05 03:09:39,494 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-05 03:09:39,494 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 03:09:39,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-05 03:09:39,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 03:09:39,496 INFO L87 Difference]: Start difference. First operand has 188 states, 179 states have (on average 2.7206703910614527) internal successors, (487), 187 states have internal predecessors, (487), 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, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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 03:09:39,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 03:09:39,513 INFO L93 Difference]: Finished difference Result 148 states and 379 transitions. [2021-06-05 03:09:39,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-05 03:09:39,514 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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 2 [2021-06-05 03:09:39,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 03:09:39,517 INFO L225 Difference]: With dead ends: 148 [2021-06-05 03:09:39,517 INFO L226 Difference]: Without dead ends: 68 [2021-06-05 03:09:39,518 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 03:09:39,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2021-06-05 03:09:39,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2021-06-05 03:09:39,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 67 states have (on average 2.4328358208955225) internal successors, (163), 67 states have internal predecessors, (163), 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 03:09:39,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 163 transitions. [2021-06-05 03:09:39,533 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 163 transitions. Word has length 2 [2021-06-05 03:09:39,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 03:09:39,533 INFO L482 AbstractCegarLoop]: Abstraction has 68 states and 163 transitions. [2021-06-05 03:09:39,534 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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 03:09:39,534 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 163 transitions. [2021-06-05 03:09:39,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-06-05 03:09:39,534 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 03:09:39,534 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-06-05 03:09:39,534 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-06-05 03:09:39,534 INFO L430 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 03:09:39,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 03:09:39,535 INFO L82 PathProgramCache]: Analyzing trace with hash 63416129, now seen corresponding path program 1 times [2021-06-05 03:09:39,535 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 03:09:39,535 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077327450] [2021-06-05 03:09:39,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 03:09:39,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-05 03:09:39,539 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-05 03:09:39,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-05 03:09:39,541 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-05 03:09:39,542 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-05 03:09:39,542 INFO L622 BasicCegarLoop]: Counterexample might be feasible [2021-06-05 03:09:39,542 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-06-05 03:09:39,543 WARN L242 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2021-06-05 03:09:39,543 INFO L510 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2021-06-05 03:09:39,551 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-05 03:09:39,552 INFO L255 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-06-05 03:09:39,553 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-05 03:09:39,553 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-05 03:09:39,553 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-05 03:09:39,553 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-05 03:09:39,553 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-05 03:09:39,553 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-05 03:09:39,553 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-05 03:09:39,554 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-05 03:09:39,554 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 26 places, 17 transitions, 66 flow [2021-06-05 03:09:39,585 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 566 states, 555 states have (on average 3.30990990990991) internal successors, (1837), 565 states have internal predecessors, (1837), 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 03:09:39,587 INFO L276 IsEmpty]: Start isEmpty. Operand has 566 states, 555 states have (on average 3.30990990990991) internal successors, (1837), 565 states have internal predecessors, (1837), 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 03:09:39,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2021-06-05 03:09:39,587 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 03:09:39,587 INFO L521 BasicCegarLoop]: trace histogram [1, 1] [2021-06-05 03:09:39,587 INFO L430 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 03:09:39,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 03:09:39,588 INFO L82 PathProgramCache]: Analyzing trace with hash 2659, now seen corresponding path program 1 times [2021-06-05 03:09:39,588 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 03:09:39,588 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599558228] [2021-06-05 03:09:39,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 03:09:39,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 03:09:39,598 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 03:09:39,598 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 03:09:39,599 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599558228] [2021-06-05 03:09:39,599 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599558228] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 03:09:39,599 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 03:09:39,599 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-05 03:09:39,599 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403620978] [2021-06-05 03:09:39,599 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-05 03:09:39,600 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 03:09:39,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-05 03:09:39,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 03:09:39,602 INFO L87 Difference]: Start difference. First operand has 566 states, 555 states have (on average 3.30990990990991) internal successors, (1837), 565 states have internal predecessors, (1837), 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, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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 03:09:39,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 03:09:39,636 INFO L93 Difference]: Finished difference Result 445 states and 1432 transitions. [2021-06-05 03:09:39,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-05 03:09:39,638 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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 2 [2021-06-05 03:09:39,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 03:09:39,642 INFO L225 Difference]: With dead ends: 445 [2021-06-05 03:09:39,643 INFO L226 Difference]: Without dead ends: 203 [2021-06-05 03:09:39,643 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 03:09:39,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2021-06-05 03:09:39,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2021-06-05 03:09:39,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 202 states have (on average 3.0792079207920793) internal successors, (622), 202 states have internal predecessors, (622), 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 03:09:39,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 622 transitions. [2021-06-05 03:09:39,665 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 622 transitions. Word has length 2 [2021-06-05 03:09:39,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 03:09:39,665 INFO L482 AbstractCegarLoop]: Abstraction has 203 states and 622 transitions. [2021-06-05 03:09:39,666 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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 03:09:39,666 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 622 transitions. [2021-06-05 03:09:39,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-06-05 03:09:39,666 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 03:09:39,667 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-06-05 03:09:39,667 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-06-05 03:09:39,667 INFO L430 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 03:09:39,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 03:09:39,667 INFO L82 PathProgramCache]: Analyzing trace with hash -1824239762, now seen corresponding path program 1 times [2021-06-05 03:09:39,668 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 03:09:39,668 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510707443] [2021-06-05 03:09:39,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 03:09:39,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-05 03:09:39,676 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-05 03:09:39,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-05 03:09:39,678 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-05 03:09:39,680 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-05 03:09:39,680 INFO L622 BasicCegarLoop]: Counterexample might be feasible [2021-06-05 03:09:39,681 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-06-05 03:09:39,681 WARN L242 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2021-06-05 03:09:39,681 INFO L510 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2021-06-05 03:09:39,691 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-05 03:09:39,692 INFO L255 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-06-05 03:09:39,693 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-05 03:09:39,693 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-05 03:09:39,693 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-05 03:09:39,693 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-05 03:09:39,693 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-05 03:09:39,693 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-05 03:09:39,693 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-05 03:09:39,693 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-05 03:09:39,694 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 31 places, 20 transitions, 85 flow [2021-06-05 03:09:39,813 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1700 states, 1687 states have (on average 3.9377593360995853) internal successors, (6643), 1699 states have internal predecessors, (6643), 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 03:09:39,819 INFO L276 IsEmpty]: Start isEmpty. Operand has 1700 states, 1687 states have (on average 3.9377593360995853) internal successors, (6643), 1699 states have internal predecessors, (6643), 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 03:09:39,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2021-06-05 03:09:39,820 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 03:09:39,820 INFO L521 BasicCegarLoop]: trace histogram [1, 1] [2021-06-05 03:09:39,820 INFO L430 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 03:09:39,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 03:09:39,821 INFO L82 PathProgramCache]: Analyzing trace with hash 3299, now seen corresponding path program 1 times [2021-06-05 03:09:39,821 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 03:09:39,821 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184358280] [2021-06-05 03:09:39,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 03:09:39,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 03:09:39,851 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 03:09:39,851 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 03:09:39,851 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184358280] [2021-06-05 03:09:39,851 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184358280] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 03:09:39,852 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 03:09:39,852 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-05 03:09:39,852 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933405506] [2021-06-05 03:09:39,852 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-05 03:09:39,852 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 03:09:39,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-05 03:09:39,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 03:09:39,858 INFO L87 Difference]: Start difference. First operand has 1700 states, 1687 states have (on average 3.9377593360995853) internal successors, (6643), 1699 states have internal predecessors, (6643), 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, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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 03:09:39,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 03:09:39,923 INFO L93 Difference]: Finished difference Result 1336 states and 5185 transitions. [2021-06-05 03:09:39,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-05 03:09:39,926 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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 2 [2021-06-05 03:09:39,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 03:09:39,941 INFO L225 Difference]: With dead ends: 1336 [2021-06-05 03:09:39,942 INFO L226 Difference]: Without dead ends: 608 [2021-06-05 03:09:39,942 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.3ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 03:09:39,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2021-06-05 03:09:39,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 608. [2021-06-05 03:09:39,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 608 states, 607 states have (on average 3.7380560131795715) internal successors, (2269), 607 states have internal predecessors, (2269), 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 03:09:40,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 2269 transitions. [2021-06-05 03:09:40,003 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 2269 transitions. Word has length 2 [2021-06-05 03:09:40,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 03:09:40,004 INFO L482 AbstractCegarLoop]: Abstraction has 608 states and 2269 transitions. [2021-06-05 03:09:40,004 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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 03:09:40,004 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 2269 transitions. [2021-06-05 03:09:40,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-06-05 03:09:40,006 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 03:09:40,006 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-06-05 03:09:40,006 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-06-05 03:09:40,006 INFO L430 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 03:09:40,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 03:09:40,007 INFO L82 PathProgramCache]: Analyzing trace with hash 504182917, now seen corresponding path program 1 times [2021-06-05 03:09:40,007 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 03:09:40,007 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218604179] [2021-06-05 03:09:40,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 03:09:40,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-05 03:09:40,020 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-05 03:09:40,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-05 03:09:40,030 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-05 03:09:40,032 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-05 03:09:40,032 INFO L622 BasicCegarLoop]: Counterexample might be feasible [2021-06-05 03:09:40,032 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-06-05 03:09:40,032 WARN L242 ceAbstractionStarter]: 5 thread instances were not sufficient, I will increase this number and restart the analysis [2021-06-05 03:09:40,032 INFO L510 ceAbstractionStarter]: Constructing petrified ICFG for 6 thread instances. [2021-06-05 03:09:40,053 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-05 03:09:40,054 INFO L255 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-06-05 03:09:40,055 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-05 03:09:40,055 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-05 03:09:40,055 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-05 03:09:40,055 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-05 03:09:40,055 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-05 03:09:40,056 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-05 03:09:40,056 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-05 03:09:40,056 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-05 03:09:40,059 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 36 places, 23 transitions, 106 flow [2021-06-05 03:09:40,404 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 5102 states, 5087 states have (on average 4.586003538431296) internal successors, (23329), 5101 states have internal predecessors, (23329), 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 03:09:40,422 INFO L276 IsEmpty]: Start isEmpty. Operand has 5102 states, 5087 states have (on average 4.586003538431296) internal successors, (23329), 5101 states have internal predecessors, (23329), 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 03:09:40,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2021-06-05 03:09:40,423 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 03:09:40,423 INFO L521 BasicCegarLoop]: trace histogram [1, 1] [2021-06-05 03:09:40,423 INFO L430 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 03:09:40,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 03:09:40,424 INFO L82 PathProgramCache]: Analyzing trace with hash 4035, now seen corresponding path program 1 times [2021-06-05 03:09:40,424 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 03:09:40,425 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442968766] [2021-06-05 03:09:40,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 03:09:40,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 03:09:40,450 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 03:09:40,450 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 03:09:40,451 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442968766] [2021-06-05 03:09:40,451 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442968766] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 03:09:40,451 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 03:09:40,451 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-05 03:09:40,453 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914083656] [2021-06-05 03:09:40,453 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-05 03:09:40,453 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 03:09:40,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-05 03:09:40,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 03:09:40,471 INFO L87 Difference]: Start difference. First operand has 5102 states, 5087 states have (on average 4.586003538431296) internal successors, (23329), 5101 states have internal predecessors, (23329), 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, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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 03:09:40,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 03:09:40,536 INFO L93 Difference]: Finished difference Result 4009 states and 18226 transitions. [2021-06-05 03:09:40,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-05 03:09:40,537 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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 2 [2021-06-05 03:09:40,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 03:09:40,553 INFO L225 Difference]: With dead ends: 4009 [2021-06-05 03:09:40,554 INFO L226 Difference]: Without dead ends: 1823 [2021-06-05 03:09:40,556 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.8ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 03:09:40,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1823 states. [2021-06-05 03:09:40,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1823 to 1823. [2021-06-05 03:09:40,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1823 states, 1822 states have (on average 4.401756311745335) internal successors, (8020), 1822 states have internal predecessors, (8020), 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 03:09:40,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1823 states to 1823 states and 8020 transitions. [2021-06-05 03:09:40,706 INFO L78 Accepts]: Start accepts. Automaton has 1823 states and 8020 transitions. Word has length 2 [2021-06-05 03:09:40,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 03:09:40,706 INFO L482 AbstractCegarLoop]: Abstraction has 1823 states and 8020 transitions. [2021-06-05 03:09:40,706 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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 03:09:40,706 INFO L276 IsEmpty]: Start isEmpty. Operand 1823 states and 8020 transitions. [2021-06-05 03:09:40,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-06-05 03:09:40,707 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 03:09:40,707 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 03:09:40,707 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-06-05 03:09:40,708 INFO L430 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 03:09:40,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 03:09:40,708 INFO L82 PathProgramCache]: Analyzing trace with hash 1332075505, now seen corresponding path program 1 times [2021-06-05 03:09:40,708 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 03:09:40,710 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939045603] [2021-06-05 03:09:40,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 03:09:40,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-05 03:09:40,719 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-05 03:09:40,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-05 03:09:40,721 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-05 03:09:40,722 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-05 03:09:40,722 INFO L622 BasicCegarLoop]: Counterexample might be feasible [2021-06-05 03:09:40,723 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-06-05 03:09:40,723 WARN L242 ceAbstractionStarter]: 6 thread instances were not sufficient, I will increase this number and restart the analysis [2021-06-05 03:09:40,723 INFO L510 ceAbstractionStarter]: Constructing petrified ICFG for 7 thread instances. [2021-06-05 03:09:40,737 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-05 03:09:40,737 INFO L255 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-06-05 03:09:40,739 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-05 03:09:40,740 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-05 03:09:40,740 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-05 03:09:40,740 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-05 03:09:40,740 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-05 03:09:40,740 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-05 03:09:40,740 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-05 03:09:40,740 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-05 03:09:40,742 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 41 places, 26 transitions, 129 flow [2021-06-05 03:09:42,185 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 15308 states, 15291 states have (on average 5.244326728140736) internal successors, (80191), 15307 states have internal predecessors, (80191), 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 03:09:42,217 INFO L276 IsEmpty]: Start isEmpty. Operand has 15308 states, 15291 states have (on average 5.244326728140736) internal successors, (80191), 15307 states have internal predecessors, (80191), 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 03:09:42,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2021-06-05 03:09:42,217 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 03:09:42,217 INFO L521 BasicCegarLoop]: trace histogram [1, 1] [2021-06-05 03:09:42,218 INFO L430 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 03:09:42,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 03:09:42,218 INFO L82 PathProgramCache]: Analyzing trace with hash 4867, now seen corresponding path program 1 times [2021-06-05 03:09:42,219 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 03:09:42,219 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688268636] [2021-06-05 03:09:42,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 03:09:42,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 03:09:42,227 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 03:09:42,227 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 03:09:42,227 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688268636] [2021-06-05 03:09:42,227 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688268636] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 03:09:42,228 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 03:09:42,228 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-05 03:09:42,228 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721148947] [2021-06-05 03:09:42,228 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-05 03:09:42,228 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 03:09:42,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-05 03:09:42,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 03:09:42,260 INFO L87 Difference]: Start difference. First operand has 15308 states, 15291 states have (on average 5.244326728140736) internal successors, (80191), 15307 states have internal predecessors, (80191), 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, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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 03:09:42,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 03:09:42,555 INFO L93 Difference]: Finished difference Result 12028 states and 62695 transitions. [2021-06-05 03:09:42,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-05 03:09:42,557 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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 2 [2021-06-05 03:09:42,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 03:09:42,624 INFO L225 Difference]: With dead ends: 12028 [2021-06-05 03:09:42,624 INFO L226 Difference]: Without dead ends: 5468 [2021-06-05 03:09:42,624 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-05 03:09:42,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5468 states. [2021-06-05 03:09:43,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5468 to 5468. [2021-06-05 03:09:43,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5468 states, 5467 states have (on average 5.06731296872142) internal successors, (27703), 5467 states have internal predecessors, (27703), 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 03:09:43,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5468 states to 5468 states and 27703 transitions. [2021-06-05 03:09:43,119 INFO L78 Accepts]: Start accepts. Automaton has 5468 states and 27703 transitions. Word has length 2 [2021-06-05 03:09:43,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 03:09:43,119 INFO L482 AbstractCegarLoop]: Abstraction has 5468 states and 27703 transitions. [2021-06-05 03:09:43,119 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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 03:09:43,119 INFO L276 IsEmpty]: Start isEmpty. Operand 5468 states and 27703 transitions. [2021-06-05 03:09:43,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-06-05 03:09:43,125 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 03:09:43,126 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 03:09:43,126 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-06-05 03:09:43,126 INFO L430 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 03:09:43,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 03:09:43,126 INFO L82 PathProgramCache]: Analyzing trace with hash 58177429, now seen corresponding path program 1 times [2021-06-05 03:09:43,126 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 03:09:43,127 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607297363] [2021-06-05 03:09:43,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 03:09:43,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-05 03:09:43,136 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-05 03:09:43,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-05 03:09:43,141 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-05 03:09:43,146 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-05 03:09:43,146 INFO L622 BasicCegarLoop]: Counterexample might be feasible [2021-06-05 03:09:43,146 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-06-05 03:09:43,146 WARN L242 ceAbstractionStarter]: 7 thread instances were not sufficient, I will increase this number and restart the analysis [2021-06-05 03:09:43,146 INFO L510 ceAbstractionStarter]: Constructing petrified ICFG for 8 thread instances. [2021-06-05 03:09:43,173 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-05 03:09:43,174 INFO L255 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-06-05 03:09:43,174 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-05 03:09:43,174 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-05 03:09:43,174 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-05 03:09:43,174 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-05 03:09:43,174 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-05 03:09:43,175 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-05 03:09:43,175 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-05 03:09:43,175 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-05 03:09:43,175 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 46 places, 29 transitions, 154 flow [2021-06-05 03:09:55,852 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 45926 states, 45907 states have (on average 5.907356176617945) internal successors, (271189), 45925 states have internal predecessors, (271189), 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 03:09:55,972 INFO L276 IsEmpty]: Start isEmpty. Operand has 45926 states, 45907 states have (on average 5.907356176617945) internal successors, (271189), 45925 states have internal predecessors, (271189), 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 03:09:55,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2021-06-05 03:09:55,973 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 03:09:55,973 INFO L521 BasicCegarLoop]: trace histogram [1, 1] [2021-06-05 03:09:55,973 INFO L430 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 03:09:55,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 03:09:55,974 INFO L82 PathProgramCache]: Analyzing trace with hash 5795, now seen corresponding path program 1 times [2021-06-05 03:09:55,974 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 03:09:55,974 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169272264] [2021-06-05 03:09:55,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 03:09:55,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 03:09:55,983 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 03:09:55,983 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 03:09:55,984 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169272264] [2021-06-05 03:09:55,984 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169272264] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 03:09:55,984 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 03:09:55,984 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-05 03:09:55,984 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540510073] [2021-06-05 03:09:55,984 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-05 03:09:55,984 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 03:09:55,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-05 03:09:55,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 03:09:56,062 INFO L87 Difference]: Start difference. First operand has 45926 states, 45907 states have (on average 5.907356176617945) internal successors, (271189), 45925 states have internal predecessors, (271189), 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, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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 03:09:56,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 03:09:56,497 INFO L93 Difference]: Finished difference Result 36085 states and 212140 transitions. [2021-06-05 03:09:56,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-05 03:09:56,498 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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 2 [2021-06-05 03:09:56,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 03:09:56,951 INFO L225 Difference]: With dead ends: 36085 [2021-06-05 03:09:56,952 INFO L226 Difference]: Without dead ends: 16403 [2021-06-05 03:09:56,953 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 03:09:57,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16403 states. [2021-06-05 03:09:58,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16403 to 16403. [2021-06-05 03:09:58,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16403 states, 16402 states have (on average 5.733569076941836) internal successors, (94042), 16402 states have internal predecessors, (94042), 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 03:09:58,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16403 states to 16403 states and 94042 transitions. [2021-06-05 03:09:58,546 INFO L78 Accepts]: Start accepts. Automaton has 16403 states and 94042 transitions. Word has length 2 [2021-06-05 03:09:58,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 03:09:58,546 INFO L482 AbstractCegarLoop]: Abstraction has 16403 states and 94042 transitions. [2021-06-05 03:09:58,546 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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 03:09:58,546 INFO L276 IsEmpty]: Start isEmpty. Operand 16403 states and 94042 transitions. [2021-06-05 03:09:58,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-06-05 03:09:58,548 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 03:09:58,548 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 03:09:58,548 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-06-05 03:09:58,548 INFO L430 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 03:09:58,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 03:09:58,549 INFO L82 PathProgramCache]: Analyzing trace with hash 1055505844, now seen corresponding path program 1 times [2021-06-05 03:09:58,549 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 03:09:58,549 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584323539] [2021-06-05 03:09:58,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 03:09:58,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-05 03:09:58,553 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-05 03:09:58,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-05 03:09:58,555 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-05 03:09:58,557 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-05 03:09:58,557 INFO L622 BasicCegarLoop]: Counterexample might be feasible [2021-06-05 03:09:58,557 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-06-05 03:09:58,557 WARN L242 ceAbstractionStarter]: 8 thread instances were not sufficient, I will increase this number and restart the analysis [2021-06-05 03:09:58,557 INFO L510 ceAbstractionStarter]: Constructing petrified ICFG for 9 thread instances. [2021-06-05 03:09:58,569 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-05 03:09:58,569 INFO L255 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-06-05 03:09:58,570 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-05 03:09:58,570 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-05 03:09:58,570 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-05 03:09:58,570 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-05 03:09:58,570 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-05 03:09:58,570 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-05 03:09:58,570 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-05 03:09:58,570 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-05 03:09:58,571 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 51 places, 32 transitions, 181 flow [2021-06-05 03:11:43,191 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 137780 states, 137759 states have (on average 6.5724852822683095) internal successors, (905419), 137779 states have internal predecessors, (905419), 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 03:11:43,438 INFO L276 IsEmpty]: Start isEmpty. Operand has 137780 states, 137759 states have (on average 6.5724852822683095) internal successors, (905419), 137779 states have internal predecessors, (905419), 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 03:11:43,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2021-06-05 03:11:43,438 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 03:11:43,438 INFO L521 BasicCegarLoop]: trace histogram [1, 1] [2021-06-05 03:11:43,438 INFO L430 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 03:11:43,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 03:11:43,439 INFO L82 PathProgramCache]: Analyzing trace with hash 6819, now seen corresponding path program 1 times [2021-06-05 03:11:43,439 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 03:11:43,439 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954547872] [2021-06-05 03:11:43,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 03:11:43,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 03:11:43,446 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 03:11:43,447 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 03:11:43,447 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954547872] [2021-06-05 03:11:43,447 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954547872] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 03:11:43,447 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 03:11:43,447 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-05 03:11:43,447 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171664742] [2021-06-05 03:11:43,447 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-05 03:11:43,447 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 03:11:43,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-05 03:11:43,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 03:11:43,629 INFO L87 Difference]: Start difference. First operand has 137780 states, 137759 states have (on average 6.5724852822683095) internal successors, (905419), 137779 states have internal predecessors, (905419), 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, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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 03:11:45,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 03:11:45,242 INFO L93 Difference]: Finished difference Result 108256 states and 708589 transitions. [2021-06-05 03:11:45,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-05 03:11:45,242 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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 2 [2021-06-05 03:11:45,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 03:11:46,093 INFO L225 Difference]: With dead ends: 108256 [2021-06-05 03:11:46,093 INFO L226 Difference]: Without dead ends: 49208 [2021-06-05 03:11:46,095 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 03:11:53,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49208 states. [2021-06-05 03:11:54,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49208 to 49208. [2021-06-05 03:11:54,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49208 states, 49207 states have (on average 6.400085353709838) internal successors, (314929), 49207 states have internal predecessors, (314929), 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 03:11:55,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49208 states to 49208 states and 314929 transitions. [2021-06-05 03:11:55,077 INFO L78 Accepts]: Start accepts. Automaton has 49208 states and 314929 transitions. Word has length 2 [2021-06-05 03:11:55,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 03:11:55,077 INFO L482 AbstractCegarLoop]: Abstraction has 49208 states and 314929 transitions. [2021-06-05 03:11:55,077 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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 03:11:55,077 INFO L276 IsEmpty]: Start isEmpty. Operand 49208 states and 314929 transitions. [2021-06-05 03:11:55,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-06-05 03:11:55,079 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 03:11:55,079 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 03:11:55,079 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-06-05 03:11:55,079 INFO L430 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 03:11:55,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 03:11:55,080 INFO L82 PathProgramCache]: Analyzing trace with hash 1814808561, now seen corresponding path program 1 times [2021-06-05 03:11:55,080 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 03:11:55,080 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637056118] [2021-06-05 03:11:55,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 03:11:55,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-05 03:11:55,084 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-05 03:11:55,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-05 03:11:55,086 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-05 03:11:55,088 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-05 03:11:55,088 INFO L622 BasicCegarLoop]: Counterexample might be feasible [2021-06-05 03:11:55,088 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-06-05 03:11:55,088 WARN L242 ceAbstractionStarter]: 9 thread instances were not sufficient, I will increase this number and restart the analysis [2021-06-05 03:11:55,088 INFO L510 ceAbstractionStarter]: Constructing petrified ICFG for 10 thread instances. [2021-06-05 03:11:55,101 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-05 03:11:55,101 INFO L255 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-06-05 03:11:55,102 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-05 03:11:55,102 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-05 03:11:55,102 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-05 03:11:55,102 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-05 03:11:55,102 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-05 03:11:55,103 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-05 03:11:55,103 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-05 03:11:55,103 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-05 03:11:55,104 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 56 places, 35 transitions, 210 flow Received shutdown request... [2021-06-05 03:24:07,802 WARN L547 AbstractCegarLoop]: Verification canceled [2021-06-05 03:24:07,803 INFO L246 ceAbstractionStarter]: Analysis of concurrent program completed with 10 thread instances [2021-06-05 03:24:07,806 WARN L196 ceAbstractionStarter]: Timeout [2021-06-05 03:24:07,806 INFO L202 PluginConnector]: Adding new model fork_loop_inc.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.06 03:24:07 BasicIcfg [2021-06-05 03:24:07,806 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-06-05 03:24:07,807 INFO L168 Benchmark]: Toolchain (without parser) took 869093.96 ms. Allocated memory was 375.4 MB in the beginning and 9.7 GB in the end (delta: 9.3 GB). Free memory was 354.9 MB in the beginning and 5.9 GB in the end (delta: -5.5 GB). Peak memory consumption was 5.4 GB. Max. memory is 16.0 GB. [2021-06-05 03:24:07,808 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.16 ms. Allocated memory is still 375.4 MB. Free memory was 355.8 MB in the beginning and 355.7 MB in the end (delta: 70.3 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-06-05 03:24:07,808 INFO L168 Benchmark]: Boogie Procedure Inliner took 27.48 ms. Allocated memory is still 375.4 MB. Free memory was 354.7 MB in the beginning and 353.3 MB in the end (delta: 1.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-06-05 03:24:07,809 INFO L168 Benchmark]: Boogie Preprocessor took 14.89 ms. Allocated memory is still 375.4 MB. Free memory was 353.3 MB in the beginning and 352.4 MB in the end (delta: 919.1 kB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-06-05 03:24:07,809 INFO L168 Benchmark]: RCFGBuilder took 183.34 ms. Allocated memory is still 375.4 MB. Free memory was 352.3 MB in the beginning and 344.0 MB in the end (delta: 8.3 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.0 GB. [2021-06-05 03:24:07,810 INFO L168 Benchmark]: TraceAbstraction took 868862.53 ms. Allocated memory was 375.4 MB in the beginning and 9.7 GB in the end (delta: 9.3 GB). Free memory was 343.6 MB in the beginning and 5.9 GB in the end (delta: -5.6 GB). Peak memory consumption was 5.4 GB. Max. memory is 16.0 GB. [2021-06-05 03:24:07,811 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.16 ms. Allocated memory is still 375.4 MB. Free memory was 355.8 MB in the beginning and 355.7 MB in the end (delta: 70.3 kB). There was no memory consumed. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 27.48 ms. Allocated memory is still 375.4 MB. Free memory was 354.7 MB in the beginning and 353.3 MB in the end (delta: 1.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 14.89 ms. Allocated memory is still 375.4 MB. Free memory was 353.3 MB in the beginning and 352.4 MB in the end (delta: 919.1 kB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 183.34 ms. Allocated memory is still 375.4 MB. Free memory was 352.3 MB in the beginning and 344.0 MB in the end (delta: 8.3 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.0 GB. * TraceAbstraction took 868862.53 ms. Allocated memory was 375.4 MB in the beginning and 9.7 GB in the end (delta: 9.3 GB). Free memory was 343.6 MB in the beginning and 5.9 GB in the end (delta: -5.6 GB). Peak memory consumption was 5.4 GB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 26]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was constructing initial abstraction,while PetriNet2FiniteAutomaton was constructing automaton for Petri net that has has 56 places, 35 transitions, 210 flow. Already constructed 370405 states. Currently 34307 states in worklist.. - TimeoutResultAtElement [Line: 30]: Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while BasicCegarLoop was constructing initial abstraction,while PetriNet2FiniteAutomaton was constructing automaton for Petri net that has has 56 places, 35 transitions, 210 flow. Already constructed 370405 states. Currently 34307 states in worklist.. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 12 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 271.1ms, OverallIterations: 2, TraceHistogramMax: 1, EmptinessCheckTime: 6.3ms, AutomataDifference: 43.3ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 16.7ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 5 SDtfs, 5 SDslu, 0 SDs, 0 SdLazy, 2 SolverSat, 1 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.7ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.8ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=20occurred in iteration=0, InterpolantAutomatonStates: 3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 13.3ms AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 19.7ms SsaConstructionTime, 17.3ms SatisfiabilityAnalysisTime, 42.8ms InterpolantComputationTime, 5 NumberOfCodeBlocks, 5 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 1 ConstructedInterpolants, 0 QuantifiedInterpolants, 3 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 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 - StatisticsResult: Ultimate Automizer benchmark data with 2 thread instances CFG has 4 procedures, 15 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 83.6ms, OverallIterations: 2, TraceHistogramMax: 1, EmptinessCheckTime: 0.9ms, AutomataDifference: 43.7ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 9.9ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 7 SDtfs, 7 SDslu, 0 SDs, 0 SdLazy, 3 SolverSat, 2 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 18.5ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.2ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=62occurred in iteration=0, InterpolantAutomatonStates: 3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 3.6ms AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.6ms SsaConstructionTime, 2.1ms SatisfiabilityAnalysisTime, 10.1ms InterpolantComputationTime, 6 NumberOfCodeBlocks, 6 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 1 ConstructedInterpolants, 0 QuantifiedInterpolants, 3 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 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 - StatisticsResult: Ultimate Automizer benchmark data with 3 thread instances CFG has 5 procedures, 18 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 83.1ms, OverallIterations: 2, TraceHistogramMax: 1, EmptinessCheckTime: 1.8ms, AutomataDifference: 23.2ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 19.8ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 9 SDtfs, 9 SDslu, 0 SDs, 0 SdLazy, 4 SolverSat, 3 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.3ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=188occurred in iteration=0, InterpolantAutomatonStates: 3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 15.4ms AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.8ms SsaConstructionTime, 2.2ms SatisfiabilityAnalysisTime, 6.4ms InterpolantComputationTime, 7 NumberOfCodeBlocks, 7 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 1 ConstructedInterpolants, 0 QuantifiedInterpolants, 3 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 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 - StatisticsResult: Ultimate Automizer benchmark data with 4 thread instances CFG has 6 procedures, 21 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 127.8ms, OverallIterations: 2, TraceHistogramMax: 1, EmptinessCheckTime: 2.1ms, AutomataDifference: 43.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 31.9ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 11 SDtfs, 11 SDslu, 0 SDs, 0 SdLazy, 5 SolverSat, 4 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.0ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=566occurred in iteration=0, InterpolantAutomatonStates: 3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 22.1ms AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.9ms SsaConstructionTime, 2.8ms SatisfiabilityAnalysisTime, 6.2ms InterpolantComputationTime, 8 NumberOfCodeBlocks, 8 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 1 ConstructedInterpolants, 0 QuantifiedInterpolants, 3 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 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 - StatisticsResult: Ultimate Automizer benchmark data with 5 thread instances CFG has 7 procedures, 24 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 339.7ms, OverallIterations: 2, TraceHistogramMax: 1, EmptinessCheckTime: 7.4ms, AutomataDifference: 89.6ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 120.3ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 13 SDtfs, 13 SDslu, 0 SDs, 0 SdLazy, 6 SolverSat, 5 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 23.7ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.3ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=1700occurred in iteration=0, InterpolantAutomatonStates: 3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 61.1ms AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 4.4ms SsaConstructionTime, 10.8ms SatisfiabilityAnalysisTime, 18.7ms InterpolantComputationTime, 9 NumberOfCodeBlocks, 9 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 1 ConstructedInterpolants, 0 QuantifiedInterpolants, 3 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 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 - StatisticsResult: Ultimate Automizer benchmark data with 6 thread instances CFG has 8 procedures, 27 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 667.8ms, OverallIterations: 2, TraceHistogramMax: 1, EmptinessCheckTime: 19.5ms, AutomataDifference: 100.8ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 348.5ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 15 SDtfs, 15 SDslu, 0 SDs, 0 SdLazy, 7 SolverSat, 6 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.8ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.8ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=5102occurred in iteration=0, InterpolantAutomatonStates: 3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 149.7ms AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 3.4ms SsaConstructionTime, 5.6ms SatisfiabilityAnalysisTime, 19.3ms InterpolantComputationTime, 10 NumberOfCodeBlocks, 10 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 1 ConstructedInterpolants, 0 QuantifiedInterpolants, 3 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 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 - StatisticsResult: Ultimate Automizer benchmark data with 7 thread instances CFG has 9 procedures, 30 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 2407.5ms, OverallIterations: 2, TraceHistogramMax: 1, EmptinessCheckTime: 37.9ms, AutomataDifference: 395.8ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 1445.1ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 17 SDtfs, 17 SDslu, 0 SDs, 0 SdLazy, 8 SolverSat, 7 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.7ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=15308occurred in iteration=0, InterpolantAutomatonStates: 3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 494.4ms AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 2.1ms SsaConstructionTime, 6.7ms SatisfiabilityAnalysisTime, 4.9ms InterpolantComputationTime, 11 NumberOfCodeBlocks, 11 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 1 ConstructedInterpolants, 0 QuantifiedInterpolants, 3 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 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 - StatisticsResult: Ultimate Automizer benchmark data with 8 thread instances CFG has 10 procedures, 33 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 15382.9ms, OverallIterations: 2, TraceHistogramMax: 1, EmptinessCheckTime: 121.3ms, AutomataDifference: 967.4ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 12677.8ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 19 SDtfs, 19 SDslu, 0 SDs, 0 SdLazy, 9 SolverSat, 8 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 16.8ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=45926occurred in iteration=0, InterpolantAutomatonStates: 3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 1593.0ms AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5ms SsaConstructionTime, 2.6ms SatisfiabilityAnalysisTime, 6.4ms InterpolantComputationTime, 12 NumberOfCodeBlocks, 12 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 1 ConstructedInterpolants, 0 QuantifiedInterpolants, 3 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 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 - StatisticsResult: Ultimate Automizer benchmark data with 9 thread instances CFG has 11 procedures, 36 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 116518.0ms, OverallIterations: 2, TraceHistogramMax: 1, EmptinessCheckTime: 236.2ms, AutomataDifference: 2646.3ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 104632.8ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 21 SDtfs, 21 SDslu, 0 SDs, 0 SdLazy, 10 SolverSat, 9 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 22.0ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=137780occurred in iteration=0, InterpolantAutomatonStates: 3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 8981.7ms AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.6ms SsaConstructionTime, 2.5ms SatisfiabilityAnalysisTime, 4.8ms InterpolantComputationTime, 13 NumberOfCodeBlocks, 13 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 1 ConstructedInterpolants, 0 QuantifiedInterpolants, 3 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 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 - StatisticsResult: Ultimate Automizer benchmark data with 10 thread instances CFG has 12 procedures, 39 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: TIMEOUT, OverallTime: 732699.9ms, OverallIterations: 0, TraceHistogramMax: 0, EmptinessCheckTime: 0.0ms, AutomataDifference: 0.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 732699.0ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, 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 RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown