/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_unsafe2.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-29289db [2021-06-05 03:13:51,233 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-06-05 03:13:51,236 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-06-05 03:13:51,278 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-06-05 03:13:51,278 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-06-05 03:13:51,281 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-06-05 03:13:51,283 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-06-05 03:13:51,288 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-06-05 03:13:51,290 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-06-05 03:13:51,296 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-06-05 03:13:51,296 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-06-05 03:13:51,298 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-06-05 03:13:51,298 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-06-05 03:13:51,300 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-06-05 03:13:51,301 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-06-05 03:13:51,302 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-06-05 03:13:51,305 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-06-05 03:13:51,306 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-06-05 03:13:51,309 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-06-05 03:13:51,315 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-06-05 03:13:51,316 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-06-05 03:13:51,318 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-06-05 03:13:51,318 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-06-05 03:13:51,320 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-06-05 03:13:51,326 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-06-05 03:13:51,326 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-06-05 03:13:51,327 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-06-05 03:13:51,328 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-06-05 03:13:51,328 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-06-05 03:13:51,329 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-06-05 03:13:51,329 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-06-05 03:13:51,330 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-06-05 03:13:51,331 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-06-05 03:13:51,332 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-06-05 03:13:51,333 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-06-05 03:13:51,333 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-06-05 03:13:51,333 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-06-05 03:13:51,333 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-06-05 03:13:51,334 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-06-05 03:13:51,334 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-06-05 03:13:51,335 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-06-05 03:13:51,338 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:13:51,371 INFO L113 SettingsManager]: Loading preferences was successful [2021-06-05 03:13:51,371 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-06-05 03:13:51,372 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-06-05 03:13:51,372 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-06-05 03:13:51,374 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-06-05 03:13:51,374 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-06-05 03:13:51,374 INFO L138 SettingsManager]: * Use SBE=true [2021-06-05 03:13:51,375 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-06-05 03:13:51,375 INFO L138 SettingsManager]: * sizeof long=4 [2021-06-05 03:13:51,375 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-06-05 03:13:51,375 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-06-05 03:13:51,376 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-06-05 03:13:51,376 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-06-05 03:13:51,376 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-06-05 03:13:51,376 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-06-05 03:13:51,376 INFO L138 SettingsManager]: * sizeof long double=12 [2021-06-05 03:13:51,376 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-06-05 03:13:51,376 INFO L138 SettingsManager]: * Use constant arrays=true [2021-06-05 03:13:51,376 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-06-05 03:13:51,377 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-06-05 03:13:51,377 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-06-05 03:13:51,377 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-06-05 03:13:51,377 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-06-05 03:13:51,377 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-05 03:13:51,377 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-06-05 03:13:51,377 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-06-05 03:13:51,377 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-06-05 03:13:51,378 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-06-05 03:13:51,378 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-06-05 03:13:51,378 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-06-05 03:13:51,378 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-06-05 03:13:51,378 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:13:51,698 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-06-05 03:13:51,724 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-06-05 03:13:51,726 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-06-05 03:13:51,727 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2021-06-05 03:13:51,729 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2021-06-05 03:13:51,729 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/fork_loop_unsafe2.bpl [2021-06-05 03:13:51,730 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/fork_loop_unsafe2.bpl' [2021-06-05 03:13:51,761 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-06-05 03:13:51,762 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2021-06-05 03:13:51,764 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-06-05 03:13:51,764 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-06-05 03:13:51,764 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-06-05 03:13:51,774 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "fork_loop_unsafe2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.06 03:13:51" (1/1) ... [2021-06-05 03:13:51,780 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "fork_loop_unsafe2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.06 03:13:51" (1/1) ... [2021-06-05 03:13:51,787 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-06-05 03:13:51,788 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-06-05 03:13:51,788 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-06-05 03:13:51,788 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-06-05 03:13:51,795 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "fork_loop_unsafe2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.06 03:13:51" (1/1) ... [2021-06-05 03:13:51,795 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "fork_loop_unsafe2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.06 03:13:51" (1/1) ... [2021-06-05 03:13:51,796 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "fork_loop_unsafe2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.06 03:13:51" (1/1) ... [2021-06-05 03:13:51,796 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "fork_loop_unsafe2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.06 03:13:51" (1/1) ... [2021-06-05 03:13:51,798 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "fork_loop_unsafe2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.06 03:13:51" (1/1) ... [2021-06-05 03:13:51,799 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "fork_loop_unsafe2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.06 03:13:51" (1/1) ... [2021-06-05 03:13:51,800 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "fork_loop_unsafe2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.06 03:13:51" (1/1) ... [2021-06-05 03:13:51,800 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-06-05 03:13:51,801 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-06-05 03:13:51,801 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-06-05 03:13:51,802 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-06-05 03:13:51,803 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "fork_loop_unsafe2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.06 03:13:51" (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:13:51,867 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2021-06-05 03:13:51,867 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-06-05 03:13:51,868 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-06-05 03:13:51,868 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread given in one single declaration [2021-06-05 03:13:51,868 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2021-06-05 03:13:51,868 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2021-06-05 03:13:51,869 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:13:51,986 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-06-05 03:13:51,986 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2021-06-05 03:13:51,988 INFO L202 PluginConnector]: Adding new model fork_loop_unsafe2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.06 03:13:51 BoogieIcfgContainer [2021-06-05 03:13:51,988 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-06-05 03:13:51,990 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-06-05 03:13:51,990 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-06-05 03:13:51,993 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-06-05 03:13:51,993 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "fork_loop_unsafe2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.06 03:13:51" (1/2) ... [2021-06-05 03:13:51,994 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3460a393 and model type fork_loop_unsafe2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.06 03:13:51, skipping insertion in model container [2021-06-05 03:13:51,995 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "fork_loop_unsafe2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.06 03:13:51" (2/2) ... [2021-06-05 03:13:51,996 INFO L111 eAbstractionObserver]: Analyzing ICFG fork_loop_unsafe2.bpl [2021-06-05 03:13:52,005 WARN L148 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-06-05 03:13:52,005 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-06-05 03:13:52,005 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-06-05 03:13:52,007 INFO L510 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-06-05 03:13:52,032 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-05 03:13:52,049 INFO L255 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2021-06-05 03:13:52,067 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-05 03:13:52,067 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-05 03:13:52,067 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-05 03:13:52,067 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-05 03:13:52,067 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-05 03:13:52,067 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-05 03:13:52,068 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-05 03:13:52,068 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-05 03:13:52,075 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 11 places, 8 transitions, 21 flow [2021-06-05 03:13:52,083 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 18 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 17 states have internal predecessors, (25), 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:13:52,084 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 17 states have internal predecessors, (25), 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:13:52,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-06-05 03:13:52,089 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 03:13:52,090 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-06-05 03:13:52,090 INFO L430 AbstractCegarLoop]: === Iteration 1 === [threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-06-05 03:13:52,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 03:13:52,095 INFO L82 PathProgramCache]: Analyzing trace with hash 43019, now seen corresponding path program 1 times [2021-06-05 03:13:52,102 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 03:13:52,102 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985183346] [2021-06-05 03:13:52,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 03:13:52,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-05 03:13:52,170 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-05 03:13:52,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-05 03:13:52,174 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-05 03:13:52,186 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-05 03:13:52,186 INFO L622 BasicCegarLoop]: Counterexample might be feasible [2021-06-05 03:13:52,187 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-06-05 03:13:52,187 WARN L242 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2021-06-05 03:13:52,187 INFO L510 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2021-06-05 03:13:52,197 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-05 03:13:52,197 INFO L255 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2021-06-05 03:13:52,199 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-05 03:13:52,199 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-05 03:13:52,200 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-05 03:13:52,200 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-05 03:13:52,200 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-05 03:13:52,200 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-05 03:13:52,200 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-05 03:13:52,200 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-05 03:13:52,201 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 18 places, 13 transitions, 38 flow [2021-06-05 03:13:52,208 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 88 states, 77 states have (on average 2.4805194805194803) internal successors, (191), 87 states have internal predecessors, (191), 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:13:52,209 INFO L276 IsEmpty]: Start isEmpty. Operand has 88 states, 77 states have (on average 2.4805194805194803) internal successors, (191), 87 states have internal predecessors, (191), 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:13:52,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2021-06-05 03:13:52,210 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 03:13:52,210 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2021-06-05 03:13:52,210 INFO L430 AbstractCegarLoop]: === Iteration 1 === [threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, threadErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 03:13:52,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 03:13:52,211 INFO L82 PathProgramCache]: Analyzing trace with hash 1737837, now seen corresponding path program 1 times [2021-06-05 03:13:52,211 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 03:13:52,211 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714014303] [2021-06-05 03:13:52,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 03:13:52,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-05 03:13:52,215 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-05 03:13:52,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-05 03:13:52,218 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-05 03:13:52,219 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-05 03:13:52,219 INFO L622 BasicCegarLoop]: Counterexample might be feasible [2021-06-05 03:13:52,219 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-06-05 03:13:52,219 WARN L242 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2021-06-05 03:13:52,220 INFO L510 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2021-06-05 03:13:52,229 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-05 03:13:52,229 INFO L255 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-06-05 03:13:52,231 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-05 03:13:52,231 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-05 03:13:52,231 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-05 03:13:52,231 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-05 03:13:52,231 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-05 03:13:52,231 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-05 03:13:52,232 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-05 03:13:52,232 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-05 03:13:52,233 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 25 places, 18 transitions, 57 flow [2021-06-05 03:13:52,267 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 438 states, 415 states have (on average 3.1349397590361447) internal successors, (1301), 437 states have internal predecessors, (1301), 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:13:52,269 INFO L276 IsEmpty]: Start isEmpty. Operand has 438 states, 415 states have (on average 3.1349397590361447) internal successors, (1301), 437 states have internal predecessors, (1301), 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:13:52,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2021-06-05 03:13:52,270 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 03:13:52,270 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2021-06-05 03:13:52,270 INFO L430 AbstractCegarLoop]: === Iteration 1 === [threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, threadErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 03:13:52,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 03:13:52,271 INFO L82 PathProgramCache]: Analyzing trace with hash 2295732, now seen corresponding path program 1 times [2021-06-05 03:13:52,271 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 03:13:52,272 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179241151] [2021-06-05 03:13:52,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 03:13:52,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 03:13:52,332 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:13:52,333 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 03:13:52,333 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179241151] [2021-06-05 03:13:52,333 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179241151] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 03:13:52,334 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 03:13:52,334 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-05 03:13:52,334 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545261670] [2021-06-05 03:13:52,337 INFO L462 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-05 03:13:52,337 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 03:13:52,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-05 03:13:52,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-06-05 03:13:52,365 INFO L87 Difference]: Start difference. First operand has 438 states, 415 states have (on average 3.1349397590361447) internal successors, (1301), 437 states have internal predecessors, (1301), 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 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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:13:52,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 03:13:52,494 INFO L93 Difference]: Finished difference Result 423 states and 1252 transitions. [2021-06-05 03:13:52,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-05 03:13:52,500 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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 4 [2021-06-05 03:13:52,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 03:13:52,519 INFO L225 Difference]: With dead ends: 423 [2021-06-05 03:13:52,520 INFO L226 Difference]: Without dead ends: 406 [2021-06-05 03:13:52,521 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.0ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-06-05 03:13:52,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2021-06-05 03:13:52,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 406. [2021-06-05 03:13:52,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 406 states, 388 states have (on average 3.0927835051546393) internal successors, (1200), 405 states have internal predecessors, (1200), 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:13:52,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 1200 transitions. [2021-06-05 03:13:52,630 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 1200 transitions. Word has length 4 [2021-06-05 03:13:52,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 03:13:52,630 INFO L482 AbstractCegarLoop]: Abstraction has 406 states and 1200 transitions. [2021-06-05 03:13:52,630 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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:13:52,631 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 1200 transitions. [2021-06-05 03:13:52,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-06-05 03:13:52,631 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 03:13:52,631 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-06-05 03:13:52,631 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-06-05 03:13:52,632 INFO L430 AbstractCegarLoop]: === Iteration 2 === [threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, threadErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 03:13:52,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 03:13:52,632 INFO L82 PathProgramCache]: Analyzing trace with hash 71173705, now seen corresponding path program 1 times [2021-06-05 03:13:52,633 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 03:13:52,633 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543960552] [2021-06-05 03:13:52,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 03:13:52,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-05 03:13:52,637 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-05 03:13:52,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-05 03:13:52,640 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-05 03:13:52,641 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-05 03:13:52,642 INFO L622 BasicCegarLoop]: Counterexample might be feasible [2021-06-05 03:13:52,643 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-06-05 03:13:52,643 WARN L242 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2021-06-05 03:13:52,643 INFO L510 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2021-06-05 03:13:52,652 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-05 03:13:52,653 INFO L255 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-06-05 03:13:52,654 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-05 03:13:52,654 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-05 03:13:52,654 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-05 03:13:52,654 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-05 03:13:52,654 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-05 03:13:52,654 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-05 03:13:52,654 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-05 03:13:52,654 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-05 03:13:52,655 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 32 places, 23 transitions, 78 flow [2021-06-05 03:13:52,753 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 2188 states, 2141 states have (on average 3.8538066324147593) internal successors, (8251), 2187 states have internal predecessors, (8251), 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:13:52,759 INFO L276 IsEmpty]: Start isEmpty. Operand has 2188 states, 2141 states have (on average 3.8538066324147593) internal successors, (8251), 2187 states have internal predecessors, (8251), 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:13:52,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2021-06-05 03:13:52,760 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 03:13:52,760 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2021-06-05 03:13:52,760 INFO L430 AbstractCegarLoop]: === Iteration 1 === [threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, threadErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 03:13:52,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 03:13:52,761 INFO L82 PathProgramCache]: Analyzing trace with hash 3007480, now seen corresponding path program 1 times [2021-06-05 03:13:52,761 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 03:13:52,762 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523704742] [2021-06-05 03:13:52,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 03:13:52,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 03:13:52,794 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:13:52,795 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 03:13:52,795 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523704742] [2021-06-05 03:13:52,796 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523704742] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 03:13:52,796 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 03:13:52,796 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-05 03:13:52,796 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333576616] [2021-06-05 03:13:52,796 INFO L462 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-05 03:13:52,796 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 03:13:52,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-05 03:13:52,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-06-05 03:13:52,804 INFO L87 Difference]: Start difference. First operand has 2188 states, 2141 states have (on average 3.8538066324147593) internal successors, (8251), 2187 states have internal predecessors, (8251), 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 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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:13:52,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 03:13:52,909 INFO L93 Difference]: Finished difference Result 2164 states and 8155 transitions. [2021-06-05 03:13:52,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-05 03:13:52,910 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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 4 [2021-06-05 03:13:52,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 03:13:52,932 INFO L225 Difference]: With dead ends: 2164 [2021-06-05 03:13:52,932 INFO L226 Difference]: Without dead ends: 2131 [2021-06-05 03:13:52,933 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.5ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-06-05 03:13:52,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2131 states. [2021-06-05 03:13:53,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2131 to 2131. [2021-06-05 03:13:53,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2131 states, 2090 states have (on average 3.838755980861244) internal successors, (8023), 2130 states have internal predecessors, (8023), 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:13:53,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2131 states to 2131 states and 8023 transitions. [2021-06-05 03:13:53,073 INFO L78 Accepts]: Start accepts. Automaton has 2131 states and 8023 transitions. Word has length 4 [2021-06-05 03:13:53,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 03:13:53,074 INFO L482 AbstractCegarLoop]: Abstraction has 2131 states and 8023 transitions. [2021-06-05 03:13:53,074 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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:13:53,074 INFO L276 IsEmpty]: Start isEmpty. Operand 2131 states and 8023 transitions. [2021-06-05 03:13:53,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-06-05 03:13:53,075 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 03:13:53,075 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-06-05 03:13:53,075 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-06-05 03:13:53,076 INFO L430 AbstractCegarLoop]: === Iteration 2 === [threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, threadErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 03:13:53,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 03:13:53,076 INFO L82 PathProgramCache]: Analyzing trace with hash -1404356622, now seen corresponding path program 1 times [2021-06-05 03:13:53,076 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 03:13:53,078 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531206422] [2021-06-05 03:13:53,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 03:13:53,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 03:13:53,110 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 03:13:53,110 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 03:13:53,110 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531206422] [2021-06-05 03:13:53,110 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531206422] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 03:13:53,110 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 03:13:53,111 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-05 03:13:53,111 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355577272] [2021-06-05 03:13:53,111 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-05 03:13:53,111 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 03:13:53,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-05 03:13:53,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-06-05 03:13:53,112 INFO L87 Difference]: Start difference. First operand 2131 states and 8023 transitions. Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 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:13:53,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 03:13:53,198 INFO L93 Difference]: Finished difference Result 3293 states and 11089 transitions. [2021-06-05 03:13:53,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-05 03:13:53,199 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 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 6 [2021-06-05 03:13:53,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 03:13:53,220 INFO L225 Difference]: With dead ends: 3293 [2021-06-05 03:13:53,220 INFO L226 Difference]: Without dead ends: 3199 [2021-06-05 03:13:53,221 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.5ms TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-06-05 03:13:53,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3199 states. [2021-06-05 03:13:53,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3199 to 2755. [2021-06-05 03:13:53,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2755 states, 2717 states have (on average 3.5888847994111153) internal successors, (9751), 2754 states have internal predecessors, (9751), 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:13:53,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2755 states to 2755 states and 9751 transitions. [2021-06-05 03:13:53,407 INFO L78 Accepts]: Start accepts. Automaton has 2755 states and 9751 transitions. Word has length 6 [2021-06-05 03:13:53,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 03:13:53,407 INFO L482 AbstractCegarLoop]: Abstraction has 2755 states and 9751 transitions. [2021-06-05 03:13:53,408 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 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:13:53,408 INFO L276 IsEmpty]: Start isEmpty. Operand 2755 states and 9751 transitions. [2021-06-05 03:13:53,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-06-05 03:13:53,409 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 03:13:53,409 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-06-05 03:13:53,409 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-06-05 03:13:53,409 INFO L430 AbstractCegarLoop]: === Iteration 3 === [threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, threadErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 03:13:53,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 03:13:53,410 INFO L82 PathProgramCache]: Analyzing trace with hash -1404345548, now seen corresponding path program 1 times [2021-06-05 03:13:53,410 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 03:13:53,410 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822613339] [2021-06-05 03:13:53,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 03:13:53,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-05 03:13:53,418 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-05 03:13:53,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-05 03:13:53,433 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-05 03:13:53,434 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-05 03:13:53,434 INFO L622 BasicCegarLoop]: Counterexample might be feasible [2021-06-05 03:13:53,434 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-06-05 03:13:53,435 WARN L242 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2021-06-05 03:13:53,435 INFO L510 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2021-06-05 03:13:53,443 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-05 03:13:53,444 INFO L255 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-06-05 03:13:53,445 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-05 03:13:53,445 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-05 03:13:53,445 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-05 03:13:53,445 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-05 03:13:53,445 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-05 03:13:53,445 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-05 03:13:53,445 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-05 03:13:53,445 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-05 03:13:53,446 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 39 places, 28 transitions, 101 flow [2021-06-05 03:13:54,274 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 10938 states, 10843 states have (on average 4.6113621691413815) internal successors, (50001), 10937 states have internal predecessors, (50001), 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:13:54,303 INFO L276 IsEmpty]: Start isEmpty. Operand has 10938 states, 10843 states have (on average 4.6113621691413815) internal successors, (50001), 10937 states have internal predecessors, (50001), 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:13:54,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2021-06-05 03:13:54,304 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 03:13:54,304 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2021-06-05 03:13:54,304 INFO L430 AbstractCegarLoop]: === Iteration 1 === [threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, threadErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 03:13:54,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 03:13:54,305 INFO L82 PathProgramCache]: Analyzing trace with hash 3873148, now seen corresponding path program 1 times [2021-06-05 03:13:54,305 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 03:13:54,305 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992852192] [2021-06-05 03:13:54,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 03:13:54,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 03:13:54,319 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:13:54,319 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 03:13:54,319 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992852192] [2021-06-05 03:13:54,320 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992852192] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 03:13:54,320 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 03:13:54,320 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-05 03:13:54,320 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578741241] [2021-06-05 03:13:54,320 INFO L462 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-05 03:13:54,320 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 03:13:54,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-05 03:13:54,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-06-05 03:13:54,343 INFO L87 Difference]: Start difference. First operand has 10938 states, 10843 states have (on average 4.6113621691413815) internal successors, (50001), 10937 states have internal predecessors, (50001), 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 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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:13:54,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 03:13:54,568 INFO L93 Difference]: Finished difference Result 10903 states and 49836 transitions. [2021-06-05 03:13:54,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-05 03:13:54,569 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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 4 [2021-06-05 03:13:54,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 03:13:54,673 INFO L225 Difference]: With dead ends: 10903 [2021-06-05 03:13:54,673 INFO L226 Difference]: Without dead ends: 10838 [2021-06-05 03:13:54,674 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.2ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-06-05 03:13:55,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10838 states. [2021-06-05 03:13:55,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10838 to 10838. [2021-06-05 03:13:55,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10838 states, 10750 states have (on average 4.605767441860465) internal successors, (49512), 10837 states have internal predecessors, (49512), 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:13:55,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10838 states to 10838 states and 49512 transitions. [2021-06-05 03:13:55,431 INFO L78 Accepts]: Start accepts. Automaton has 10838 states and 49512 transitions. Word has length 4 [2021-06-05 03:13:55,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 03:13:55,431 INFO L482 AbstractCegarLoop]: Abstraction has 10838 states and 49512 transitions. [2021-06-05 03:13:55,431 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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:13:55,432 INFO L276 IsEmpty]: Start isEmpty. Operand 10838 states and 49512 transitions. [2021-06-05 03:13:55,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-06-05 03:13:55,432 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 03:13:55,432 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-06-05 03:13:55,432 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-06-05 03:13:55,432 INFO L430 AbstractCegarLoop]: === Iteration 2 === [threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, threadErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 03:13:55,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 03:13:55,433 INFO L82 PathProgramCache]: Analyzing trace with hash -572848562, now seen corresponding path program 1 times [2021-06-05 03:13:55,433 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 03:13:55,433 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125800916] [2021-06-05 03:13:55,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 03:13:55,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 03:13:55,529 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 03:13:55,529 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 03:13:55,529 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125800916] [2021-06-05 03:13:55,529 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125800916] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 03:13:55,529 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1684342026] [2021-06-05 03:13:55,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 03:13:55,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 03:13:55,565 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2021-06-05 03:13:55,566 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 03:13:55,728 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 03:13:55,729 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1684342026] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 03:13:55,729 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 03:13:55,729 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2021-06-05 03:13:55,729 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529972574] [2021-06-05 03:13:55,729 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-05 03:13:55,729 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 03:13:55,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-05 03:13:55,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-06-05 03:13:55,730 INFO L87 Difference]: Start difference. First operand 10838 states and 49512 transitions. Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 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:13:56,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 03:13:56,014 INFO L93 Difference]: Finished difference Result 19096 states and 78036 transitions. [2021-06-05 03:13:56,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-05 03:13:56,015 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 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 6 [2021-06-05 03:13:56,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 03:13:56,201 INFO L225 Difference]: With dead ends: 19096 [2021-06-05 03:13:56,202 INFO L226 Difference]: Without dead ends: 18792 [2021-06-05 03:13:56,202 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.8ms TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-06-05 03:13:56,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18792 states. [2021-06-05 03:13:57,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18792 to 16354. [2021-06-05 03:13:57,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16354 states, 16269 states have (on average 4.284282992193742) internal successors, (69701), 16353 states have internal predecessors, (69701), 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:13:57,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16354 states to 16354 states and 69701 transitions. [2021-06-05 03:13:57,304 INFO L78 Accepts]: Start accepts. Automaton has 16354 states and 69701 transitions. Word has length 6 [2021-06-05 03:13:57,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 03:13:57,304 INFO L482 AbstractCegarLoop]: Abstraction has 16354 states and 69701 transitions. [2021-06-05 03:13:57,304 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 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:13:57,304 INFO L276 IsEmpty]: Start isEmpty. Operand 16354 states and 69701 transitions. [2021-06-05 03:13:57,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-06-05 03:13:57,305 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 03:13:57,305 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-06-05 03:13:57,521 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2021-06-05 03:13:57,521 INFO L430 AbstractCegarLoop]: === Iteration 3 === [threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, threadErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 03:13:57,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 03:13:57,522 INFO L82 PathProgramCache]: Analyzing trace with hash -558068901, now seen corresponding path program 1 times [2021-06-05 03:13:57,522 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 03:13:57,522 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943495006] [2021-06-05 03:13:57,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 03:13:57,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-05 03:13:57,530 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-05 03:13:57,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-05 03:13:57,539 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-05 03:13:57,543 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-05 03:13:57,543 INFO L622 BasicCegarLoop]: Counterexample might be feasible [2021-06-05 03:13:57,543 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-06-05 03:13:57,543 WARN L242 ceAbstractionStarter]: 5 thread instances were not sufficient, I will increase this number and restart the analysis [2021-06-05 03:13:57,544 INFO L510 ceAbstractionStarter]: Constructing petrified ICFG for 6 thread instances. [2021-06-05 03:13:57,553 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-05 03:13:57,554 INFO L255 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2021-06-05 03:13:57,555 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-05 03:13:57,555 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-05 03:13:57,555 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-05 03:13:57,555 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-05 03:13:57,555 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-05 03:13:57,555 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-05 03:13:57,555 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-05 03:13:57,555 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-05 03:13:57,556 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 46 places, 33 transitions, 126 flow [2021-06-05 03:14:12,722 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 54688 states, 54497 states have (on average 5.390223315044865) internal successors, (293751), 54687 states have internal predecessors, (293751), 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:14:12,815 INFO L276 IsEmpty]: Start isEmpty. Operand has 54688 states, 54497 states have (on average 5.390223315044865) internal successors, (293751), 54687 states have internal predecessors, (293751), 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:14:12,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2021-06-05 03:14:12,816 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 03:14:12,816 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2021-06-05 03:14:12,816 INFO L430 AbstractCegarLoop]: === Iteration 1 === [threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 03:14:12,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 03:14:12,816 INFO L82 PathProgramCache]: Analyzing trace with hash 4893504, now seen corresponding path program 1 times [2021-06-05 03:14:12,817 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 03:14:12,820 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512034703] [2021-06-05 03:14:12,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 03:14:12,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 03:14:12,840 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:14:12,840 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 03:14:12,844 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512034703] [2021-06-05 03:14:12,844 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512034703] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 03:14:12,845 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 03:14:12,845 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-05 03:14:12,845 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257591617] [2021-06-05 03:14:12,846 INFO L462 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-05 03:14:12,846 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 03:14:12,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-05 03:14:12,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-06-05 03:14:12,936 INFO L87 Difference]: Start difference. First operand has 54688 states, 54497 states have (on average 5.390223315044865) internal successors, (293751), 54687 states have internal predecessors, (293751), 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 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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:14:13,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 03:14:13,593 INFO L93 Difference]: Finished difference Result 54640 states and 293491 transitions. [2021-06-05 03:14:13,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-05 03:14:13,594 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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 4 [2021-06-05 03:14:13,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 03:14:13,942 INFO L225 Difference]: With dead ends: 54640 [2021-06-05 03:14:13,942 INFO L226 Difference]: Without dead ends: 54511 [2021-06-05 03:14:13,943 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.9ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-06-05 03:14:17,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54511 states. [2021-06-05 03:14:18,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54511 to 54511. [2021-06-05 03:14:18,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54511 states, 54328 states have (on average 5.387995140627301) internal successors, (292719), 54510 states have internal predecessors, (292719), 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:14:19,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54511 states to 54511 states and 292719 transitions. [2021-06-05 03:14:19,134 INFO L78 Accepts]: Start accepts. Automaton has 54511 states and 292719 transitions. Word has length 4 [2021-06-05 03:14:19,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 03:14:19,134 INFO L482 AbstractCegarLoop]: Abstraction has 54511 states and 292719 transitions. [2021-06-05 03:14:19,135 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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:14:19,135 INFO L276 IsEmpty]: Start isEmpty. Operand 54511 states and 292719 transitions. [2021-06-05 03:14:19,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-06-05 03:14:19,135 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 03:14:19,136 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-06-05 03:14:19,136 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-06-05 03:14:19,136 INFO L430 AbstractCegarLoop]: === Iteration 2 === [threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 03:14:19,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 03:14:19,136 INFO L82 PathProgramCache]: Analyzing trace with hash 407699494, now seen corresponding path program 1 times [2021-06-05 03:14:19,136 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 03:14:19,137 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132050700] [2021-06-05 03:14:19,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 03:14:19,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 03:14:19,157 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 03:14:19,157 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 03:14:19,157 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132050700] [2021-06-05 03:14:19,157 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132050700] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 03:14:19,158 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [179921176] [2021-06-05 03:14:19,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 03:14:19,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 03:14:19,207 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2021-06-05 03:14:19,208 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 03:14:19,245 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 03:14:19,245 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [179921176] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 03:14:19,246 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 03:14:19,246 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2021-06-05 03:14:19,246 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456375785] [2021-06-05 03:14:19,246 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-05 03:14:19,246 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 03:14:19,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-05 03:14:19,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-06-05 03:14:19,247 INFO L87 Difference]: Start difference. First operand 54511 states and 292719 transitions. Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 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:14:20,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 03:14:20,372 INFO L93 Difference]: Finished difference Result 102108 states and 489499 transitions. [2021-06-05 03:14:20,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-05 03:14:20,377 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 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 6 [2021-06-05 03:14:20,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 03:14:20,816 INFO L225 Difference]: With dead ends: 102108 [2021-06-05 03:14:20,816 INFO L226 Difference]: Without dead ends: 101140 [2021-06-05 03:14:20,817 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.4ms TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-06-05 03:14:24,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101140 states. [2021-06-05 03:14:26,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101140 to 89680. [2021-06-05 03:14:26,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89680 states, 89500 states have (on average 4.972145251396648) internal successors, (445007), 89679 states have internal predecessors, (445007), 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:14:27,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89680 states to 89680 states and 445007 transitions. [2021-06-05 03:14:27,157 INFO L78 Accepts]: Start accepts. Automaton has 89680 states and 445007 transitions. Word has length 6 [2021-06-05 03:14:27,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 03:14:27,157 INFO L482 AbstractCegarLoop]: Abstraction has 89680 states and 445007 transitions. [2021-06-05 03:14:27,157 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 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:14:27,158 INFO L276 IsEmpty]: Start isEmpty. Operand 89680 states and 445007 transitions. [2021-06-05 03:14:27,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-06-05 03:14:27,158 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 03:14:27,158 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 03:14:27,360 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2021-06-05 03:14:27,361 INFO L430 AbstractCegarLoop]: === Iteration 3 === [threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 03:14:27,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 03:14:27,361 INFO L82 PathProgramCache]: Analyzing trace with hash 957640095, now seen corresponding path program 1 times [2021-06-05 03:14:27,361 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 03:14:27,362 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957633944] [2021-06-05 03:14:27,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 03:14:27,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-05 03:14:27,372 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-05 03:14:27,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-05 03:14:27,375 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-05 03:14:27,377 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-05 03:14:27,377 INFO L622 BasicCegarLoop]: Counterexample might be feasible [2021-06-05 03:14:27,377 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-06-05 03:14:27,379 INFO L246 ceAbstractionStarter]: Analysis of concurrent program completed with 6 thread instances [2021-06-05 03:14:27,388 INFO L202 PluginConnector]: Adding new model fork_loop_unsafe2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.06 03:14:27 BasicIcfg [2021-06-05 03:14:27,388 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-06-05 03:14:27,389 INFO L168 Benchmark]: Toolchain (without parser) took 35626.05 ms. Allocated memory was 333.4 MB in the beginning and 11.0 GB in the end (delta: 10.7 GB). Free memory was 313.0 MB in the beginning and 9.2 GB in the end (delta: -8.9 GB). Peak memory consumption was 1.8 GB. Max. memory is 16.0 GB. [2021-06-05 03:14:27,389 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.16 ms. Allocated memory is still 333.4 MB. Free memory was 313.9 MB in the beginning and 313.9 MB in the end (delta: 69.4 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-06-05 03:14:27,390 INFO L168 Benchmark]: Boogie Procedure Inliner took 23.44 ms. Allocated memory is still 333.4 MB. Free memory was 312.8 MB in the beginning and 311.4 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:14:27,390 INFO L168 Benchmark]: Boogie Preprocessor took 12.67 ms. Allocated memory is still 333.4 MB. Free memory was 311.4 MB in the beginning and 310.5 MB in the end (delta: 902.3 kB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-06-05 03:14:27,390 INFO L168 Benchmark]: RCFGBuilder took 186.95 ms. Allocated memory is still 333.4 MB. Free memory was 310.4 MB in the beginning and 302.1 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:14:27,391 INFO L168 Benchmark]: TraceAbstraction took 35397.99 ms. Allocated memory was 333.4 MB in the beginning and 11.0 GB in the end (delta: 10.7 GB). Free memory was 301.7 MB in the beginning and 9.2 GB in the end (delta: -8.9 GB). Peak memory consumption was 1.8 GB. Max. memory is 16.0 GB. [2021-06-05 03:14:27,392 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 333.4 MB. Free memory was 313.9 MB in the beginning and 313.9 MB in the end (delta: 69.4 kB). There was no memory consumed. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 23.44 ms. Allocated memory is still 333.4 MB. Free memory was 312.8 MB in the beginning and 311.4 MB in the end (delta: 1.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 12.67 ms. Allocated memory is still 333.4 MB. Free memory was 311.4 MB in the beginning and 310.5 MB in the end (delta: 902.3 kB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 186.95 ms. Allocated memory is still 333.4 MB. Free memory was 310.4 MB in the beginning and 302.1 MB in the end (delta: 8.3 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.0 GB. * TraceAbstraction took 35397.99 ms. Allocated memory was 333.4 MB in the beginning and 11.0 GB in the end (delta: 10.7 GB). Free memory was 301.7 MB in the beginning and 9.2 GB in the end (delta: -8.9 GB). Peak memory consumption was 1.8 GB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 17]: assertion can be violated assertion can be violated We found a FailurePath: [L23] 0 x := 0; VAL [x=0] [L26] FORK 0 fork 0 thread(); VAL [x=0] [L16] 1 x := x + 1; VAL [x=1] [L26] FORK 0 fork 0 thread(); VAL [x=1] [L26] FORK 0 fork 0 thread(); VAL [x=1] [L16] 2 x := x + 1; VAL [x=2] [L16] 3 x := x + 1; VAL [x=3] [L17] 2 assert x < 3; VAL [x=3] - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 14 locations, 3 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 122.6ms, OverallIterations: 1, TraceHistogramMax: 1, EmptinessCheckTime: 5.9ms, AutomataDifference: 0.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 15.1ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=18occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 2.9ms SsaConstructionTime, 17.8ms SatisfiabilityAnalysisTime, 0.0ms InterpolantComputationTime, 3 NumberOfCodeBlocks, 3 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 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, 19 locations, 4 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 20.1ms, OverallIterations: 1, TraceHistogramMax: 1, EmptinessCheckTime: 0.9ms, AutomataDifference: 0.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 8.4ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=88occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4ms SsaConstructionTime, 1.5ms SatisfiabilityAnalysisTime, 0.0ms InterpolantComputationTime, 4 NumberOfCodeBlocks, 4 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 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, 24 locations, 5 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 411.9ms, OverallIterations: 2, TraceHistogramMax: 1, EmptinessCheckTime: 2.9ms, AutomataDifference: 183.1ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 35.4ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 12 SDtfs, 15 SDslu, 13 SDs, 0 SdLazy, 24 SolverSat, 5 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 60.8ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.0ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=438occurred in iteration=0, InterpolantAutomatonStates: 4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 97.3ms AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 1.2ms SsaConstructionTime, 7.3ms SatisfiabilityAnalysisTime, 47.7ms InterpolantComputationTime, 9 NumberOfCodeBlocks, 9 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 3 ConstructedInterpolants, 0 QuantifiedInterpolants, 9 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, 29 locations, 6 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 780.7ms, OverallIterations: 3, TraceHistogramMax: 1, EmptinessCheckTime: 8.6ms, AutomataDifference: 245.7ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 99.1ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 30 SDtfs, 50 SDslu, 41 SDs, 0 SdLazy, 72 SolverSat, 22 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 82.2ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 25.1ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=2755occurred in iteration=2, InterpolantAutomatonStates: 9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 326.0ms AutomataMinimizationTime, 2 MinimizatonAttempts, 444 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 4.1ms SsaConstructionTime, 13.2ms SatisfiabilityAnalysisTime, 43.8ms InterpolantComputationTime, 16 NumberOfCodeBlocks, 16 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 8 ConstructedInterpolants, 0 QuantifiedInterpolants, 24 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 1/1 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, 34 locations, 7 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 4098.7ms, OverallIterations: 3, TraceHistogramMax: 1, EmptinessCheckTime: 30.4ms, AutomataDifference: 825.6ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 829.0ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 36 SDtfs, 61 SDslu, 51 SDs, 0 SdLazy, 90 SolverSat, 28 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 67.2ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.0ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=16354occurred in iteration=2, InterpolantAutomatonStates: 9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 1858.8ms AutomataMinimizationTime, 2 MinimizatonAttempts, 2438 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 2.8ms SsaConstructionTime, 12.9ms SatisfiabilityAnalysisTime, 266.3ms InterpolantComputationTime, 23 NumberOfCodeBlocks, 23 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 13 ConstructedInterpolants, 0 QuantifiedInterpolants, 39 SizeOfPredicates, 0 NumberOfNonLiveVariables, 13 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 3 InterpolantComputations, 1 PerfectInterpolantSequences, 0/2 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, 39 locations, 8 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 29822.4ms, OverallIterations: 3, TraceHistogramMax: 1, EmptinessCheckTime: 94.8ms, AutomataDifference: 2667.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 15166.8ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 42 SDtfs, 79 SDslu, 61 SDs, 0 SdLazy, 102 SolverSat, 34 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 72.2ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.3ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=89680occurred in iteration=2, InterpolantAutomatonStates: 9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 11531.9ms AutomataMinimizationTime, 2 MinimizatonAttempts, 11460 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 4.4ms SsaConstructionTime, 12.6ms SatisfiabilityAnalysisTime, 68.5ms InterpolantComputationTime, 24 NumberOfCodeBlocks, 24 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 13 ConstructedInterpolants, 0 QuantifiedInterpolants, 39 SizeOfPredicates, 0 NumberOfNonLiveVariables, 13 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 3 InterpolantComputations, 1 PerfectInterpolantSequences, 0/2 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...