/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 -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix037_power.oepc_pso.oepc_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.dk.datarace-free-lbe-02cf818-m [2023-11-17 15:15:12,571 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-17 15:15:12,660 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 15:15:12,690 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-17 15:15:12,692 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-17 15:15:12,692 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-17 15:15:12,693 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-17 15:15:12,693 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-17 15:15:12,694 INFO L153 SettingsManager]: * Use SBE=true [2023-11-17 15:15:12,697 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-17 15:15:12,697 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-17 15:15:12,698 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-17 15:15:12,698 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-17 15:15:12,699 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-17 15:15:12,699 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-17 15:15:12,700 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-17 15:15:12,700 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-17 15:15:12,700 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-17 15:15:12,700 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-17 15:15:12,701 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-17 15:15:12,701 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-17 15:15:12,702 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-17 15:15:12,702 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-17 15:15:12,702 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-17 15:15:12,702 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-17 15:15:12,703 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 15:15:12,703 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-17 15:15:12,703 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-17 15:15:12,703 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-17 15:15:12,704 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-17 15:15:12,705 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-17 15:15:12,705 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-17 15:15:12,705 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 [2023-11-17 15:15:12,955 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-17 15:15:12,981 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-17 15:15:12,984 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-17 15:15:12,985 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-17 15:15:12,985 INFO L274 PluginConnector]: CDTParser initialized [2023-11-17 15:15:12,986 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix037_power.oepc_pso.oepc_rmo.oepc.i [2023-11-17 15:15:14,275 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-17 15:15:14,629 INFO L384 CDTParser]: Found 1 translation units. [2023-11-17 15:15:14,630 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix037_power.oepc_pso.oepc_rmo.oepc.i [2023-11-17 15:15:14,642 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ae8bac84/087eb8bb4f0b439598865f61677d30ae/FLAGbb959ea7e [2023-11-17 15:15:14,655 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ae8bac84/087eb8bb4f0b439598865f61677d30ae [2023-11-17 15:15:14,657 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-17 15:15:14,661 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-17 15:15:14,662 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-17 15:15:14,662 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-17 15:15:14,668 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-17 15:15:14,669 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 03:15:14" (1/1) ... [2023-11-17 15:15:14,670 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@231a05f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:15:14, skipping insertion in model container [2023-11-17 15:15:14,670 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 03:15:14" (1/1) ... [2023-11-17 15:15:14,718 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-17 15:15:14,848 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/mix037_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2023-11-17 15:15:15,072 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 15:15:15,086 INFO L202 MainTranslator]: Completed pre-run [2023-11-17 15:15:15,099 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/mix037_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2023-11-17 15:15:15,174 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 15:15:15,210 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-17 15:15:15,210 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-17 15:15:15,217 INFO L206 MainTranslator]: Completed translation [2023-11-17 15:15:15,217 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:15:15 WrapperNode [2023-11-17 15:15:15,217 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-17 15:15:15,219 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-17 15:15:15,219 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-17 15:15:15,219 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-17 15:15:15,226 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:15:15" (1/1) ... [2023-11-17 15:15:15,266 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:15:15" (1/1) ... [2023-11-17 15:15:15,300 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 145 [2023-11-17 15:15:15,301 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-17 15:15:15,301 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-17 15:15:15,301 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-17 15:15:15,301 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-17 15:15:15,310 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:15:15" (1/1) ... [2023-11-17 15:15:15,310 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:15:15" (1/1) ... [2023-11-17 15:15:15,324 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:15:15" (1/1) ... [2023-11-17 15:15:15,325 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:15:15" (1/1) ... [2023-11-17 15:15:15,336 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:15:15" (1/1) ... [2023-11-17 15:15:15,337 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:15:15" (1/1) ... [2023-11-17 15:15:15,340 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:15:15" (1/1) ... [2023-11-17 15:15:15,355 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:15:15" (1/1) ... [2023-11-17 15:15:15,358 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-17 15:15:15,359 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-17 15:15:15,360 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-17 15:15:15,360 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-17 15:15:15,360 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:15:15" (1/1) ... [2023-11-17 15:15:15,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 15:15:15,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 15:15:15,399 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 15:15:15,424 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 15:15:15,432 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-17 15:15:15,432 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-17 15:15:15,432 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-17 15:15:15,433 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-17 15:15:15,433 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-17 15:15:15,433 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-17 15:15:15,434 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-17 15:15:15,434 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-17 15:15:15,434 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-17 15:15:15,434 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-17 15:15:15,435 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-17 15:15:15,435 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-11-17 15:15:15,435 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-11-17 15:15:15,435 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-17 15:15:15,435 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-17 15:15:15,435 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-17 15:15:15,435 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-17 15:15:15,437 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 15:15:15,566 INFO L239 CfgBuilder]: Building ICFG [2023-11-17 15:15:15,569 INFO L265 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-17 15:15:15,909 INFO L280 CfgBuilder]: Performing block encoding [2023-11-17 15:15:16,069 INFO L302 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-17 15:15:16,069 INFO L307 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-17 15:15:16,070 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 03:15:16 BoogieIcfgContainer [2023-11-17 15:15:16,071 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-17 15:15:16,073 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-17 15:15:16,073 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-17 15:15:16,076 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-17 15:15:16,077 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 03:15:14" (1/3) ... [2023-11-17 15:15:16,077 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@348919b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 03:15:16, skipping insertion in model container [2023-11-17 15:15:16,077 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:15:15" (2/3) ... [2023-11-17 15:15:16,078 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@348919b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 03:15:16, skipping insertion in model container [2023-11-17 15:15:16,078 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 03:15:16" (3/3) ... [2023-11-17 15:15:16,079 INFO L112 eAbstractionObserver]: Analyzing ICFG mix037_power.oepc_pso.oepc_rmo.oepc.i [2023-11-17 15:15:16,096 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-17 15:15:16,097 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-17 15:15:16,097 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-17 15:15:16,174 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-17 15:15:16,216 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 147 places, 137 transitions, 290 flow [2023-11-17 15:15:16,296 INFO L124 PetriNetUnfolderBase]: 3/133 cut-off events. [2023-11-17 15:15:16,296 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 15:15:16,302 INFO L83 FinitePrefix]: Finished finitePrefix Result has 146 conditions, 133 events. 3/133 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 77 event pairs, 0 based on Foata normal form. 0/128 useless extension candidates. Maximal degree in co-relation 94. Up to 2 conditions per place. [2023-11-17 15:15:16,303 INFO L82 GeneralOperation]: Start removeDead. Operand has 147 places, 137 transitions, 290 flow [2023-11-17 15:15:16,310 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 143 places, 133 transitions, 278 flow [2023-11-17 15:15:16,313 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-11-17 15:15:16,331 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 143 places, 133 transitions, 278 flow [2023-11-17 15:15:16,334 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 143 places, 133 transitions, 278 flow [2023-11-17 15:15:16,334 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 143 places, 133 transitions, 278 flow [2023-11-17 15:15:16,414 INFO L124 PetriNetUnfolderBase]: 3/133 cut-off events. [2023-11-17 15:15:16,414 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 15:15:16,415 INFO L83 FinitePrefix]: Finished finitePrefix Result has 146 conditions, 133 events. 3/133 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 77 event pairs, 0 based on Foata normal form. 0/128 useless extension candidates. Maximal degree in co-relation 94. Up to 2 conditions per place. [2023-11-17 15:15:16,418 INFO L119 LiptonReduction]: Number of co-enabled transitions 3676 [2023-11-17 15:15:20,947 INFO L134 LiptonReduction]: Checked pairs total: 9188 [2023-11-17 15:15:20,947 INFO L136 LiptonReduction]: Total number of compositions: 115 [2023-11-17 15:15:20,965 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-17 15:15:20,973 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;@9a454f4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-17 15:15:20,973 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-11-17 15:15:20,977 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-17 15:15:20,978 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-11-17 15:15:20,978 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 15:15:20,978 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:15:20,978 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-11-17 15:15:20,979 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 15:15:20,985 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:15:20,985 INFO L85 PathProgramCache]: Analyzing trace with hash 571184, now seen corresponding path program 1 times [2023-11-17 15:15:20,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:15:20,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242509042] [2023-11-17 15:15:20,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:15:20,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:15:21,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:15:21,345 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 15:15:21,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:15:21,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242509042] [2023-11-17 15:15:21,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242509042] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:15:21,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:15:21,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-17 15:15:21,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881099382] [2023-11-17 15:15:21,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:15:21,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 15:15:21,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:15:21,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 15:15:21,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 15:15:21,390 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 252 [2023-11-17 15:15:21,395 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 32 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 121.0) internal successors, (363), 3 states have internal predecessors, (363), 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 15:15:21,395 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:15:21,395 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 252 [2023-11-17 15:15:21,396 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:15:22,651 INFO L124 PetriNetUnfolderBase]: 7063/10161 cut-off events. [2023-11-17 15:15:22,652 INFO L125 PetriNetUnfolderBase]: For 77/77 co-relation queries the response was YES. [2023-11-17 15:15:22,680 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19873 conditions, 10161 events. 7063/10161 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 456. Compared 60651 event pairs, 1303 based on Foata normal form. 0/9771 useless extension candidates. Maximal degree in co-relation 19861. Up to 7615 conditions per place. [2023-11-17 15:15:22,731 INFO L140 encePairwiseOnDemand]: 248/252 looper letters, 45 selfloop transitions, 2 changer transitions 2/52 dead transitions. [2023-11-17 15:15:22,732 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 52 transitions, 223 flow [2023-11-17 15:15:22,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 15:15:22,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 15:15:22,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 412 transitions. [2023-11-17 15:15:22,748 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.544973544973545 [2023-11-17 15:15:22,749 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 412 transitions. [2023-11-17 15:15:22,749 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 412 transitions. [2023-11-17 15:15:22,751 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:15:22,753 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 412 transitions. [2023-11-17 15:15:22,757 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 137.33333333333334) internal successors, (412), 3 states have internal predecessors, (412), 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 15:15:22,762 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 252.0) internal successors, (1008), 4 states have internal predecessors, (1008), 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 15:15:22,763 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 252.0) internal successors, (1008), 4 states have internal predecessors, (1008), 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 15:15:22,765 INFO L175 Difference]: Start difference. First operand has 44 places, 32 transitions, 76 flow. Second operand 3 states and 412 transitions. [2023-11-17 15:15:22,766 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 52 transitions, 223 flow [2023-11-17 15:15:22,769 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 52 transitions, 216 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-17 15:15:22,771 INFO L231 Difference]: Finished difference. Result has 41 places, 29 transitions, 70 flow [2023-11-17 15:15:22,773 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=70, PETRI_PLACES=41, PETRI_TRANSITIONS=29} [2023-11-17 15:15:22,776 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, -3 predicate places. [2023-11-17 15:15:22,777 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 29 transitions, 70 flow [2023-11-17 15:15:22,777 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 121.0) internal successors, (363), 3 states have internal predecessors, (363), 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 15:15:22,777 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:15:22,777 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:15:22,778 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-17 15:15:22,778 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 15:15:22,778 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:15:22,778 INFO L85 PathProgramCache]: Analyzing trace with hash -1832331308, now seen corresponding path program 1 times [2023-11-17 15:15:22,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:15:22,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152528865] [2023-11-17 15:15:22,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:15:22,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:15:22,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:15:23,147 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 15:15:23,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:15:23,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152528865] [2023-11-17 15:15:23,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152528865] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:15:23,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:15:23,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 15:15:23,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790775318] [2023-11-17 15:15:23,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:15:23,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 15:15:23,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:15:23,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 15:15:23,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-17 15:15:23,152 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 252 [2023-11-17 15:15:23,152 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 29 transitions, 70 flow. Second operand has 4 states, 4 states have (on average 116.0) internal successors, (464), 4 states have internal predecessors, (464), 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 15:15:23,152 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:15:23,153 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 252 [2023-11-17 15:15:23,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:15:24,007 INFO L124 PetriNetUnfolderBase]: 4654/6609 cut-off events. [2023-11-17 15:15:24,007 INFO L125 PetriNetUnfolderBase]: For 437/437 co-relation queries the response was YES. [2023-11-17 15:15:24,021 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13808 conditions, 6609 events. 4654/6609 cut-off events. For 437/437 co-relation queries the response was YES. Maximal size of possible extension queue 324. Compared 35419 event pairs, 792 based on Foata normal form. 384/6978 useless extension candidates. Maximal degree in co-relation 13798. Up to 3573 conditions per place. [2023-11-17 15:15:24,050 INFO L140 encePairwiseOnDemand]: 245/252 looper letters, 54 selfloop transitions, 6 changer transitions 1/64 dead transitions. [2023-11-17 15:15:24,050 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 64 transitions, 272 flow [2023-11-17 15:15:24,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 15:15:24,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-17 15:15:24,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 515 transitions. [2023-11-17 15:15:24,055 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5109126984126984 [2023-11-17 15:15:24,055 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 515 transitions. [2023-11-17 15:15:24,055 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 515 transitions. [2023-11-17 15:15:24,055 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:15:24,055 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 515 transitions. [2023-11-17 15:15:24,057 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 128.75) internal successors, (515), 4 states have internal predecessors, (515), 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 15:15:24,060 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 252.0) internal successors, (1260), 5 states have internal predecessors, (1260), 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 15:15:24,061 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 252.0) internal successors, (1260), 5 states have internal predecessors, (1260), 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 15:15:24,061 INFO L175 Difference]: Start difference. First operand has 41 places, 29 transitions, 70 flow. Second operand 4 states and 515 transitions. [2023-11-17 15:15:24,061 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 64 transitions, 272 flow [2023-11-17 15:15:24,063 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 64 transitions, 264 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-17 15:15:24,064 INFO L231 Difference]: Finished difference. Result has 43 places, 33 transitions, 108 flow [2023-11-17 15:15:24,065 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=108, PETRI_PLACES=43, PETRI_TRANSITIONS=33} [2023-11-17 15:15:24,066 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, -1 predicate places. [2023-11-17 15:15:24,066 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 33 transitions, 108 flow [2023-11-17 15:15:24,067 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 116.0) internal successors, (464), 4 states have internal predecessors, (464), 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 15:15:24,067 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:15:24,068 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:15:24,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-17 15:15:24,070 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 15:15:24,075 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:15:24,075 INFO L85 PathProgramCache]: Analyzing trace with hash -1934599156, now seen corresponding path program 1 times [2023-11-17 15:15:24,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:15:24,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308353614] [2023-11-17 15:15:24,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:15:24,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:15:24,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:15:24,279 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 15:15:24,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:15:24,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308353614] [2023-11-17 15:15:24,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308353614] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:15:24,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:15:24,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-17 15:15:24,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631434876] [2023-11-17 15:15:24,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:15:24,281 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-17 15:15:24,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:15:24,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-17 15:15:24,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-17 15:15:24,282 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 252 [2023-11-17 15:15:24,283 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 33 transitions, 108 flow. Second operand has 5 states, 5 states have (on average 116.0) internal successors, (580), 5 states have internal predecessors, (580), 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 15:15:24,283 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:15:24,283 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 252 [2023-11-17 15:15:24,283 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:15:24,773 INFO L124 PetriNetUnfolderBase]: 2332/3505 cut-off events. [2023-11-17 15:15:24,773 INFO L125 PetriNetUnfolderBase]: For 1046/1046 co-relation queries the response was YES. [2023-11-17 15:15:24,783 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8905 conditions, 3505 events. 2332/3505 cut-off events. For 1046/1046 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 18032 event pairs, 382 based on Foata normal form. 249/3739 useless extension candidates. Maximal degree in co-relation 8893. Up to 1224 conditions per place. [2023-11-17 15:15:24,800 INFO L140 encePairwiseOnDemand]: 245/252 looper letters, 68 selfloop transitions, 10 changer transitions 1/82 dead transitions. [2023-11-17 15:15:24,800 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 82 transitions, 393 flow [2023-11-17 15:15:24,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 15:15:24,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 15:15:24,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 646 transitions. [2023-11-17 15:15:24,802 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5126984126984127 [2023-11-17 15:15:24,803 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 646 transitions. [2023-11-17 15:15:24,803 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 646 transitions. [2023-11-17 15:15:24,803 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:15:24,803 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 646 transitions. [2023-11-17 15:15:24,805 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 129.2) internal successors, (646), 5 states have internal predecessors, (646), 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 15:15:24,807 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 252.0) internal successors, (1512), 6 states have internal predecessors, (1512), 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 15:15:24,808 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 252.0) internal successors, (1512), 6 states have internal predecessors, (1512), 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 15:15:24,808 INFO L175 Difference]: Start difference. First operand has 43 places, 33 transitions, 108 flow. Second operand 5 states and 646 transitions. [2023-11-17 15:15:24,808 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 82 transitions, 393 flow [2023-11-17 15:15:24,841 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 82 transitions, 382 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-11-17 15:15:24,842 INFO L231 Difference]: Finished difference. Result has 47 places, 37 transitions, 160 flow [2023-11-17 15:15:24,842 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=99, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=160, PETRI_PLACES=47, PETRI_TRANSITIONS=37} [2023-11-17 15:15:24,843 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 3 predicate places. [2023-11-17 15:15:24,843 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 37 transitions, 160 flow [2023-11-17 15:15:24,844 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 116.0) internal successors, (580), 5 states have internal predecessors, (580), 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 15:15:24,844 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:15:24,844 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] [2023-11-17 15:15:24,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-17 15:15:24,844 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 15:15:24,844 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:15:24,845 INFO L85 PathProgramCache]: Analyzing trace with hash -307894316, now seen corresponding path program 1 times [2023-11-17 15:15:24,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:15:24,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349165400] [2023-11-17 15:15:24,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:15:24,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:15:24,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:15:25,032 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 15:15:25,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:15:25,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349165400] [2023-11-17 15:15:25,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349165400] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:15:25,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:15:25,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-17 15:15:25,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837921643] [2023-11-17 15:15:25,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:15:25,033 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-17 15:15:25,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:15:25,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-17 15:15:25,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-17 15:15:25,035 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 252 [2023-11-17 15:15:25,036 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 37 transitions, 160 flow. Second operand has 6 states, 6 states have (on average 116.0) internal successors, (696), 6 states have internal predecessors, (696), 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 15:15:25,036 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:15:25,036 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 252 [2023-11-17 15:15:25,036 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:15:25,458 INFO L124 PetriNetUnfolderBase]: 1342/2065 cut-off events. [2023-11-17 15:15:25,458 INFO L125 PetriNetUnfolderBase]: For 1795/1795 co-relation queries the response was YES. [2023-11-17 15:15:25,464 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5974 conditions, 2065 events. 1342/2065 cut-off events. For 1795/1795 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 9981 event pairs, 380 based on Foata normal form. 87/2137 useless extension candidates. Maximal degree in co-relation 5960. Up to 720 conditions per place. [2023-11-17 15:15:25,473 INFO L140 encePairwiseOnDemand]: 245/252 looper letters, 80 selfloop transitions, 14 changer transitions 1/98 dead transitions. [2023-11-17 15:15:25,474 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 98 transitions, 520 flow [2023-11-17 15:15:25,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-17 15:15:25,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-17 15:15:25,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 775 transitions. [2023-11-17 15:15:25,476 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5125661375661376 [2023-11-17 15:15:25,476 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 775 transitions. [2023-11-17 15:15:25,476 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 775 transitions. [2023-11-17 15:15:25,477 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:15:25,477 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 775 transitions. [2023-11-17 15:15:25,479 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 129.16666666666666) internal successors, (775), 6 states have internal predecessors, (775), 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 15:15:25,481 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 252.0) internal successors, (1764), 7 states have internal predecessors, (1764), 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 15:15:25,482 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 252.0) internal successors, (1764), 7 states have internal predecessors, (1764), 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 15:15:25,482 INFO L175 Difference]: Start difference. First operand has 47 places, 37 transitions, 160 flow. Second operand 6 states and 775 transitions. [2023-11-17 15:15:25,483 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 98 transitions, 520 flow [2023-11-17 15:15:25,498 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 98 transitions, 490 flow, removed 5 selfloop flow, removed 4 redundant places. [2023-11-17 15:15:25,500 INFO L231 Difference]: Finished difference. Result has 50 places, 41 transitions, 210 flow [2023-11-17 15:15:25,500 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=133, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=210, PETRI_PLACES=50, PETRI_TRANSITIONS=41} [2023-11-17 15:15:25,501 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 6 predicate places. [2023-11-17 15:15:25,501 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 41 transitions, 210 flow [2023-11-17 15:15:25,501 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 116.0) internal successors, (696), 6 states have internal predecessors, (696), 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 15:15:25,501 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:15:25,501 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, 1, 1] [2023-11-17 15:15:25,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-17 15:15:25,502 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 15:15:25,502 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:15:25,502 INFO L85 PathProgramCache]: Analyzing trace with hash 1864145419, now seen corresponding path program 1 times [2023-11-17 15:15:25,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:15:25,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144330757] [2023-11-17 15:15:25,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:15:25,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:15:25,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:15:25,751 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 15:15:25,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:15:25,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144330757] [2023-11-17 15:15:25,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144330757] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:15:25,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:15:25,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-17 15:15:25,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643262548] [2023-11-17 15:15:25,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:15:25,753 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-17 15:15:25,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:15:25,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-17 15:15:25,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-17 15:15:25,755 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 252 [2023-11-17 15:15:25,756 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 41 transitions, 210 flow. Second operand has 7 states, 7 states have (on average 116.0) internal successors, (812), 7 states have internal predecessors, (812), 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 15:15:25,756 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:15:25,756 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 252 [2023-11-17 15:15:25,756 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:15:26,148 INFO L124 PetriNetUnfolderBase]: 1156/1751 cut-off events. [2023-11-17 15:15:26,148 INFO L125 PetriNetUnfolderBase]: For 1645/1645 co-relation queries the response was YES. [2023-11-17 15:15:26,153 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5150 conditions, 1751 events. 1156/1751 cut-off events. For 1645/1645 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 8290 event pairs, 380 based on Foata normal form. 15/1751 useless extension candidates. Maximal degree in co-relation 5135. Up to 720 conditions per place. [2023-11-17 15:15:26,161 INFO L140 encePairwiseOnDemand]: 245/252 looper letters, 62 selfloop transitions, 18 changer transitions 1/84 dead transitions. [2023-11-17 15:15:26,161 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 84 transitions, 474 flow [2023-11-17 15:15:26,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-17 15:15:26,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-17 15:15:26,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 874 transitions. [2023-11-17 15:15:26,164 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4954648526077097 [2023-11-17 15:15:26,164 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 874 transitions. [2023-11-17 15:15:26,164 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 874 transitions. [2023-11-17 15:15:26,165 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:15:26,165 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 874 transitions. [2023-11-17 15:15:26,167 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 124.85714285714286) internal successors, (874), 7 states have internal predecessors, (874), 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 15:15:26,170 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 252.0) internal successors, (2016), 8 states have internal predecessors, (2016), 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 15:15:26,170 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 252.0) internal successors, (2016), 8 states have internal predecessors, (2016), 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 15:15:26,170 INFO L175 Difference]: Start difference. First operand has 50 places, 41 transitions, 210 flow. Second operand 7 states and 874 transitions. [2023-11-17 15:15:26,170 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 84 transitions, 474 flow [2023-11-17 15:15:26,186 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 84 transitions, 428 flow, removed 9 selfloop flow, removed 5 redundant places. [2023-11-17 15:15:26,188 INFO L231 Difference]: Finished difference. Result has 53 places, 41 transitions, 220 flow [2023-11-17 15:15:26,188 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=167, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=220, PETRI_PLACES=53, PETRI_TRANSITIONS=41} [2023-11-17 15:15:26,189 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 9 predicate places. [2023-11-17 15:15:26,189 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 41 transitions, 220 flow [2023-11-17 15:15:26,189 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 116.0) internal successors, (812), 7 states have internal predecessors, (812), 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 15:15:26,189 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:15:26,190 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, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:15:26,190 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-17 15:15:26,190 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 15:15:26,190 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:15:26,190 INFO L85 PathProgramCache]: Analyzing trace with hash 635107857, now seen corresponding path program 1 times [2023-11-17 15:15:26,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:15:26,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482703739] [2023-11-17 15:15:26,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:15:26,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:15:26,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:15:27,391 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 15:15:27,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:15:27,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482703739] [2023-11-17 15:15:27,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482703739] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:15:27,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:15:27,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-17 15:15:27,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521842005] [2023-11-17 15:15:27,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:15:27,396 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-17 15:15:27,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:15:27,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-17 15:15:27,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-11-17 15:15:27,398 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 252 [2023-11-17 15:15:27,399 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 41 transitions, 220 flow. Second operand has 9 states, 9 states have (on average 108.88888888888889) internal successors, (980), 9 states have internal predecessors, (980), 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 15:15:27,399 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:15:27,399 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 252 [2023-11-17 15:15:27,400 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:15:27,881 INFO L124 PetriNetUnfolderBase]: 1303/2004 cut-off events. [2023-11-17 15:15:27,881 INFO L125 PetriNetUnfolderBase]: For 2129/2129 co-relation queries the response was YES. [2023-11-17 15:15:27,885 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5955 conditions, 2004 events. 1303/2004 cut-off events. For 2129/2129 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 9642 event pairs, 192 based on Foata normal form. 1/1999 useless extension candidates. Maximal degree in co-relation 5939. Up to 885 conditions per place. [2023-11-17 15:15:27,893 INFO L140 encePairwiseOnDemand]: 245/252 looper letters, 71 selfloop transitions, 4 changer transitions 33/111 dead transitions. [2023-11-17 15:15:27,893 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 111 transitions, 822 flow [2023-11-17 15:15:27,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-17 15:15:27,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-17 15:15:27,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 921 transitions. [2023-11-17 15:15:27,896 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4568452380952381 [2023-11-17 15:15:27,896 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 921 transitions. [2023-11-17 15:15:27,896 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 921 transitions. [2023-11-17 15:15:27,897 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:15:27,897 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 921 transitions. [2023-11-17 15:15:27,899 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 115.125) internal successors, (921), 8 states have internal predecessors, (921), 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 15:15:27,901 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 252.0) internal successors, (2268), 9 states have internal predecessors, (2268), 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 15:15:27,902 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 252.0) internal successors, (2268), 9 states have internal predecessors, (2268), 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 15:15:27,902 INFO L175 Difference]: Start difference. First operand has 53 places, 41 transitions, 220 flow. Second operand 8 states and 921 transitions. [2023-11-17 15:15:27,902 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 111 transitions, 822 flow [2023-11-17 15:15:27,916 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 111 transitions, 556 flow, removed 34 selfloop flow, removed 11 redundant places. [2023-11-17 15:15:27,918 INFO L231 Difference]: Finished difference. Result has 52 places, 41 transitions, 138 flow [2023-11-17 15:15:27,918 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=138, PETRI_PLACES=52, PETRI_TRANSITIONS=41} [2023-11-17 15:15:27,921 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 8 predicate places. [2023-11-17 15:15:27,921 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 41 transitions, 138 flow [2023-11-17 15:15:27,921 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 108.88888888888889) internal successors, (980), 9 states have internal predecessors, (980), 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 15:15:27,921 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:15:27,921 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, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:15:27,922 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-17 15:15:27,922 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 15:15:27,922 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:15:27,922 INFO L85 PathProgramCache]: Analyzing trace with hash 2001193261, now seen corresponding path program 2 times [2023-11-17 15:15:27,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:15:27,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672747012] [2023-11-17 15:15:27,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:15:27,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:15:28,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:15:28,228 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 15:15:28,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:15:28,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672747012] [2023-11-17 15:15:28,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672747012] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:15:28,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:15:28,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 15:15:28,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162017453] [2023-11-17 15:15:28,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:15:28,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 15:15:28,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:15:28,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 15:15:28,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-17 15:15:28,231 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 252 [2023-11-17 15:15:28,231 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 41 transitions, 138 flow. Second operand has 4 states, 4 states have (on average 114.25) internal successors, (457), 4 states have internal predecessors, (457), 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 15:15:28,231 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:15:28,231 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 252 [2023-11-17 15:15:28,231 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:15:28,774 INFO L124 PetriNetUnfolderBase]: 3519/5187 cut-off events. [2023-11-17 15:15:28,774 INFO L125 PetriNetUnfolderBase]: For 1749/1749 co-relation queries the response was YES. [2023-11-17 15:15:28,783 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12661 conditions, 5187 events. 3519/5187 cut-off events. For 1749/1749 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 25936 event pairs, 1130 based on Foata normal form. 1/5188 useless extension candidates. Maximal degree in co-relation 12652. Up to 3484 conditions per place. [2023-11-17 15:15:28,796 INFO L140 encePairwiseOnDemand]: 243/252 looper letters, 63 selfloop transitions, 7 changer transitions 7/77 dead transitions. [2023-11-17 15:15:28,796 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 77 transitions, 411 flow [2023-11-17 15:15:28,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 15:15:28,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-17 15:15:28,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 482 transitions. [2023-11-17 15:15:28,798 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4781746031746032 [2023-11-17 15:15:28,798 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 482 transitions. [2023-11-17 15:15:28,798 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 482 transitions. [2023-11-17 15:15:28,798 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:15:28,799 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 482 transitions. [2023-11-17 15:15:28,800 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 120.5) internal successors, (482), 4 states have internal predecessors, (482), 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 15:15:28,801 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 252.0) internal successors, (1260), 5 states have internal predecessors, (1260), 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 15:15:28,802 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 252.0) internal successors, (1260), 5 states have internal predecessors, (1260), 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 15:15:28,802 INFO L175 Difference]: Start difference. First operand has 52 places, 41 transitions, 138 flow. Second operand 4 states and 482 transitions. [2023-11-17 15:15:28,802 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 77 transitions, 411 flow [2023-11-17 15:15:28,815 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 77 transitions, 391 flow, removed 3 selfloop flow, removed 6 redundant places. [2023-11-17 15:15:28,816 INFO L231 Difference]: Finished difference. Result has 49 places, 47 transitions, 184 flow [2023-11-17 15:15:28,816 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=184, PETRI_PLACES=49, PETRI_TRANSITIONS=47} [2023-11-17 15:15:28,817 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 5 predicate places. [2023-11-17 15:15:28,817 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 47 transitions, 184 flow [2023-11-17 15:15:28,817 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 114.25) internal successors, (457), 4 states have internal predecessors, (457), 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 15:15:28,817 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:15:28,817 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, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:15:28,818 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-17 15:15:28,818 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 15:15:28,818 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:15:28,818 INFO L85 PathProgramCache]: Analyzing trace with hash -195949215, now seen corresponding path program 3 times [2023-11-17 15:15:28,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:15:28,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849593216] [2023-11-17 15:15:28,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:15:28,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:15:28,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:15:29,070 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 15:15:29,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:15:29,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849593216] [2023-11-17 15:15:29,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849593216] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:15:29,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:15:29,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-17 15:15:29,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614869583] [2023-11-17 15:15:29,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:15:29,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-17 15:15:29,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:15:29,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-17 15:15:29,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-17 15:15:29,073 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 252 [2023-11-17 15:15:29,074 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 47 transitions, 184 flow. Second operand has 6 states, 6 states have (on average 109.83333333333333) internal successors, (659), 6 states have internal predecessors, (659), 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 15:15:29,074 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:15:29,074 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 252 [2023-11-17 15:15:29,074 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:15:29,937 INFO L124 PetriNetUnfolderBase]: 5039/7479 cut-off events. [2023-11-17 15:15:29,938 INFO L125 PetriNetUnfolderBase]: For 3928/3928 co-relation queries the response was YES. [2023-11-17 15:15:29,992 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20310 conditions, 7479 events. 5039/7479 cut-off events. For 3928/3928 co-relation queries the response was YES. Maximal size of possible extension queue 284. Compared 40614 event pairs, 361 based on Foata normal form. 1/7480 useless extension candidates. Maximal degree in co-relation 20301. Up to 2646 conditions per place. [2023-11-17 15:15:30,004 INFO L140 encePairwiseOnDemand]: 242/252 looper letters, 93 selfloop transitions, 12 changer transitions 47/152 dead transitions. [2023-11-17 15:15:30,005 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 152 transitions, 872 flow [2023-11-17 15:15:30,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-17 15:15:30,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-17 15:15:30,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 837 transitions. [2023-11-17 15:15:30,010 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4744897959183674 [2023-11-17 15:15:30,010 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 837 transitions. [2023-11-17 15:15:30,011 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 837 transitions. [2023-11-17 15:15:30,011 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:15:30,011 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 837 transitions. [2023-11-17 15:15:30,013 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 119.57142857142857) internal successors, (837), 7 states have internal predecessors, (837), 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 15:15:30,016 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 252.0) internal successors, (2016), 8 states have internal predecessors, (2016), 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 15:15:30,017 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 252.0) internal successors, (2016), 8 states have internal predecessors, (2016), 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 15:15:30,017 INFO L175 Difference]: Start difference. First operand has 49 places, 47 transitions, 184 flow. Second operand 7 states and 837 transitions. [2023-11-17 15:15:30,017 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 152 transitions, 872 flow [2023-11-17 15:15:30,026 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 152 transitions, 838 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-11-17 15:15:30,028 INFO L231 Difference]: Finished difference. Result has 54 places, 51 transitions, 219 flow [2023-11-17 15:15:30,028 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=219, PETRI_PLACES=54, PETRI_TRANSITIONS=51} [2023-11-17 15:15:30,031 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 10 predicate places. [2023-11-17 15:15:30,031 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 51 transitions, 219 flow [2023-11-17 15:15:30,032 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 109.83333333333333) internal successors, (659), 6 states have internal predecessors, (659), 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 15:15:30,032 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:15:30,032 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, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:15:30,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-17 15:15:30,032 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 15:15:30,033 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:15:30,033 INFO L85 PathProgramCache]: Analyzing trace with hash -454226517, now seen corresponding path program 4 times [2023-11-17 15:15:30,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:15:30,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118385926] [2023-11-17 15:15:30,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:15:30,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:15:30,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:15:30,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 15:15:30,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:15:30,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118385926] [2023-11-17 15:15:30,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118385926] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:15:30,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:15:30,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-17 15:15:30,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199450590] [2023-11-17 15:15:30,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:15:30,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-17 15:15:30,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:15:30,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-17 15:15:30,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-17 15:15:30,346 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 252 [2023-11-17 15:15:30,347 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 51 transitions, 219 flow. Second operand has 5 states, 5 states have (on average 118.4) internal successors, (592), 5 states have internal predecessors, (592), 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 15:15:30,347 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:15:30,347 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 252 [2023-11-17 15:15:30,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:15:31,003 INFO L124 PetriNetUnfolderBase]: 3662/5742 cut-off events. [2023-11-17 15:15:31,003 INFO L125 PetriNetUnfolderBase]: For 3732/3747 co-relation queries the response was YES. [2023-11-17 15:15:31,017 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15496 conditions, 5742 events. 3662/5742 cut-off events. For 3732/3747 co-relation queries the response was YES. Maximal size of possible extension queue 270. Compared 33091 event pairs, 1132 based on Foata normal form. 6/5682 useless extension candidates. Maximal degree in co-relation 15485. Up to 2481 conditions per place. [2023-11-17 15:15:31,025 INFO L140 encePairwiseOnDemand]: 248/252 looper letters, 53 selfloop transitions, 1 changer transitions 40/99 dead transitions. [2023-11-17 15:15:31,025 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 99 transitions, 598 flow [2023-11-17 15:15:31,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 15:15:31,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 15:15:31,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 618 transitions. [2023-11-17 15:15:31,028 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49047619047619045 [2023-11-17 15:15:31,028 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 618 transitions. [2023-11-17 15:15:31,028 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 618 transitions. [2023-11-17 15:15:31,028 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:15:31,028 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 618 transitions. [2023-11-17 15:15:31,030 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 123.6) internal successors, (618), 5 states have internal predecessors, (618), 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 15:15:31,032 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 252.0) internal successors, (1512), 6 states have internal predecessors, (1512), 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 15:15:31,032 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 252.0) internal successors, (1512), 6 states have internal predecessors, (1512), 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 15:15:31,032 INFO L175 Difference]: Start difference. First operand has 54 places, 51 transitions, 219 flow. Second operand 5 states and 618 transitions. [2023-11-17 15:15:31,032 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 99 transitions, 598 flow [2023-11-17 15:15:31,037 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 99 transitions, 592 flow, removed 3 selfloop flow, removed 2 redundant places. [2023-11-17 15:15:31,038 INFO L231 Difference]: Finished difference. Result has 57 places, 48 transitions, 208 flow [2023-11-17 15:15:31,038 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=215, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=208, PETRI_PLACES=57, PETRI_TRANSITIONS=48} [2023-11-17 15:15:31,039 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 13 predicate places. [2023-11-17 15:15:31,039 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 48 transitions, 208 flow [2023-11-17 15:15:31,039 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 118.4) internal successors, (592), 5 states have internal predecessors, (592), 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 15:15:31,039 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:15:31,039 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, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:15:31,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-17 15:15:31,040 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 15:15:31,040 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:15:31,040 INFO L85 PathProgramCache]: Analyzing trace with hash 1664583531, now seen corresponding path program 5 times [2023-11-17 15:15:31,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:15:31,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900780521] [2023-11-17 15:15:31,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:15:31,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:15:31,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-17 15:15:31,101 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-17 15:15:31,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-17 15:15:31,195 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-17 15:15:31,196 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-17 15:15:31,197 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2023-11-17 15:15:31,198 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2023-11-17 15:15:31,199 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2023-11-17 15:15:31,199 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2023-11-17 15:15:31,199 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2023-11-17 15:15:31,199 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2023-11-17 15:15:31,199 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2023-11-17 15:15:31,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-17 15:15:31,199 INFO L445 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1] [2023-11-17 15:15:31,204 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-17 15:15:31,205 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-17 15:15:31,267 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-17 15:15:31,269 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-17 15:15:31,282 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-17 15:15:31,283 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated [2023-11-17 15:15:31,297 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.11 03:15:31 BasicIcfg [2023-11-17 15:15:31,297 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-17 15:15:31,298 INFO L158 Benchmark]: Toolchain (without parser) took 16639.22ms. Allocated memory was 264.2MB in the beginning and 677.4MB in the end (delta: 413.1MB). Free memory was 224.2MB in the beginning and 416.4MB in the end (delta: -192.2MB). Peak memory consumption was 222.1MB. Max. memory is 8.0GB. [2023-11-17 15:15:31,298 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 186.6MB. Free memory is still 133.3MB. There was no memory consumed. Max. memory is 8.0GB. [2023-11-17 15:15:31,298 INFO L158 Benchmark]: CACSL2BoogieTranslator took 555.88ms. Allocated memory is still 264.2MB. Free memory was 223.8MB in the beginning and 199.7MB in the end (delta: 24.1MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. [2023-11-17 15:15:31,298 INFO L158 Benchmark]: Boogie Procedure Inliner took 82.20ms. Allocated memory is still 264.2MB. Free memory was 199.7MB in the beginning and 197.1MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-11-17 15:15:31,299 INFO L158 Benchmark]: Boogie Preprocessor took 57.05ms. Allocated memory is still 264.2MB. Free memory was 197.1MB in the beginning and 195.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-11-17 15:15:31,299 INFO L158 Benchmark]: RCFGBuilder took 711.79ms. Allocated memory is still 264.2MB. Free memory was 195.0MB in the beginning and 154.6MB in the end (delta: 40.4MB). Peak memory consumption was 39.8MB. Max. memory is 8.0GB. [2023-11-17 15:15:31,299 INFO L158 Benchmark]: TraceAbstraction took 15224.48ms. Allocated memory was 264.2MB in the beginning and 677.4MB in the end (delta: 413.1MB). Free memory was 153.6MB in the beginning and 416.4MB in the end (delta: -262.8MB). Peak memory consumption was 151.9MB. Max. memory is 8.0GB. [2023-11-17 15:15:31,300 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.16ms. Allocated memory is still 186.6MB. Free memory is still 133.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 555.88ms. Allocated memory is still 264.2MB. Free memory was 223.8MB in the beginning and 199.7MB in the end (delta: 24.1MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 82.20ms. Allocated memory is still 264.2MB. Free memory was 199.7MB in the beginning and 197.1MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 57.05ms. Allocated memory is still 264.2MB. Free memory was 197.1MB in the beginning and 195.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 711.79ms. Allocated memory is still 264.2MB. Free memory was 195.0MB in the beginning and 154.6MB in the end (delta: 40.4MB). Peak memory consumption was 39.8MB. Max. memory is 8.0GB. * TraceAbstraction took 15224.48ms. Allocated memory was 264.2MB in the beginning and 677.4MB in the end (delta: 413.1MB). Free memory was 153.6MB in the beginning and 416.4MB in the end (delta: -262.8MB). Peak memory consumption was 151.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 Unfinished Backtranslation: IdentifierExpression #t~pre11 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: 4.6s, 143 PlacesBefore, 44 PlacesAfterwards, 133 TransitionsBefore, 32 TransitionsAfterwards, 3676 CoEnabledTransitionPairs, 7 FixpointIterations, 43 TrivialSequentialCompositions, 61 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 2 ChoiceCompositions, 115 TotalNumberOfCompositions, 9188 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4746, independent: 4515, independent conditional: 0, independent unconditional: 4515, dependent: 231, dependent conditional: 0, dependent unconditional: 231, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2392, independent: 2331, independent conditional: 0, independent unconditional: 2331, dependent: 61, dependent conditional: 0, dependent unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2392, independent: 2311, independent conditional: 0, independent unconditional: 2311, dependent: 81, dependent conditional: 0, dependent unconditional: 81, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 81, independent: 20, independent conditional: 0, independent unconditional: 20, dependent: 61, dependent conditional: 0, dependent unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 487, independent: 39, independent conditional: 0, independent unconditional: 39, dependent: 448, dependent conditional: 0, dependent unconditional: 448, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4746, independent: 2184, independent conditional: 0, independent unconditional: 2184, dependent: 170, dependent conditional: 0, dependent unconditional: 170, unknown: 2392, unknown conditional: 0, unknown unconditional: 2392] , Statistics on independence cache: Total cache size (in pairs): 276, Positive cache size: 241, Positive conditional cache size: 0, Positive unconditional cache size: 241, Negative cache size: 35, Negative conditional cache size: 0, Negative unconditional cache size: 35, 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: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L722] 0 int b = 0; [L723] 0 _Bool b$flush_delayed; [L724] 0 int b$mem_tmp; [L725] 0 _Bool b$r_buff0_thd0; [L726] 0 _Bool b$r_buff0_thd1; [L727] 0 _Bool b$r_buff0_thd2; [L728] 0 _Bool b$r_buff0_thd3; [L729] 0 _Bool b$r_buff0_thd4; [L730] 0 _Bool b$r_buff1_thd0; [L731] 0 _Bool b$r_buff1_thd1; [L732] 0 _Bool b$r_buff1_thd2; [L733] 0 _Bool b$r_buff1_thd3; [L734] 0 _Bool b$r_buff1_thd4; [L735] 0 _Bool b$read_delayed; [L736] 0 int *b$read_delayed_var; [L737] 0 int b$w_buff0; [L738] 0 _Bool b$w_buff0_used; [L739] 0 int b$w_buff1; [L740] 0 _Bool b$w_buff1_used; [L741] 0 _Bool main$tmp_guard0; [L742] 0 _Bool main$tmp_guard1; [L744] 0 int x = 0; [L746] 0 int y = 0; [L748] 0 int z = 0; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L871] 0 pthread_t t969; [L872] FCALL, FORK 0 pthread_create(&t969, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t969={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L873] 0 pthread_t t970; [L754] 1 b$w_buff1 = b$w_buff0 [L755] 1 b$w_buff0 = 1 [L756] 1 b$w_buff1_used = b$w_buff0_used [L757] 1 b$w_buff0_used = (_Bool)1 [L758] CALL 1 __VERIFIER_assert(!(b$w_buff1_used && b$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L758] RET 1 __VERIFIER_assert(!(b$w_buff1_used && b$w_buff0_used)) [L759] 1 b$r_buff1_thd0 = b$r_buff0_thd0 [L760] 1 b$r_buff1_thd1 = b$r_buff0_thd1 [L761] 1 b$r_buff1_thd2 = b$r_buff0_thd2 [L762] 1 b$r_buff1_thd3 = b$r_buff0_thd3 [L763] 1 b$r_buff1_thd4 = b$r_buff0_thd4 [L764] 1 b$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L874] FCALL, FORK 0 pthread_create(&t970, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t969={5:0}, t970={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L767] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L784] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L787] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L790] 2 b = b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b) [L791] 2 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used [L792] 2 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$w_buff1_used [L793] 2 b$r_buff0_thd2 = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$r_buff0_thd2 [L794] 2 b$r_buff1_thd2 = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L875] 0 pthread_t t971; [L876] FCALL, FORK 0 pthread_create(&t971, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t969={5:0}, t970={6:0}, t971={7:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L877] 0 pthread_t t972; [L804] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L799] 2 return 0; [L878] FCALL, FORK 0 pthread_create(&t972, ((void *)0), P3, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t969={5:0}, t970={6:0}, t971={7:0}, t972={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L807] 3 __unbuffered_p2_EAX = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L810] 3 b = b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b) [L811] 3 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used [L812] 3 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$w_buff1_used [L813] 3 b$r_buff0_thd3 = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3 [L814] 3 b$r_buff1_thd3 = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L817] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L819] 3 return 0; [L824] 4 z = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L827] 4 a = 1 [L830] 4 __unbuffered_p3_EAX = a VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L833] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L834] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L835] 4 b$flush_delayed = weak$$choice2 [L836] 4 b$mem_tmp = b [L837] 4 b = !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff1) [L838] 4 b$w_buff0 = weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff0)) [L839] 4 b$w_buff1 = weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff1 : b$w_buff1)) [L840] 4 b$w_buff0_used = weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used)) [L841] 4 b$w_buff1_used = weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L842] 4 b$r_buff0_thd4 = weak$$choice2 ? b$r_buff0_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff0_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4)) [L843] 4 b$r_buff1_thd4 = weak$$choice2 ? b$r_buff1_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff1_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L844] 4 __unbuffered_p3_EBX = b [L845] 4 b = b$flush_delayed ? b$mem_tmp : b [L846] 4 b$flush_delayed = (_Bool)0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z=1] [L770] 1 b = b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b) [L771] 1 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$w_buff0_used [L772] 1 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$w_buff1_used [L773] 1 b$r_buff0_thd1 = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$r_buff0_thd1 [L774] 1 b$r_buff1_thd1 = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$r_buff1_thd1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z=1] [L849] 4 b = b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd4 ? b$w_buff1 : b) [L850] 4 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used [L851] 4 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$w_buff1_used [L852] 4 b$r_buff0_thd4 = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4 [L853] 4 b$r_buff1_thd4 = b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$r_buff1_thd4 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z=1] [L777] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L779] 1 return 0; [L856] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L858] 4 return 0; [L880] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t969={5:0}, t970={6:0}, t971={7:0}, t972={3:0}, weak$$choice2=1, x=2, y=1, z=1] [L882] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L882] RET 0 assume_abort_if_not(main$tmp_guard0) [L884] 0 b = b$w_buff0_used && b$r_buff0_thd0 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b) [L885] 0 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$w_buff0_used [L886] 0 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$w_buff1_used [L887] 0 b$r_buff0_thd0 = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$r_buff0_thd0 [L888] 0 b$r_buff1_thd0 = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t969={5:0}, t970={6:0}, t971={7:0}, t972={3:0}, weak$$choice2=1, x=2, y=1, z=1] [L891] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L893] 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}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=2, 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: 876]: 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: 872]: 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: 878]: 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: 874]: 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 9 procedures, 174 locations, 7 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: 15.0s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 6.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 576 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 576 mSDsluCounter, 28 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 16 mSDsCounter, 52 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1211 IncrementalHoareTripleChecker+Invalid, 1263 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 52 mSolverCounterUnsat, 12 mSDtfsCounter, 1211 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 60 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=220occurred in iteration=5, InterpolantAutomatonStates: 49, 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.5s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 220 NumberOfCodeBlocks, 220 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 182 ConstructedInterpolants, 0 QuantifiedInterpolants, 1045 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 15:15:31,320 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...