/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/single_assertion_test.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-c7b2d19 [2022-03-15 20:32:43,451 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-15 20:32:43,452 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-15 20:32:43,502 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-15 20:32:43,503 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-15 20:32:43,504 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-15 20:32:43,505 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-15 20:32:43,506 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-15 20:32:43,508 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-15 20:32:43,509 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-15 20:32:43,509 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-15 20:32:43,510 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-15 20:32:43,511 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-15 20:32:43,518 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-15 20:32:43,519 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-15 20:32:43,524 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-15 20:32:43,525 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-15 20:32:43,527 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-15 20:32:43,532 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-15 20:32:43,536 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-15 20:32:43,537 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-15 20:32:43,539 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-15 20:32:43,541 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-15 20:32:43,542 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-15 20:32:43,546 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-15 20:32:43,546 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-15 20:32:43,547 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-15 20:32:43,547 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-15 20:32:43,547 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-15 20:32:43,548 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-15 20:32:43,548 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-15 20:32:43,549 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-15 20:32:43,549 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-15 20:32:43,550 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-15 20:32:43,551 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-15 20:32:43,551 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-15 20:32:43,551 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-15 20:32:43,552 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-15 20:32:43,552 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-15 20:32:43,552 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-15 20:32:43,553 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-15 20:32:43,558 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf [2022-03-15 20:32:43,592 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-15 20:32:43,592 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-15 20:32:43,594 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-15 20:32:43,594 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-15 20:32:43,594 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-15 20:32:43,594 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-15 20:32:43,594 INFO L138 SettingsManager]: * Use SBE=true [2022-03-15 20:32:43,595 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-15 20:32:43,595 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-15 20:32:43,595 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-15 20:32:43,595 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-15 20:32:43,596 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-15 20:32:43,596 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-15 20:32:43,596 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-15 20:32:43,596 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-15 20:32:43,596 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-15 20:32:43,596 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-15 20:32:43,596 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-15 20:32:43,596 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-15 20:32:43,597 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-15 20:32:43,597 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-15 20:32:43,597 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-15 20:32:43,597 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-15 20:32:43,597 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 20:32:43,597 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-15 20:32:43,597 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-03-15 20:32:43,597 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-15 20:32:43,597 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-15 20:32:43,598 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-15 20:32:43,598 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2022-03-15 20:32:43,598 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2022-03-15 20:32:43,598 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-15 20:32:43,598 INFO L138 SettingsManager]: * Interpolant automaton=MCR 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 [2022-03-15 20:32:43,845 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-15 20:32:43,864 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-15 20:32:43,866 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-15 20:32:43,866 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2022-03-15 20:32:43,869 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2022-03-15 20:32:43,870 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/single_assertion_test.bpl [2022-03-15 20:32:43,870 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/single_assertion_test.bpl' [2022-03-15 20:32:43,889 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-15 20:32:43,890 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-03-15 20:32:43,891 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-03-15 20:32:43,891 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-03-15 20:32:43,891 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-03-15 20:32:43,901 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "single_assertion_test.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 08:32:43" (1/1) ... [2022-03-15 20:32:43,907 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "single_assertion_test.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 08:32:43" (1/1) ... [2022-03-15 20:32:43,912 INFO L137 Inliner]: procedures = 2, calls = 1, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2022-03-15 20:32:43,913 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-03-15 20:32:43,914 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-15 20:32:43,914 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-15 20:32:43,915 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-15 20:32:43,921 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "single_assertion_test.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 08:32:43" (1/1) ... [2022-03-15 20:32:43,921 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "single_assertion_test.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 08:32:43" (1/1) ... [2022-03-15 20:32:43,921 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "single_assertion_test.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 08:32:43" (1/1) ... [2022-03-15 20:32:43,921 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "single_assertion_test.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 08:32:43" (1/1) ... [2022-03-15 20:32:43,923 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "single_assertion_test.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 08:32:43" (1/1) ... [2022-03-15 20:32:43,925 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "single_assertion_test.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 08:32:43" (1/1) ... [2022-03-15 20:32:43,926 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "single_assertion_test.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 08:32:43" (1/1) ... [2022-03-15 20:32:43,926 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-15 20:32:43,927 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-15 20:32:43,927 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-15 20:32:43,927 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-15 20:32:43,928 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "single_assertion_test.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 08:32:43" (1/1) ... [2022-03-15 20:32:43,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 20:32:43,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:32:43,957 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-03-15 20:32:43,961 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-03-15 20:32:43,995 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2022-03-15 20:32:43,995 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-15 20:32:43,995 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-15 20:32:43,995 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread given in one single declaration [2022-03-15 20:32:43,995 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2022-03-15 20:32:43,995 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2022-03-15 20:32:43,996 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-03-15 20:32:44,028 INFO L234 CfgBuilder]: Building ICFG [2022-03-15 20:32:44,028 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-15 20:32:44,115 INFO L275 CfgBuilder]: Performing block encoding [2022-03-15 20:32:44,122 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-15 20:32:44,122 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-03-15 20:32:44,125 INFO L202 PluginConnector]: Adding new model single_assertion_test.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 08:32:44 BoogieIcfgContainer [2022-03-15 20:32:44,125 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-15 20:32:44,127 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-15 20:32:44,127 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-15 20:32:44,130 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-15 20:32:44,131 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "single_assertion_test.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 08:32:43" (1/2) ... [2022-03-15 20:32:44,132 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8dea502 and model type single_assertion_test.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 08:32:44, skipping insertion in model container [2022-03-15 20:32:44,133 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "single_assertion_test.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 08:32:44" (2/2) ... [2022-03-15 20:32:44,134 INFO L111 eAbstractionObserver]: Analyzing ICFG single_assertion_test.bpl [2022-03-15 20:32:44,145 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-03-15 20:32:44,145 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-03-15 20:32:44,147 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-03-15 20:32:44,147 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-03-15 20:32:44,174 WARN L322 ript$VariableManager]: TermVariabe threadThread1of1ForFork0_i not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:32:44,174 WARN L322 ript$VariableManager]: TermVariabe threadThread1of1ForFork0_i not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:32:44,175 WARN L322 ript$VariableManager]: TermVariabe threadThread1of1ForFork0_i not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:32:44,175 WARN L322 ript$VariableManager]: TermVariabe threadThread1of1ForFork0_i not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:32:44,191 INFO L148 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-03-15 20:32:44,241 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-15 20:32:44,249 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=MCR, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mLazyFiniteAutomaton=false, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=true, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR, mMcrOptimizeForkJoin=true, mMcrOverapproximateWrwc=true [2022-03-15 20:32:44,250 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-03-15 20:32:44,260 INFO L126 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-03-15 20:32:44,272 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 19 places, 16 transitions, 43 flow [2022-03-15 20:32:44,275 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 19 places, 16 transitions, 43 flow [2022-03-15 20:32:44,277 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 19 places, 16 transitions, 43 flow [2022-03-15 20:32:44,297 INFO L129 PetriNetUnfolder]: 0/14 cut-off events. [2022-03-15 20:32:44,297 INFO L130 PetriNetUnfolder]: For 1/2 co-relation queries the response was YES. [2022-03-15 20:32:44,299 INFO L84 FinitePrefix]: Finished finitePrefix Result has 20 conditions, 14 events. 0/14 cut-off events. For 1/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 15 event pairs, 0 based on Foata normal form. 0/11 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-03-15 20:32:44,300 INFO L116 LiptonReduction]: Number of co-enabled transitions 32 [2022-03-15 20:32:44,459 INFO L131 LiptonReduction]: Checked pairs total: 47 [2022-03-15 20:32:44,459 INFO L133 LiptonReduction]: Total number of compositions: 5 [2022-03-15 20:32:44,478 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 15 places, 12 transitions, 35 flow [2022-03-15 20:32:44,508 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 20 states, 15 states have (on average 1.8) internal successors, (27), 19 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:32:44,509 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 15 states have (on average 1.8) internal successors, (27), 19 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:32:44,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-03-15 20:32:44,513 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:32:44,514 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2022-03-15 20:32:44,514 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting threadErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT] === [2022-03-15 20:32:44,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:32:44,518 INFO L85 PathProgramCache]: Analyzing trace with hash 2254797, now seen corresponding path program 1 times [2022-03-15 20:32:44,538 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:32:44,539 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814319422] [2022-03-15 20:32:44,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:32:44,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:32:44,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:32:44,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:32:44,682 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:32:44,682 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814319422] [2022-03-15 20:32:44,682 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814319422] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:32:44,683 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:32:44,683 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-03-15 20:32:44,684 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2132712189] [2022-03-15 20:32:44,685 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:32:44,687 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:32:44,712 INFO L252 McrAutomatonBuilder]: Finished intersection with 5 states and 4 transitions. [2022-03-15 20:32:44,712 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:32:44,715 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:32:44,724 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-15 20:32:44,724 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:32:44,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-15 20:32:44,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-15 20:32:44,744 INFO L87 Difference]: Start difference. First operand has 20 states, 15 states have (on average 1.8) internal successors, (27), 19 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 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) [2022-03-15 20:32:44,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:32:44,781 INFO L93 Difference]: Finished difference Result 14 states and 17 transitions. [2022-03-15 20:32:44,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-15 20:32:44,784 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 [2022-03-15 20:32:44,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:32:44,788 INFO L225 Difference]: With dead ends: 14 [2022-03-15 20:32:44,789 INFO L226 Difference]: Without dead ends: 11 [2022-03-15 20:32:44,789 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-15 20:32:44,792 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 8 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 20:32:44,793 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 4 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 20:32:44,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2022-03-15 20:32:44,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2022-03-15 20:32:44,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 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) [2022-03-15 20:32:44,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 13 transitions. [2022-03-15 20:32:44,815 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 13 transitions. Word has length 4 [2022-03-15 20:32:44,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:32:44,815 INFO L470 AbstractCegarLoop]: Abstraction has 11 states and 13 transitions. [2022-03-15 20:32:44,815 INFO L471 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) [2022-03-15 20:32:44,816 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 13 transitions. [2022-03-15 20:32:44,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-03-15 20:32:44,816 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:32:44,816 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2022-03-15 20:32:44,816 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-15 20:32:44,817 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT] === [2022-03-15 20:32:44,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:32:44,817 INFO L85 PathProgramCache]: Analyzing trace with hash -2128124019, now seen corresponding path program 1 times [2022-03-15 20:32:44,818 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:32:44,818 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140391009] [2022-03-15 20:32:44,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:32:44,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:32:44,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-03-15 20:32:44,824 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-03-15 20:32:44,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-03-15 20:32:44,839 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-03-15 20:32:44,839 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-03-15 20:32:44,840 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATION (3 of 4 remaining) [2022-03-15 20:32:44,848 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (2 of 4 remaining) [2022-03-15 20:32:44,850 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONASSERT (1 of 4 remaining) [2022-03-15 20:32:44,850 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONASSERT (0 of 4 remaining) [2022-03-15 20:32:44,851 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-15 20:32:44,853 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1] [2022-03-15 20:32:44,858 WARN L235 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2022-03-15 20:32:44,858 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2022-03-15 20:32:44,863 WARN L322 ript$VariableManager]: TermVariabe threadThread1of2ForFork0_i not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:32:44,864 WARN L322 ript$VariableManager]: TermVariabe threadThread1of2ForFork0_i not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:32:44,864 WARN L322 ript$VariableManager]: TermVariabe threadThread1of2ForFork0_i not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:32:44,864 WARN L322 ript$VariableManager]: TermVariabe threadThread1of2ForFork0_i not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:32:44,864 WARN L322 ript$VariableManager]: TermVariabe threadThread2of2ForFork0_i not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:32:44,864 WARN L322 ript$VariableManager]: TermVariabe threadThread2of2ForFork0_i not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:32:44,865 WARN L322 ript$VariableManager]: TermVariabe threadThread2of2ForFork0_i not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:32:44,865 WARN L322 ript$VariableManager]: TermVariabe threadThread2of2ForFork0_i not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:32:44,867 INFO L148 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2022-03-15 20:32:44,868 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-15 20:32:44,869 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=MCR, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mLazyFiniteAutomaton=false, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=true, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR, mMcrOptimizeForkJoin=true, mMcrOverapproximateWrwc=true [2022-03-15 20:32:44,869 INFO L340 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-03-15 20:32:44,870 INFO L126 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-03-15 20:32:44,870 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 26 places, 23 transitions, 70 flow [2022-03-15 20:32:44,871 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 26 places, 23 transitions, 70 flow [2022-03-15 20:32:44,871 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 26 places, 23 transitions, 70 flow [2022-03-15 20:32:44,877 INFO L129 PetriNetUnfolder]: 1/29 cut-off events. [2022-03-15 20:32:44,877 INFO L130 PetriNetUnfolder]: For 7/9 co-relation queries the response was YES. [2022-03-15 20:32:44,878 INFO L84 FinitePrefix]: Finished finitePrefix Result has 44 conditions, 29 events. 1/29 cut-off events. For 7/9 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 50 event pairs, 0 based on Foata normal form. 0/23 useless extension candidates. Maximal degree in co-relation 6. Up to 4 conditions per place. [2022-03-15 20:32:44,879 INFO L116 LiptonReduction]: Number of co-enabled transitions 120 [2022-03-15 20:32:44,989 INFO L131 LiptonReduction]: Checked pairs total: 315 [2022-03-15 20:32:44,989 INFO L133 LiptonReduction]: Total number of compositions: 8 [2022-03-15 20:32:44,990 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 20 places, 17 transitions, 58 flow [2022-03-15 20:32:44,998 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 70 states, 59 states have (on average 2.2711864406779663) internal successors, (134), 69 states have internal predecessors, (134), 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) [2022-03-15 20:32:44,998 INFO L276 IsEmpty]: Start isEmpty. Operand has 70 states, 59 states have (on average 2.2711864406779663) internal successors, (134), 69 states have internal predecessors, (134), 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) [2022-03-15 20:32:44,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-03-15 20:32:44,999 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:32:44,999 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2022-03-15 20:32:44,999 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting threadErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT (and 1 more)] === [2022-03-15 20:32:45,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:32:45,000 INFO L85 PathProgramCache]: Analyzing trace with hash 3414791, now seen corresponding path program 1 times [2022-03-15 20:32:45,001 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:32:45,001 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213167138] [2022-03-15 20:32:45,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:32:45,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:32:45,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:32:45,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:32:45,034 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:32:45,034 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213167138] [2022-03-15 20:32:45,034 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213167138] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:32:45,034 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:32:45,034 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-03-15 20:32:45,035 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1547875696] [2022-03-15 20:32:45,035 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:32:45,035 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:32:45,036 INFO L252 McrAutomatonBuilder]: Finished intersection with 5 states and 4 transitions. [2022-03-15 20:32:45,036 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:32:45,036 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:32:45,036 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-15 20:32:45,037 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:32:45,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-15 20:32:45,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-15 20:32:45,038 INFO L87 Difference]: Start difference. First operand has 70 states, 59 states have (on average 2.2711864406779663) internal successors, (134), 69 states have internal predecessors, (134), 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) [2022-03-15 20:32:45,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:32:45,075 INFO L93 Difference]: Finished difference Result 49 states and 86 transitions. [2022-03-15 20:32:45,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-15 20:32:45,075 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 [2022-03-15 20:32:45,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:32:45,077 INFO L225 Difference]: With dead ends: 49 [2022-03-15 20:32:45,077 INFO L226 Difference]: Without dead ends: 46 [2022-03-15 20:32:45,077 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-15 20:32:45,078 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 16 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 20:32:45,079 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 6 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 20:32:45,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-03-15 20:32:45,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2022-03-15 20:32:45,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 42 states have (on average 1.9523809523809523) internal successors, (82), 45 states have internal predecessors, (82), 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) [2022-03-15 20:32:45,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 82 transitions. [2022-03-15 20:32:45,088 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 82 transitions. Word has length 4 [2022-03-15 20:32:45,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:32:45,088 INFO L470 AbstractCegarLoop]: Abstraction has 46 states and 82 transitions. [2022-03-15 20:32:45,088 INFO L471 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) [2022-03-15 20:32:45,088 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 82 transitions. [2022-03-15 20:32:45,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-03-15 20:32:45,089 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:32:45,089 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2022-03-15 20:32:45,089 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-03-15 20:32:45,090 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting threadErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, threadErr0ASSERT_VIOLATIONASSERT, threadErr0ASSERT_VIOLATIONASSERT (and 1 more)] === [2022-03-15 20:32:45,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:32:45,090 INFO L85 PathProgramCache]: Analyzing trace with hash -1349902552, now seen corresponding path program 1 times [2022-03-15 20:32:45,091 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:32:45,091 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468333037] [2022-03-15 20:32:45,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:32:45,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:32:45,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-03-15 20:32:45,099 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-03-15 20:32:45,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-03-15 20:32:45,105 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-03-15 20:32:45,105 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-03-15 20:32:45,106 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location threadErr0ASSERT_VIOLATIONASSERT (4 of 5 remaining) [2022-03-15 20:32:45,106 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (3 of 5 remaining) [2022-03-15 20:32:45,106 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION (2 of 5 remaining) [2022-03-15 20:32:45,107 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONASSERT (1 of 5 remaining) [2022-03-15 20:32:45,107 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONASSERT (0 of 5 remaining) [2022-03-15 20:32:45,107 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-03-15 20:32:45,107 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1] [2022-03-15 20:32:45,111 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2022-03-15 20:32:45,111 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-15 20:32:45,121 INFO L202 PluginConnector]: Adding new model single_assertion_test.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.03 08:32:45 BasicIcfg [2022-03-15 20:32:45,121 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-15 20:32:45,122 INFO L158 Benchmark]: Toolchain (without parser) took 1231.94ms. Allocated memory was 174.1MB in the beginning and 253.8MB in the end (delta: 79.7MB). Free memory was 132.6MB in the beginning and 201.2MB in the end (delta: -68.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-03-15 20:32:45,122 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.12ms. Allocated memory is still 174.1MB. Free memory is still 133.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-03-15 20:32:45,123 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.05ms. Allocated memory is still 174.1MB. Free memory was 132.6MB in the beginning and 131.0MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-15 20:32:45,123 INFO L158 Benchmark]: Boogie Preprocessor took 12.33ms. Allocated memory is still 174.1MB. Free memory was 131.0MB in the beginning and 130.1MB in the end (delta: 923.4kB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-03-15 20:32:45,124 INFO L158 Benchmark]: RCFGBuilder took 198.01ms. Allocated memory is still 174.1MB. Free memory was 130.0MB in the beginning and 121.9MB in the end (delta: 8.1MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2022-03-15 20:32:45,124 INFO L158 Benchmark]: TraceAbstraction took 994.12ms. Allocated memory was 174.1MB in the beginning and 253.8MB in the end (delta: 79.7MB). Free memory was 121.4MB in the beginning and 201.2MB in the end (delta: -79.8MB). Peak memory consumption was 13.2kB. Max. memory is 8.0GB. [2022-03-15 20:32:45,126 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.12ms. Allocated memory is still 174.1MB. Free memory is still 133.6MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 23.05ms. Allocated memory is still 174.1MB. Free memory was 132.6MB in the beginning and 131.0MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 12.33ms. Allocated memory is still 174.1MB. Free memory was 131.0MB in the beginning and 130.1MB in the end (delta: 923.4kB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 198.01ms. Allocated memory is still 174.1MB. Free memory was 130.0MB in the beginning and 121.9MB in the end (delta: 8.1MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * TraceAbstraction took 994.12ms. Allocated memory was 174.1MB in the beginning and 253.8MB in the end (delta: 79.7MB). Free memory was 121.4MB in the beginning and 201.2MB in the end (delta: -79.8MB). Peak memory consumption was 13.2kB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 19 PlacesBefore, 15 PlacesAfterwards, 16 TransitionsBefore, 12 TransitionsAfterwards, 32 CoEnabledTransitionPairs, 2 FixpointIterations, 2 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, 47 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 47, positive: 47, positive conditional: 0, positive unconditional: 47, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 14, positive: 14, positive conditional: 0, positive unconditional: 14, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 47, positive: 33, positive conditional: 0, positive unconditional: 33, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 14, unknown conditional: 0, unknown unconditional: 14] , Statistics on independence cache: Total cache size (in pairs): 6, Positive cache size: 6, Positive conditional cache size: 0, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 26 PlacesBefore, 20 PlacesAfterwards, 23 TransitionsBefore, 17 TransitionsAfterwards, 120 CoEnabledTransitionPairs, 2 FixpointIterations, 2 TrivialSequentialCompositions, 6 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 8 TotalNumberOfCompositions, 315 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 274, positive: 264, positive conditional: 0, positive unconditional: 264, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 77, positive: 73, positive conditional: 0, positive unconditional: 73, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 274, positive: 191, positive conditional: 0, positive unconditional: 191, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 77, unknown conditional: 0, unknown unconditional: 77] , Statistics on independence cache: Total cache size (in pairs): 17, Positive cache size: 16, Positive conditional cache size: 0, Positive unconditional cache size: 16, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 41]: assertion can be violated assertion can be violated We found a FailurePath: [L19] 0 x := 0; [L21] 0 i := 0; VAL [i=0, x=0] [L22] COND TRUE 0 i < 2 VAL [i=0, x=0] [L24] FORK 0 fork i thread(i); VAL [i=0, i=0, x=0] [L25] 0 i := i + 1; VAL [i=1, i=0, x=0] [L22] COND TRUE 0 i < 2 VAL [i=0, i=1, x=0] [L24] FORK 0 fork i thread(i); VAL [i=1, i=1, x=0] [L38] 2 x := x + 1; [L41] 2 assert i == 0; VAL [i=1, i=1, x=1] - UnprovableResult [Line: 32]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: Not analyzed. - UnprovableResult [Line: 24]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 22 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 0.6s, OverallIterations: 2, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.3s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 8 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 8 mSDsluCounter, 4 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 13 IncrementalHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 3 mSDtfsCounter, 13 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=20occurred in iteration=0, InterpolantAutomatonStates: 5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 10 NumberOfCodeBlocks, 10 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 3 ConstructedInterpolants, 0 QuantifiedInterpolants, 23 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data with 2 thread instances CFG has 4 procedures, 27 locations, 5 error locations. Started 1 CEGAR loops. OverallTime: 0.2s, OverallIterations: 2, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 16 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 16 mSDsluCounter, 6 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 25 IncrementalHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 4 mSDtfsCounter, 25 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=70occurred in iteration=0, InterpolantAutomatonStates: 5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 11 NumberOfCodeBlocks, 11 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 3 ConstructedInterpolants, 0 QuantifiedInterpolants, 23 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 RESULT: Ultimate proved your program to be incorrect! [2022-03-15 20:32:45,162 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...