/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf --rcfgbuilder.only.consider.context.switches.at.boundaries.of.atomic.blocks true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix035.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.dk.datarace-free-lbe-02cf818-m [2023-11-17 11:26:06,988 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-17 11:26:07,058 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf [2023-11-17 11:26:07,085 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-17 11:26:07,086 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-17 11:26:07,086 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-17 11:26:07,086 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-17 11:26:07,087 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-17 11:26:07,087 INFO L153 SettingsManager]: * Use SBE=true [2023-11-17 11:26:07,090 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-17 11:26:07,091 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-17 11:26:07,091 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-17 11:26:07,091 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-17 11:26:07,092 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-17 11:26:07,092 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-17 11:26:07,092 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-17 11:26:07,092 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-17 11:26:07,093 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-17 11:26:07,093 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-17 11:26:07,093 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-17 11:26:07,093 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-17 11:26:07,094 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-17 11:26:07,094 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-17 11:26:07,094 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-17 11:26:07,094 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-17 11:26:07,094 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 11:26:07,095 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-17 11:26:07,095 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-17 11:26:07,096 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-17 11:26:07,096 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-17 11:26:07,097 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-17 11:26:07,097 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-17 11:26:07,097 INFO L153 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Only consider context switches at boundaries of atomic blocks -> true [2023-11-17 11:26:07,319 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-17 11:26:07,340 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-17 11:26:07,342 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-17 11:26:07,342 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-17 11:26:07,343 INFO L274 PluginConnector]: CDTParser initialized [2023-11-17 11:26:07,343 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix035.oepc.i [2023-11-17 11:26:08,339 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-17 11:26:08,572 INFO L384 CDTParser]: Found 1 translation units. [2023-11-17 11:26:08,573 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix035.oepc.i [2023-11-17 11:26:08,587 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b30191949/18cf35489a0c4fdb831bb281a69eb419/FLAGc79b75c10 [2023-11-17 11:26:08,596 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b30191949/18cf35489a0c4fdb831bb281a69eb419 [2023-11-17 11:26:08,597 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-17 11:26:08,598 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-17 11:26:08,600 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-17 11:26:08,600 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-17 11:26:08,603 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-17 11:26:08,603 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 11:26:08" (1/1) ... [2023-11-17 11:26:08,604 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13c081e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:26:08, skipping insertion in model container [2023-11-17 11:26:08,604 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 11:26:08" (1/1) ... [2023-11-17 11:26:08,645 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-17 11:26:08,755 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix035.oepc.i[945,958] [2023-11-17 11:26:08,935 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 11:26:08,948 INFO L202 MainTranslator]: Completed pre-run [2023-11-17 11:26:08,958 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix035.oepc.i[945,958] [2023-11-17 11:26:09,007 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 11:26:09,040 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-17 11:26:09,040 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-17 11:26:09,045 INFO L206 MainTranslator]: Completed translation [2023-11-17 11:26:09,046 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:26:09 WrapperNode [2023-11-17 11:26:09,046 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-17 11:26:09,047 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-17 11:26:09,047 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-17 11:26:09,047 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-17 11:26:09,051 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:26:09" (1/1) ... [2023-11-17 11:26:09,076 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:26:09" (1/1) ... [2023-11-17 11:26:09,102 INFO L138 Inliner]: procedures = 176, calls = 58, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 130 [2023-11-17 11:26:09,103 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-17 11:26:09,103 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-17 11:26:09,104 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-17 11:26:09,104 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-17 11:26:09,110 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:26:09" (1/1) ... [2023-11-17 11:26:09,110 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:26:09" (1/1) ... [2023-11-17 11:26:09,123 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:26:09" (1/1) ... [2023-11-17 11:26:09,123 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:26:09" (1/1) ... [2023-11-17 11:26:09,128 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:26:09" (1/1) ... [2023-11-17 11:26:09,129 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:26:09" (1/1) ... [2023-11-17 11:26:09,130 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:26:09" (1/1) ... [2023-11-17 11:26:09,131 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:26:09" (1/1) ... [2023-11-17 11:26:09,137 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-17 11:26:09,137 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-17 11:26:09,138 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-17 11:26:09,138 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-17 11:26:09,138 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:26:09" (1/1) ... [2023-11-17 11:26:09,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 11:26:09,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 11:26:09,167 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) [2023-11-17 11:26:09,187 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 [2023-11-17 11:26:09,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-17 11:26:09,192 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-17 11:26:09,193 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-17 11:26:09,193 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-17 11:26:09,193 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-17 11:26:09,193 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-17 11:26:09,194 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-17 11:26:09,194 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-17 11:26:09,194 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-17 11:26:09,194 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-17 11:26:09,194 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-17 11:26:09,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-17 11:26:09,194 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-17 11:26:09,194 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-17 11:26:09,194 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-17 11:26:09,195 WARN L211 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-17 11:26:09,324 INFO L239 CfgBuilder]: Building ICFG [2023-11-17 11:26:09,326 INFO L265 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-17 11:26:09,717 INFO L280 CfgBuilder]: Performing block encoding [2023-11-17 11:26:09,916 INFO L302 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-17 11:26:09,916 INFO L307 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-17 11:26:09,917 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 11:26:09 BoogieIcfgContainer [2023-11-17 11:26:09,917 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-17 11:26:09,919 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-17 11:26:09,919 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-17 11:26:09,921 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-17 11:26:09,922 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 11:26:08" (1/3) ... [2023-11-17 11:26:09,922 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@475533c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 11:26:09, skipping insertion in model container [2023-11-17 11:26:09,923 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:26:09" (2/3) ... [2023-11-17 11:26:09,923 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@475533c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 11:26:09, skipping insertion in model container [2023-11-17 11:26:09,923 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 11:26:09" (3/3) ... [2023-11-17 11:26:09,924 INFO L112 eAbstractionObserver]: Analyzing ICFG mix035.oepc.i [2023-11-17 11:26:09,936 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-17 11:26:09,936 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-17 11:26:09,936 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-17 11:26:09,972 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-17 11:26:10,000 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 96 flow [2023-11-17 11:26:10,030 INFO L124 PetriNetUnfolderBase]: 2/39 cut-off events. [2023-11-17 11:26:10,031 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 11:26:10,036 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49 conditions, 39 events. 2/39 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 69 event pairs, 0 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 41. Up to 2 conditions per place. [2023-11-17 11:26:10,036 INFO L82 GeneralOperation]: Start removeDead. Operand has 50 places, 42 transitions, 96 flow [2023-11-17 11:26:10,040 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 47 places, 39 transitions, 87 flow [2023-11-17 11:26:10,061 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-11-17 11:26:10,072 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 39 transitions, 87 flow [2023-11-17 11:26:10,074 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 39 transitions, 87 flow [2023-11-17 11:26:10,074 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 39 transitions, 87 flow [2023-11-17 11:26:10,088 INFO L124 PetriNetUnfolderBase]: 2/39 cut-off events. [2023-11-17 11:26:10,088 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 11:26:10,089 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49 conditions, 39 events. 2/39 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 69 event pairs, 0 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 41. Up to 2 conditions per place. [2023-11-17 11:26:10,090 INFO L119 LiptonReduction]: Number of co-enabled transitions 892 [2023-11-17 11:26:10,954 INFO L134 LiptonReduction]: Checked pairs total: 2787 [2023-11-17 11:26:10,954 INFO L136 LiptonReduction]: Total number of compositions: 23 [2023-11-17 11:26:10,972 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-17 11:26:10,978 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@66834e23, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-17 11:26:10,978 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-11-17 11:26:10,980 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-17 11:26:10,981 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2023-11-17 11:26:10,981 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 11:26:10,981 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:26:10,981 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-11-17 11:26:10,982 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 11:26:10,985 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:26:10,985 INFO L85 PathProgramCache]: Analyzing trace with hash 371332, now seen corresponding path program 1 times [2023-11-17 11:26:10,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:26:10,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801194304] [2023-11-17 11:26:10,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:26:10,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:26:11,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:26:11,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:26:11,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:26:11,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801194304] [2023-11-17 11:26:11,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801194304] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:26:11,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:26:11,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-17 11:26:11,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184793519] [2023-11-17 11:26:11,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:26:11,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 11:26:11,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:26:11,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 11:26:11,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 11:26:11,329 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 65 [2023-11-17 11:26:11,330 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 25 transitions, 59 flow. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 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) [2023-11-17 11:26:11,330 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:26:11,330 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 65 [2023-11-17 11:26:11,331 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:26:11,673 INFO L124 PetriNetUnfolderBase]: 895/1369 cut-off events. [2023-11-17 11:26:11,674 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2023-11-17 11:26:11,678 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2752 conditions, 1369 events. 895/1369 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 6110 event pairs, 400 based on Foata normal form. 0/1283 useless extension candidates. Maximal degree in co-relation 2741. Up to 1084 conditions per place. [2023-11-17 11:26:11,684 INFO L140 encePairwiseOnDemand]: 61/65 looper letters, 31 selfloop transitions, 2 changer transitions 2/38 dead transitions. [2023-11-17 11:26:11,685 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 38 transitions, 161 flow [2023-11-17 11:26:11,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 11:26:11,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 11:26:11,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 97 transitions. [2023-11-17 11:26:11,694 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49743589743589745 [2023-11-17 11:26:11,694 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 97 transitions. [2023-11-17 11:26:11,694 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 97 transitions. [2023-11-17 11:26:11,695 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:26:11,697 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 97 transitions. [2023-11-17 11:26:11,699 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 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) [2023-11-17 11:26:11,702 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 65.0) internal successors, (260), 4 states have internal predecessors, (260), 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) [2023-11-17 11:26:11,702 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 65.0) internal successors, (260), 4 states have internal predecessors, (260), 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) [2023-11-17 11:26:11,703 INFO L175 Difference]: Start difference. First operand has 34 places, 25 transitions, 59 flow. Second operand 3 states and 97 transitions. [2023-11-17 11:26:11,704 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 38 transitions, 161 flow [2023-11-17 11:26:11,705 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 38 transitions, 156 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-17 11:26:11,707 INFO L231 Difference]: Finished difference. Result has 32 places, 22 transitions, 54 flow [2023-11-17 11:26:11,708 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=54, PETRI_PLACES=32, PETRI_TRANSITIONS=22} [2023-11-17 11:26:11,710 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, -2 predicate places. [2023-11-17 11:26:11,710 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 22 transitions, 54 flow [2023-11-17 11:26:11,711 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 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) [2023-11-17 11:26:11,711 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:26:11,711 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:26:11,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-17 11:26:11,711 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 11:26:11,717 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:26:11,717 INFO L85 PathProgramCache]: Analyzing trace with hash -1760340278, now seen corresponding path program 1 times [2023-11-17 11:26:11,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:26:11,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495021800] [2023-11-17 11:26:11,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:26:11,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:26:11,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:26:11,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:26:11,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:26:11,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495021800] [2023-11-17 11:26:11,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495021800] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:26:11,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:26:11,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-17 11:26:11,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578388757] [2023-11-17 11:26:11,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:26:11,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 11:26:11,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:26:11,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 11:26:11,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 11:26:11,889 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 65 [2023-11-17 11:26:11,889 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 22 transitions, 54 flow. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 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) [2023-11-17 11:26:11,889 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:26:11,889 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 65 [2023-11-17 11:26:11,889 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:26:12,059 INFO L124 PetriNetUnfolderBase]: 775/1172 cut-off events. [2023-11-17 11:26:12,059 INFO L125 PetriNetUnfolderBase]: For 97/97 co-relation queries the response was YES. [2023-11-17 11:26:12,061 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2484 conditions, 1172 events. 775/1172 cut-off events. For 97/97 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 4938 event pairs, 263 based on Foata normal form. 32/1199 useless extension candidates. Maximal degree in co-relation 2474. Up to 817 conditions per place. [2023-11-17 11:26:12,066 INFO L140 encePairwiseOnDemand]: 62/65 looper letters, 26 selfloop transitions, 2 changer transitions 0/30 dead transitions. [2023-11-17 11:26:12,067 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 30 transitions, 128 flow [2023-11-17 11:26:12,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 11:26:12,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 11:26:12,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 83 transitions. [2023-11-17 11:26:12,070 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4256410256410256 [2023-11-17 11:26:12,070 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 83 transitions. [2023-11-17 11:26:12,070 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 83 transitions. [2023-11-17 11:26:12,072 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:26:12,072 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 83 transitions. [2023-11-17 11:26:12,073 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 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) [2023-11-17 11:26:12,073 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 65.0) internal successors, (260), 4 states have internal predecessors, (260), 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) [2023-11-17 11:26:12,074 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 65.0) internal successors, (260), 4 states have internal predecessors, (260), 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) [2023-11-17 11:26:12,074 INFO L175 Difference]: Start difference. First operand has 32 places, 22 transitions, 54 flow. Second operand 3 states and 83 transitions. [2023-11-17 11:26:12,074 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 30 transitions, 128 flow [2023-11-17 11:26:12,074 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 30 transitions, 122 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-17 11:26:12,075 INFO L231 Difference]: Finished difference. Result has 32 places, 22 transitions, 58 flow [2023-11-17 11:26:12,075 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=58, PETRI_PLACES=32, PETRI_TRANSITIONS=22} [2023-11-17 11:26:12,076 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, -2 predicate places. [2023-11-17 11:26:12,076 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 22 transitions, 58 flow [2023-11-17 11:26:12,077 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 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) [2023-11-17 11:26:12,077 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:26:12,077 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:26:12,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-17 11:26:12,078 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 11:26:12,080 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:26:12,081 INFO L85 PathProgramCache]: Analyzing trace with hash 530343058, now seen corresponding path program 1 times [2023-11-17 11:26:12,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:26:12,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957887207] [2023-11-17 11:26:12,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:26:12,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:26:12,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:26:12,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:26:12,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:26:12,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957887207] [2023-11-17 11:26:12,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957887207] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:26:12,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:26:12,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 11:26:12,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430075942] [2023-11-17 11:26:12,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:26:12,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 11:26:12,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:26:12,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 11:26:12,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-17 11:26:12,278 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 65 [2023-11-17 11:26:12,278 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 22 transitions, 58 flow. Second operand has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 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) [2023-11-17 11:26:12,278 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:26:12,279 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 65 [2023-11-17 11:26:12,279 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:26:12,465 INFO L124 PetriNetUnfolderBase]: 514/862 cut-off events. [2023-11-17 11:26:12,465 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 11:26:12,466 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1822 conditions, 862 events. 514/862 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 4138 event pairs, 145 based on Foata normal form. 80/936 useless extension candidates. Maximal degree in co-relation 1811. Up to 341 conditions per place. [2023-11-17 11:26:12,469 INFO L140 encePairwiseOnDemand]: 59/65 looper letters, 38 selfloop transitions, 5 changer transitions 1/47 dead transitions. [2023-11-17 11:26:12,469 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 47 transitions, 200 flow [2023-11-17 11:26:12,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 11:26:12,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-17 11:26:12,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 110 transitions. [2023-11-17 11:26:12,473 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4230769230769231 [2023-11-17 11:26:12,474 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 110 transitions. [2023-11-17 11:26:12,474 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 110 transitions. [2023-11-17 11:26:12,474 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:26:12,474 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 110 transitions. [2023-11-17 11:26:12,476 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 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) [2023-11-17 11:26:12,476 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 65.0) internal successors, (325), 5 states have internal predecessors, (325), 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) [2023-11-17 11:26:12,477 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 65.0) internal successors, (325), 5 states have internal predecessors, (325), 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) [2023-11-17 11:26:12,477 INFO L175 Difference]: Start difference. First operand has 32 places, 22 transitions, 58 flow. Second operand 4 states and 110 transitions. [2023-11-17 11:26:12,477 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 47 transitions, 200 flow [2023-11-17 11:26:12,479 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 47 transitions, 196 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-17 11:26:12,479 INFO L231 Difference]: Finished difference. Result has 35 places, 25 transitions, 88 flow [2023-11-17 11:26:12,480 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=88, PETRI_PLACES=35, PETRI_TRANSITIONS=25} [2023-11-17 11:26:12,480 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 1 predicate places. [2023-11-17 11:26:12,480 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 25 transitions, 88 flow [2023-11-17 11:26:12,480 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 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) [2023-11-17 11:26:12,480 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:26:12,481 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:26:12,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-17 11:26:12,481 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 11:26:12,481 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:26:12,482 INFO L85 PathProgramCache]: Analyzing trace with hash -1863551901, now seen corresponding path program 1 times [2023-11-17 11:26:12,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:26:12,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532276979] [2023-11-17 11:26:12,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:26:12,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:26:12,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:26:12,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:26:12,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:26:12,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532276979] [2023-11-17 11:26:12,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532276979] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:26:12,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:26:12,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-17 11:26:12,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950785610] [2023-11-17 11:26:12,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:26:12,690 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-17 11:26:12,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:26:12,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-17 11:26:12,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-17 11:26:12,692 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 65 [2023-11-17 11:26:12,692 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 25 transitions, 88 flow. Second operand has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 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) [2023-11-17 11:26:12,692 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:26:12,693 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 65 [2023-11-17 11:26:12,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:26:12,844 INFO L124 PetriNetUnfolderBase]: 253/463 cut-off events. [2023-11-17 11:26:12,844 INFO L125 PetriNetUnfolderBase]: For 163/163 co-relation queries the response was YES. [2023-11-17 11:26:12,844 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1244 conditions, 463 events. 253/463 cut-off events. For 163/163 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 2007 event pairs, 68 based on Foata normal form. 44/502 useless extension candidates. Maximal degree in co-relation 1231. Up to 194 conditions per place. [2023-11-17 11:26:12,846 INFO L140 encePairwiseOnDemand]: 59/65 looper letters, 47 selfloop transitions, 8 changer transitions 1/59 dead transitions. [2023-11-17 11:26:12,846 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 59 transitions, 289 flow [2023-11-17 11:26:12,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 11:26:12,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 11:26:12,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 138 transitions. [2023-11-17 11:26:12,857 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4246153846153846 [2023-11-17 11:26:12,857 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 138 transitions. [2023-11-17 11:26:12,858 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 138 transitions. [2023-11-17 11:26:12,858 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:26:12,858 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 138 transitions. [2023-11-17 11:26:12,858 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 27.6) internal successors, (138), 5 states have internal predecessors, (138), 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) [2023-11-17 11:26:12,859 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 65.0) internal successors, (390), 6 states have internal predecessors, (390), 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) [2023-11-17 11:26:12,859 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 65.0) internal successors, (390), 6 states have internal predecessors, (390), 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) [2023-11-17 11:26:12,859 INFO L175 Difference]: Start difference. First operand has 35 places, 25 transitions, 88 flow. Second operand 5 states and 138 transitions. [2023-11-17 11:26:12,859 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 59 transitions, 289 flow [2023-11-17 11:26:12,860 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 59 transitions, 279 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-11-17 11:26:12,861 INFO L231 Difference]: Finished difference. Result has 39 places, 28 transitions, 128 flow [2023-11-17 11:26:12,861 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=128, PETRI_PLACES=39, PETRI_TRANSITIONS=28} [2023-11-17 11:26:12,862 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 5 predicate places. [2023-11-17 11:26:12,862 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 28 transitions, 128 flow [2023-11-17 11:26:12,862 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 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) [2023-11-17 11:26:12,862 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:26:12,862 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:26:12,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-17 11:26:12,862 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 11:26:12,863 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:26:12,863 INFO L85 PathProgramCache]: Analyzing trace with hash 1971669446, now seen corresponding path program 1 times [2023-11-17 11:26:12,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:26:12,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157210938] [2023-11-17 11:26:12,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:26:12,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:26:12,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:26:13,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:26:13,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:26:13,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157210938] [2023-11-17 11:26:13,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157210938] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:26:13,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:26:13,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-17 11:26:13,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238613117] [2023-11-17 11:26:13,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:26:13,343 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-17 11:26:13,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:26:13,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-17 11:26:13,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-17 11:26:13,344 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 65 [2023-11-17 11:26:13,344 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 28 transitions, 128 flow. Second operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 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) [2023-11-17 11:26:13,344 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:26:13,344 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 65 [2023-11-17 11:26:13,344 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:26:13,564 INFO L124 PetriNetUnfolderBase]: 315/628 cut-off events. [2023-11-17 11:26:13,565 INFO L125 PetriNetUnfolderBase]: For 713/713 co-relation queries the response was YES. [2023-11-17 11:26:13,567 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1945 conditions, 628 events. 315/628 cut-off events. For 713/713 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 3124 event pairs, 73 based on Foata normal form. 7/631 useless extension candidates. Maximal degree in co-relation 1930. Up to 284 conditions per place. [2023-11-17 11:26:13,570 INFO L140 encePairwiseOnDemand]: 58/65 looper letters, 53 selfloop transitions, 9 changer transitions 24/89 dead transitions. [2023-11-17 11:26:13,570 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 89 transitions, 618 flow [2023-11-17 11:26:13,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-17 11:26:13,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-17 11:26:13,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 179 transitions. [2023-11-17 11:26:13,571 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45897435897435895 [2023-11-17 11:26:13,571 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 179 transitions. [2023-11-17 11:26:13,571 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 179 transitions. [2023-11-17 11:26:13,571 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:26:13,571 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 179 transitions. [2023-11-17 11:26:13,572 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 29.833333333333332) internal successors, (179), 6 states have internal predecessors, (179), 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) [2023-11-17 11:26:13,573 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 65.0) internal successors, (455), 7 states have internal predecessors, (455), 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) [2023-11-17 11:26:13,574 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 65.0) internal successors, (455), 7 states have internal predecessors, (455), 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) [2023-11-17 11:26:13,574 INFO L175 Difference]: Start difference. First operand has 39 places, 28 transitions, 128 flow. Second operand 6 states and 179 transitions. [2023-11-17 11:26:13,574 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 89 transitions, 618 flow [2023-11-17 11:26:13,579 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 89 transitions, 526 flow, removed 18 selfloop flow, removed 4 redundant places. [2023-11-17 11:26:13,580 INFO L231 Difference]: Finished difference. Result has 43 places, 36 transitions, 172 flow [2023-11-17 11:26:13,580 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=172, PETRI_PLACES=43, PETRI_TRANSITIONS=36} [2023-11-17 11:26:13,582 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 9 predicate places. [2023-11-17 11:26:13,582 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 36 transitions, 172 flow [2023-11-17 11:26:13,582 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 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) [2023-11-17 11:26:13,583 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:26:13,583 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:26:13,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-17 11:26:13,583 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 11:26:13,583 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:26:13,583 INFO L85 PathProgramCache]: Analyzing trace with hash 2107703812, now seen corresponding path program 2 times [2023-11-17 11:26:13,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:26:13,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186237059] [2023-11-17 11:26:13,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:26:13,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:26:13,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:26:13,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:26:13,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:26:13,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186237059] [2023-11-17 11:26:13,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186237059] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:26:13,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:26:13,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-17 11:26:13,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917800753] [2023-11-17 11:26:13,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:26:13,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-17 11:26:13,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:26:13,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-17 11:26:13,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-17 11:26:13,799 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 65 [2023-11-17 11:26:13,799 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 36 transitions, 172 flow. Second operand has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 6 states have internal predecessors, (112), 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) [2023-11-17 11:26:13,799 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:26:13,799 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 65 [2023-11-17 11:26:13,799 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:26:13,918 INFO L124 PetriNetUnfolderBase]: 235/464 cut-off events. [2023-11-17 11:26:13,919 INFO L125 PetriNetUnfolderBase]: For 539/539 co-relation queries the response was YES. [2023-11-17 11:26:13,919 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1503 conditions, 464 events. 235/464 cut-off events. For 539/539 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2126 event pairs, 58 based on Foata normal form. 21/480 useless extension candidates. Maximal degree in co-relation 1490. Up to 173 conditions per place. [2023-11-17 11:26:13,921 INFO L140 encePairwiseOnDemand]: 59/65 looper letters, 50 selfloop transitions, 11 changer transitions 1/65 dead transitions. [2023-11-17 11:26:13,921 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 65 transitions, 409 flow [2023-11-17 11:26:13,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-17 11:26:13,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-17 11:26:13,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 144 transitions. [2023-11-17 11:26:13,922 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36923076923076925 [2023-11-17 11:26:13,922 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 144 transitions. [2023-11-17 11:26:13,922 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 144 transitions. [2023-11-17 11:26:13,922 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:26:13,922 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 144 transitions. [2023-11-17 11:26:13,923 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 24.0) internal successors, (144), 6 states have internal predecessors, (144), 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) [2023-11-17 11:26:13,924 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 65.0) internal successors, (455), 7 states have internal predecessors, (455), 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) [2023-11-17 11:26:13,924 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 65.0) internal successors, (455), 7 states have internal predecessors, (455), 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) [2023-11-17 11:26:13,925 INFO L175 Difference]: Start difference. First operand has 43 places, 36 transitions, 172 flow. Second operand 6 states and 144 transitions. [2023-11-17 11:26:13,925 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 65 transitions, 409 flow [2023-11-17 11:26:13,926 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 65 transitions, 403 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-11-17 11:26:13,927 INFO L231 Difference]: Finished difference. Result has 46 places, 35 transitions, 197 flow [2023-11-17 11:26:13,927 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=157, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=197, PETRI_PLACES=46, PETRI_TRANSITIONS=35} [2023-11-17 11:26:13,928 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 12 predicate places. [2023-11-17 11:26:13,928 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 35 transitions, 197 flow [2023-11-17 11:26:13,929 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 6 states have internal predecessors, (112), 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) [2023-11-17 11:26:13,929 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:26:13,929 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:26:13,929 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-17 11:26:13,929 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 11:26:13,929 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:26:13,929 INFO L85 PathProgramCache]: Analyzing trace with hash -1087181504, now seen corresponding path program 1 times [2023-11-17 11:26:13,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:26:13,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319511359] [2023-11-17 11:26:13,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:26:13,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:26:13,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:26:14,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:26:14,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:26:14,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319511359] [2023-11-17 11:26:14,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319511359] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:26:14,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:26:14,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 11:26:14,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051084350] [2023-11-17 11:26:14,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:26:14,073 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 11:26:14,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:26:14,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 11:26:14,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-17 11:26:14,074 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 65 [2023-11-17 11:26:14,074 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 35 transitions, 197 flow. Second operand has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 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) [2023-11-17 11:26:14,074 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:26:14,074 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 65 [2023-11-17 11:26:14,074 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:26:14,185 INFO L124 PetriNetUnfolderBase]: 380/735 cut-off events. [2023-11-17 11:26:14,185 INFO L125 PetriNetUnfolderBase]: For 1130/1130 co-relation queries the response was YES. [2023-11-17 11:26:14,186 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2559 conditions, 735 events. 380/735 cut-off events. For 1130/1130 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3728 event pairs, 43 based on Foata normal form. 1/736 useless extension candidates. Maximal degree in co-relation 2541. Up to 316 conditions per place. [2023-11-17 11:26:14,187 INFO L140 encePairwiseOnDemand]: 62/65 looper letters, 45 selfloop transitions, 1 changer transitions 27/75 dead transitions. [2023-11-17 11:26:14,188 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 75 transitions, 578 flow [2023-11-17 11:26:14,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 11:26:14,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-17 11:26:14,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 111 transitions. [2023-11-17 11:26:14,188 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4269230769230769 [2023-11-17 11:26:14,188 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 111 transitions. [2023-11-17 11:26:14,189 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 111 transitions. [2023-11-17 11:26:14,189 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:26:14,189 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 111 transitions. [2023-11-17 11:26:14,189 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 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) [2023-11-17 11:26:14,189 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 65.0) internal successors, (325), 5 states have internal predecessors, (325), 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) [2023-11-17 11:26:14,190 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 65.0) internal successors, (325), 5 states have internal predecessors, (325), 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) [2023-11-17 11:26:14,190 INFO L175 Difference]: Start difference. First operand has 46 places, 35 transitions, 197 flow. Second operand 4 states and 111 transitions. [2023-11-17 11:26:14,190 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 75 transitions, 578 flow [2023-11-17 11:26:14,192 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 75 transitions, 440 flow, removed 24 selfloop flow, removed 9 redundant places. [2023-11-17 11:26:14,193 INFO L231 Difference]: Finished difference. Result has 42 places, 34 transitions, 133 flow [2023-11-17 11:26:14,193 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=131, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=133, PETRI_PLACES=42, PETRI_TRANSITIONS=34} [2023-11-17 11:26:14,194 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 8 predicate places. [2023-11-17 11:26:14,194 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 34 transitions, 133 flow [2023-11-17 11:26:14,194 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 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) [2023-11-17 11:26:14,194 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:26:14,194 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:26:14,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-17 11:26:14,194 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 11:26:14,194 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:26:14,195 INFO L85 PathProgramCache]: Analyzing trace with hash 451410268, now seen corresponding path program 2 times [2023-11-17 11:26:14,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:26:14,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001773605] [2023-11-17 11:26:14,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:26:14,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:26:14,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:26:14,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:26:14,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:26:14,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001773605] [2023-11-17 11:26:14,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001773605] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:26:14,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:26:14,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 11:26:14,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566044714] [2023-11-17 11:26:14,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:26:14,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 11:26:14,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:26:14,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 11:26:14,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-17 11:26:14,323 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 65 [2023-11-17 11:26:14,323 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 34 transitions, 133 flow. Second operand has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 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) [2023-11-17 11:26:14,323 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:26:14,323 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 65 [2023-11-17 11:26:14,324 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:26:14,425 INFO L124 PetriNetUnfolderBase]: 333/663 cut-off events. [2023-11-17 11:26:14,425 INFO L125 PetriNetUnfolderBase]: For 543/544 co-relation queries the response was YES. [2023-11-17 11:26:14,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1951 conditions, 663 events. 333/663 cut-off events. For 543/544 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 3304 event pairs, 111 based on Foata normal form. 1/656 useless extension candidates. Maximal degree in co-relation 1940. Up to 268 conditions per place. [2023-11-17 11:26:14,427 INFO L140 encePairwiseOnDemand]: 62/65 looper letters, 37 selfloop transitions, 1 changer transitions 28/68 dead transitions. [2023-11-17 11:26:14,427 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 68 transitions, 413 flow [2023-11-17 11:26:14,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 11:26:14,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-17 11:26:14,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 106 transitions. [2023-11-17 11:26:14,428 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4076923076923077 [2023-11-17 11:26:14,428 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 106 transitions. [2023-11-17 11:26:14,428 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 106 transitions. [2023-11-17 11:26:14,428 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:26:14,428 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 106 transitions. [2023-11-17 11:26:14,429 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 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) [2023-11-17 11:26:14,429 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 65.0) internal successors, (325), 5 states have internal predecessors, (325), 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) [2023-11-17 11:26:14,429 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 65.0) internal successors, (325), 5 states have internal predecessors, (325), 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) [2023-11-17 11:26:14,429 INFO L175 Difference]: Start difference. First operand has 42 places, 34 transitions, 133 flow. Second operand 4 states and 106 transitions. [2023-11-17 11:26:14,429 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 68 transitions, 413 flow [2023-11-17 11:26:14,430 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 68 transitions, 405 flow, removed 3 selfloop flow, removed 2 redundant places. [2023-11-17 11:26:14,431 INFO L231 Difference]: Finished difference. Result has 44 places, 32 transitions, 125 flow [2023-11-17 11:26:14,431 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=125, PETRI_PLACES=44, PETRI_TRANSITIONS=32} [2023-11-17 11:26:14,431 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 10 predicate places. [2023-11-17 11:26:14,432 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 32 transitions, 125 flow [2023-11-17 11:26:14,432 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 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) [2023-11-17 11:26:14,432 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:26:14,432 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:26:14,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-17 11:26:14,432 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 11:26:14,432 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:26:14,432 INFO L85 PathProgramCache]: Analyzing trace with hash 1515015602, now seen corresponding path program 3 times [2023-11-17 11:26:14,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:26:14,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137415002] [2023-11-17 11:26:14,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:26:14,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:26:14,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:26:15,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:26:15,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:26:15,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137415002] [2023-11-17 11:26:15,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137415002] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:26:15,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:26:15,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-17 11:26:15,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438401603] [2023-11-17 11:26:15,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:26:15,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-17 11:26:15,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:26:15,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-17 11:26:15,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-17 11:26:15,197 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 65 [2023-11-17 11:26:15,197 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 32 transitions, 125 flow. Second operand has 7 states, 7 states have (on average 21.714285714285715) internal successors, (152), 7 states have internal predecessors, (152), 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) [2023-11-17 11:26:15,197 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:26:15,197 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 65 [2023-11-17 11:26:15,197 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:26:15,531 INFO L124 PetriNetUnfolderBase]: 230/503 cut-off events. [2023-11-17 11:26:15,531 INFO L125 PetriNetUnfolderBase]: For 420/447 co-relation queries the response was YES. [2023-11-17 11:26:15,532 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1524 conditions, 503 events. 230/503 cut-off events. For 420/447 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2497 event pairs, 45 based on Foata normal form. 24/521 useless extension candidates. Maximal degree in co-relation 1509. Up to 171 conditions per place. [2023-11-17 11:26:15,533 INFO L140 encePairwiseOnDemand]: 59/65 looper letters, 46 selfloop transitions, 5 changer transitions 33/87 dead transitions. [2023-11-17 11:26:15,533 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 87 transitions, 499 flow [2023-11-17 11:26:15,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-17 11:26:15,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-17 11:26:15,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 174 transitions. [2023-11-17 11:26:15,534 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4461538461538462 [2023-11-17 11:26:15,534 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 174 transitions. [2023-11-17 11:26:15,534 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 174 transitions. [2023-11-17 11:26:15,534 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:26:15,534 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 174 transitions. [2023-11-17 11:26:15,535 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 29.0) internal successors, (174), 6 states have internal predecessors, (174), 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) [2023-11-17 11:26:15,535 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 65.0) internal successors, (455), 7 states have internal predecessors, (455), 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) [2023-11-17 11:26:15,535 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 65.0) internal successors, (455), 7 states have internal predecessors, (455), 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) [2023-11-17 11:26:15,535 INFO L175 Difference]: Start difference. First operand has 44 places, 32 transitions, 125 flow. Second operand 6 states and 174 transitions. [2023-11-17 11:26:15,535 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 87 transitions, 499 flow [2023-11-17 11:26:15,536 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 87 transitions, 491 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-11-17 11:26:15,537 INFO L231 Difference]: Finished difference. Result has 49 places, 32 transitions, 142 flow [2023-11-17 11:26:15,537 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=142, PETRI_PLACES=49, PETRI_TRANSITIONS=32} [2023-11-17 11:26:15,538 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 15 predicate places. [2023-11-17 11:26:15,538 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 32 transitions, 142 flow [2023-11-17 11:26:15,538 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.714285714285715) internal successors, (152), 7 states have internal predecessors, (152), 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) [2023-11-17 11:26:15,538 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:26:15,538 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:26:15,538 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-17 11:26:15,538 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 11:26:15,539 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:26:15,539 INFO L85 PathProgramCache]: Analyzing trace with hash -484827138, now seen corresponding path program 4 times [2023-11-17 11:26:15,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:26:15,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028387997] [2023-11-17 11:26:15,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:26:15,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:26:15,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-17 11:26:15,607 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-17 11:26:15,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-17 11:26:15,700 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-17 11:26:15,700 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-17 11:26:15,701 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2023-11-17 11:26:15,702 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-11-17 11:26:15,702 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2023-11-17 11:26:15,702 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2023-11-17 11:26:15,702 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2023-11-17 11:26:15,702 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-11-17 11:26:15,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-17 11:26:15,702 INFO L445 BasicCegarLoop]: Path program histogram: [4, 2, 1, 1, 1, 1] [2023-11-17 11:26:15,706 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-17 11:26:15,706 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-17 11:26:15,758 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-17 11:26:15,760 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-17 11:26:15,760 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-17 11:26:15,778 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.11 11:26:15 BasicIcfg [2023-11-17 11:26:15,778 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-17 11:26:15,779 INFO L158 Benchmark]: Toolchain (without parser) took 7180.86ms. Allocated memory was 252.7MB in the beginning and 403.7MB in the end (delta: 151.0MB). Free memory was 207.2MB in the beginning and 238.4MB in the end (delta: -31.2MB). Peak memory consumption was 120.9MB. Max. memory is 8.0GB. [2023-11-17 11:26:15,779 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 177.2MB. Free memory is still 123.6MB. There was no memory consumed. Max. memory is 8.0GB. [2023-11-17 11:26:15,779 INFO L158 Benchmark]: CACSL2BoogieTranslator took 445.79ms. Allocated memory is still 252.7MB. Free memory was 206.7MB in the beginning and 183.6MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. [2023-11-17 11:26:15,779 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.38ms. Allocated memory is still 252.7MB. Free memory was 183.6MB in the beginning and 181.0MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-11-17 11:26:15,779 INFO L158 Benchmark]: Boogie Preprocessor took 33.53ms. Allocated memory is still 252.7MB. Free memory was 181.0MB in the beginning and 178.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-11-17 11:26:15,780 INFO L158 Benchmark]: RCFGBuilder took 779.98ms. Allocated memory is still 252.7MB. Free memory was 178.9MB in the beginning and 212.3MB in the end (delta: -33.5MB). Peak memory consumption was 50.4MB. Max. memory is 8.0GB. [2023-11-17 11:26:15,780 INFO L158 Benchmark]: TraceAbstraction took 5859.23ms. Allocated memory was 252.7MB in the beginning and 403.7MB in the end (delta: 151.0MB). Free memory was 211.8MB in the beginning and 238.4MB in the end (delta: -26.6MB). Peak memory consumption was 123.9MB. Max. memory is 8.0GB. [2023-11-17 11:26:15,781 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 177.2MB. Free memory is still 123.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 445.79ms. Allocated memory is still 252.7MB. Free memory was 206.7MB in the beginning and 183.6MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 56.38ms. Allocated memory is still 252.7MB. Free memory was 183.6MB in the beginning and 181.0MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 33.53ms. Allocated memory is still 252.7MB. Free memory was 181.0MB in the beginning and 178.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 779.98ms. Allocated memory is still 252.7MB. Free memory was 178.9MB in the beginning and 212.3MB in the end (delta: -33.5MB). Peak memory consumption was 50.4MB. Max. memory is 8.0GB. * TraceAbstraction took 5859.23ms. Allocated memory was 252.7MB in the beginning and 403.7MB in the end (delta: 151.0MB). Free memory was 211.8MB in the beginning and 238.4MB in the end (delta: -26.6MB). Peak memory consumption was 123.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.9s, 47 PlacesBefore, 34 PlacesAfterwards, 39 TransitionsBefore, 25 TransitionsAfterwards, 892 CoEnabledTransitionPairs, 4 FixpointIterations, 0 TrivialSequentialCompositions, 17 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 1 ChoiceCompositions, 23 TotalNumberOfCompositions, 2787 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1310, independent: 1194, independent conditional: 0, independent unconditional: 1194, dependent: 116, dependent conditional: 0, dependent unconditional: 116, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 654, independent: 611, independent conditional: 0, independent unconditional: 611, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 654, independent: 588, independent conditional: 0, independent unconditional: 588, dependent: 66, dependent conditional: 0, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 66, independent: 23, independent conditional: 0, independent unconditional: 23, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 237, independent: 22, independent conditional: 0, independent unconditional: 22, dependent: 214, dependent conditional: 0, dependent unconditional: 214, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1310, independent: 583, independent conditional: 0, independent unconditional: 583, dependent: 73, dependent conditional: 0, dependent unconditional: 73, unknown: 654, unknown conditional: 0, unknown unconditional: 654] , Statistics on independence cache: Total cache size (in pairs): 152, Positive cache size: 131, Positive conditional cache size: 0, Positive unconditional cache size: 131, Negative cache size: 21, Negative conditional cache size: 0, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L715] 0 int __unbuffered_p2_EAX = 0; [L717] 0 int __unbuffered_p2_EBX = 0; [L719] 0 int a = 0; [L720] 0 _Bool a$flush_delayed; [L721] 0 int a$mem_tmp; [L722] 0 _Bool a$r_buff0_thd0; [L723] 0 _Bool a$r_buff0_thd1; [L724] 0 _Bool a$r_buff0_thd2; [L725] 0 _Bool a$r_buff0_thd3; [L726] 0 _Bool a$r_buff1_thd0; [L727] 0 _Bool a$r_buff1_thd1; [L728] 0 _Bool a$r_buff1_thd2; [L729] 0 _Bool a$r_buff1_thd3; [L730] 0 _Bool a$read_delayed; [L731] 0 int *a$read_delayed_var; [L732] 0 int a$w_buff0; [L733] 0 _Bool a$w_buff0_used; [L734] 0 int a$w_buff1; [L735] 0 _Bool a$w_buff1_used; [L736] 0 _Bool main$tmp_guard0; [L737] 0 _Bool main$tmp_guard1; [L739] 0 int x = 0; [L741] 0 int y = 0; [L743] 0 int z = 0; [L744] 0 _Bool weak$$choice0; [L745] 0 _Bool weak$$choice2; [L845] 0 pthread_t t913; [L846] FCALL, FORK 0 pthread_create(&t913, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t913={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L847] 0 pthread_t t914; [L848] FCALL, FORK 0 pthread_create(&t914, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t913={5:0}, t914={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L849] 0 pthread_t t915; [L850] FCALL, FORK 0 pthread_create(&t915, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t913={5:0}, t914={6:0}, t915={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L749] 1 a$w_buff1 = a$w_buff0 [L750] 1 a$w_buff0 = 1 [L751] 1 a$w_buff1_used = a$w_buff0_used [L752] 1 a$w_buff0_used = (_Bool)1 [L753] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L753] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L754] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L755] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L756] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L757] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L758] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L761] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L778] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L781] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L798] 3 y = 1 [L801] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L804] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L807] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L808] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L809] 3 a$flush_delayed = weak$$choice2 [L810] 3 a$mem_tmp = a [L811] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L812] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L813] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L814] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L815] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L816] 3 a$r_buff0_thd3 = weak$$choice2 ? a$r_buff0_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff0_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3)) [L817] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L818] 3 __unbuffered_p2_EBX = a [L819] 3 a = a$flush_delayed ? a$mem_tmp : a [L820] 3 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z=1] [L823] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L824] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L825] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L826] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L827] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z=1] [L764] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L765] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L766] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L767] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L768] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z=1] [L771] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L773] 1 return 0; [L784] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L785] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L786] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L787] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L788] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z=1] [L791] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L793] 2 return 0; [L830] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L832] 3 return 0; [L852] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t913={5:0}, t914={6:0}, t915={3:0}, weak$$choice2=0, x=1, y=1, z=1] [L854] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L854] RET 0 assume_abort_if_not(main$tmp_guard0) [L856] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L857] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L858] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L859] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L860] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t913={5:0}, t914={6:0}, t915={3:0}, weak$$choice2=0, x=1, y=1, z=1] [L863] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L865] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 846]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 850]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 848]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 68 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 5.7s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 1.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 266 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 266 mSDsluCounter, 3 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 29 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 766 IncrementalHoareTripleChecker+Invalid, 795 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 29 mSolverCounterUnsat, 3 mSDtfsCounter, 766 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 39 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=197occurred in iteration=6, InterpolantAutomatonStates: 41, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 161 NumberOfCodeBlocks, 161 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 130 ConstructedInterpolants, 0 QuantifiedInterpolants, 988 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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! [2023-11-17 11:26:15,807 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...