/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf --rcfgbuilder.only.consider.context.switches.at.boundaries.of.atomic.blocks true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe026_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.dk.datarace-free-lbe-02cf818-m [2023-11-17 11:29:38,586 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-17 11:29:38,667 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf [2023-11-17 11:29:38,687 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-17 11:29:38,688 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-17 11:29:38,688 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-17 11:29:38,689 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-17 11:29:38,689 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-17 11:29:38,689 INFO L153 SettingsManager]: * Use SBE=true [2023-11-17 11:29:38,690 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-17 11:29:38,690 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-17 11:29:38,690 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-17 11:29:38,691 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-17 11:29:38,691 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-17 11:29:38,691 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-17 11:29:38,692 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-17 11:29:38,693 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-17 11:29:38,696 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-17 11:29:38,696 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-17 11:29:38,696 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-17 11:29:38,698 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-17 11:29:38,698 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-17 11:29:38,699 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-17 11:29:38,699 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-17 11:29:38,699 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-17 11:29:38,699 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 11:29:38,700 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-17 11:29:38,700 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-17 11:29:38,700 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-17 11:29:38,700 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-17 11:29:38,701 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-17 11:29:38,702 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-17 11:29:38,702 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Only consider context switches at boundaries of atomic blocks -> true [2023-11-17 11:29:38,958 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-17 11:29:38,980 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-17 11:29:38,983 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-17 11:29:38,984 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-17 11:29:38,984 INFO L274 PluginConnector]: CDTParser initialized [2023-11-17 11:29:38,985 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe026_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-11-17 11:29:40,250 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-17 11:29:40,515 INFO L384 CDTParser]: Found 1 translation units. [2023-11-17 11:29:40,516 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe026_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-11-17 11:29:40,535 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5fc7519df/1c8b03c352794d9d8763d4911eb62dd7/FLAG3593d7363 [2023-11-17 11:29:40,549 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5fc7519df/1c8b03c352794d9d8763d4911eb62dd7 [2023-11-17 11:29:40,551 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-17 11:29:40,552 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-17 11:29:40,553 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-17 11:29:40,553 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-17 11:29:40,556 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-17 11:29:40,557 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 11:29:40" (1/1) ... [2023-11-17 11:29:40,558 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55281571 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:29:40, skipping insertion in model container [2023-11-17 11:29:40,558 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 11:29:40" (1/1) ... [2023-11-17 11:29:40,617 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-17 11:29:40,765 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/safe026_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[996,1009] [2023-11-17 11:29:41,006 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 11:29:41,022 INFO L202 MainTranslator]: Completed pre-run [2023-11-17 11:29:41,036 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/safe026_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[996,1009] [2023-11-17 11:29:41,098 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 11:29:41,132 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-17 11:29:41,133 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-17 11:29:41,139 INFO L206 MainTranslator]: Completed translation [2023-11-17 11:29:41,142 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:29:41 WrapperNode [2023-11-17 11:29:41,142 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-17 11:29:41,143 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-17 11:29:41,143 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-17 11:29:41,144 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-17 11:29:41,150 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:29:41" (1/1) ... [2023-11-17 11:29:41,186 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:29:41" (1/1) ... [2023-11-17 11:29:41,216 INFO L138 Inliner]: procedures = 176, calls = 52, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 126 [2023-11-17 11:29:41,216 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-17 11:29:41,217 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-17 11:29:41,217 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-17 11:29:41,217 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-17 11:29:41,228 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:29:41" (1/1) ... [2023-11-17 11:29:41,228 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:29:41" (1/1) ... [2023-11-17 11:29:41,245 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:29:41" (1/1) ... [2023-11-17 11:29:41,245 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:29:41" (1/1) ... [2023-11-17 11:29:41,253 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:29:41" (1/1) ... [2023-11-17 11:29:41,254 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:29:41" (1/1) ... [2023-11-17 11:29:41,272 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:29:41" (1/1) ... [2023-11-17 11:29:41,274 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:29:41" (1/1) ... [2023-11-17 11:29:41,277 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-17 11:29:41,278 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-17 11:29:41,278 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-17 11:29:41,278 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-17 11:29:41,279 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:29:41" (1/1) ... [2023-11-17 11:29:41,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 11:29:41,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 11:29:41,322 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-17 11:29:41,348 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-17 11:29:41,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-17 11:29:41,355 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-17 11:29:41,355 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-17 11:29:41,356 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-17 11:29:41,356 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-17 11:29:41,356 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-17 11:29:41,357 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-17 11:29:41,357 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-17 11:29:41,357 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-17 11:29:41,357 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-17 11:29:41,357 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-17 11:29:41,357 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-17 11:29:41,357 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-17 11:29:41,357 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-17 11:29:41,358 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-17 11:29:41,359 WARN L211 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-17 11:29:41,523 INFO L239 CfgBuilder]: Building ICFG [2023-11-17 11:29:41,525 INFO L265 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-17 11:29:41,815 INFO L280 CfgBuilder]: Performing block encoding [2023-11-17 11:29:42,011 INFO L302 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-17 11:29:42,011 INFO L307 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-17 11:29:42,012 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 11:29:42 BoogieIcfgContainer [2023-11-17 11:29:42,013 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-17 11:29:42,015 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-17 11:29:42,015 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-17 11:29:42,017 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-17 11:29:42,018 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 11:29:40" (1/3) ... [2023-11-17 11:29:42,019 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@438aec9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 11:29:42, skipping insertion in model container [2023-11-17 11:29:42,019 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:29:41" (2/3) ... [2023-11-17 11:29:42,019 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@438aec9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 11:29:42, skipping insertion in model container [2023-11-17 11:29:42,019 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 11:29:42" (3/3) ... [2023-11-17 11:29:42,020 INFO L112 eAbstractionObserver]: Analyzing ICFG safe026_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-11-17 11:29:42,034 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-17 11:29:42,035 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-17 11:29:42,035 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-17 11:29:42,087 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-17 11:29:42,122 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 39 transitions, 90 flow [2023-11-17 11:29:42,157 INFO L124 PetriNetUnfolderBase]: 2/36 cut-off events. [2023-11-17 11:29:42,158 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 11:29:42,166 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46 conditions, 36 events. 2/36 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 64 event pairs, 0 based on Foata normal form. 0/32 useless extension candidates. Maximal degree in co-relation 38. Up to 2 conditions per place. [2023-11-17 11:29:42,166 INFO L82 GeneralOperation]: Start removeDead. Operand has 47 places, 39 transitions, 90 flow [2023-11-17 11:29:42,170 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 44 places, 36 transitions, 81 flow [2023-11-17 11:29:42,174 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-11-17 11:29:42,201 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 36 transitions, 81 flow [2023-11-17 11:29:42,205 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 36 transitions, 81 flow [2023-11-17 11:29:42,206 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 36 transitions, 81 flow [2023-11-17 11:29:42,225 INFO L124 PetriNetUnfolderBase]: 2/36 cut-off events. [2023-11-17 11:29:42,225 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 11:29:42,226 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46 conditions, 36 events. 2/36 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 64 event pairs, 0 based on Foata normal form. 0/32 useless extension candidates. Maximal degree in co-relation 38. Up to 2 conditions per place. [2023-11-17 11:29:42,227 INFO L119 LiptonReduction]: Number of co-enabled transitions 738 [2023-11-17 11:29:43,352 INFO L134 LiptonReduction]: Checked pairs total: 2201 [2023-11-17 11:29:43,352 INFO L136 LiptonReduction]: Total number of compositions: 22 [2023-11-17 11:29:43,371 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-17 11:29:43,378 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;@54556d8f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-17 11:29:43,378 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-11-17 11:29:43,381 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-17 11:29:43,381 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2023-11-17 11:29:43,381 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 11:29:43,381 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:29:43,382 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-11-17 11:29:43,382 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 11:29:43,386 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:29:43,387 INFO L85 PathProgramCache]: Analyzing trace with hash 359317, now seen corresponding path program 1 times [2023-11-17 11:29:43,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:29:43,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602432842] [2023-11-17 11:29:43,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:29:43,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:29:43,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:29:43,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:29:43,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:29:43,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602432842] [2023-11-17 11:29:43,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602432842] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:29:43,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:29:43,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-17 11:29:43,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076018816] [2023-11-17 11:29:43,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:29:43,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 11:29:43,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:29:43,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 11:29:43,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 11:29:43,824 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 61 [2023-11-17 11:29:43,825 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 23 transitions, 55 flow. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:43,826 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:29:43,826 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 61 [2023-11-17 11:29:43,827 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:29:44,107 INFO L124 PetriNetUnfolderBase]: 895/1446 cut-off events. [2023-11-17 11:29:44,108 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2023-11-17 11:29:44,112 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2829 conditions, 1446 events. 895/1446 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 7065 event pairs, 142 based on Foata normal form. 0/1366 useless extension candidates. Maximal degree in co-relation 2818. Up to 1084 conditions per place. [2023-11-17 11:29:44,121 INFO L140 encePairwiseOnDemand]: 57/61 looper letters, 31 selfloop transitions, 2 changer transitions 2/36 dead transitions. [2023-11-17 11:29:44,121 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 36 transitions, 157 flow [2023-11-17 11:29:44,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 11:29:44,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 11:29:44,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 88 transitions. [2023-11-17 11:29:44,133 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4808743169398907 [2023-11-17 11:29:44,133 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 88 transitions. [2023-11-17 11:29:44,134 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 88 transitions. [2023-11-17 11:29:44,134 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:29:44,136 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 88 transitions. [2023-11-17 11:29:44,138 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:44,141 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 61.0) internal successors, (244), 4 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:44,141 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 61.0) internal successors, (244), 4 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:44,143 INFO L175 Difference]: Start difference. First operand has 32 places, 23 transitions, 55 flow. Second operand 3 states and 88 transitions. [2023-11-17 11:29:44,144 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 36 transitions, 157 flow [2023-11-17 11:29:44,146 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 36 transitions, 152 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-17 11:29:44,147 INFO L231 Difference]: Finished difference. Result has 30 places, 20 transitions, 50 flow [2023-11-17 11:29:44,149 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=50, PETRI_PLACES=30, PETRI_TRANSITIONS=20} [2023-11-17 11:29:44,152 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, -2 predicate places. [2023-11-17 11:29:44,153 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 20 transitions, 50 flow [2023-11-17 11:29:44,153 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:44,153 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:29:44,153 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:29:44,153 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-17 11:29:44,154 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 11:29:44,154 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:29:44,154 INFO L85 PathProgramCache]: Analyzing trace with hash -1029047944, now seen corresponding path program 1 times [2023-11-17 11:29:44,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:29:44,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131950444] [2023-11-17 11:29:44,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:29:44,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:29:44,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:29:44,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:29:44,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:29:44,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131950444] [2023-11-17 11:29:44,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131950444] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:29:44,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:29:44,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-17 11:29:44,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568217036] [2023-11-17 11:29:44,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:29:44,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 11:29:44,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:29:44,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 11:29:44,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 11:29:44,420 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 61 [2023-11-17 11:29:44,421 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 20 transitions, 50 flow. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:44,421 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:29:44,421 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 61 [2023-11-17 11:29:44,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:29:44,595 INFO L124 PetriNetUnfolderBase]: 671/1018 cut-off events. [2023-11-17 11:29:44,595 INFO L125 PetriNetUnfolderBase]: For 85/85 co-relation queries the response was YES. [2023-11-17 11:29:44,598 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2166 conditions, 1018 events. 671/1018 cut-off events. For 85/85 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 4022 event pairs, 159 based on Foata normal form. 16/1033 useless extension candidates. Maximal degree in co-relation 2156. Up to 817 conditions per place. [2023-11-17 11:29:44,603 INFO L140 encePairwiseOnDemand]: 58/61 looper letters, 25 selfloop transitions, 2 changer transitions 0/28 dead transitions. [2023-11-17 11:29:44,604 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 28 transitions, 122 flow [2023-11-17 11:29:44,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 11:29:44,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 11:29:44,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 73 transitions. [2023-11-17 11:29:44,607 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3989071038251366 [2023-11-17 11:29:44,607 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 73 transitions. [2023-11-17 11:29:44,608 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 73 transitions. [2023-11-17 11:29:44,608 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:29:44,608 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 73 transitions. [2023-11-17 11:29:44,611 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:44,612 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 61.0) internal successors, (244), 4 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:44,613 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 61.0) internal successors, (244), 4 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:44,613 INFO L175 Difference]: Start difference. First operand has 30 places, 20 transitions, 50 flow. Second operand 3 states and 73 transitions. [2023-11-17 11:29:44,613 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 28 transitions, 122 flow [2023-11-17 11:29:44,613 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 28 transitions, 116 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-17 11:29:44,614 INFO L231 Difference]: Finished difference. Result has 30 places, 20 transitions, 54 flow [2023-11-17 11:29:44,614 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=54, PETRI_PLACES=30, PETRI_TRANSITIONS=20} [2023-11-17 11:29:44,615 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, -2 predicate places. [2023-11-17 11:29:44,616 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 20 transitions, 54 flow [2023-11-17 11:29:44,616 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:44,616 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:29:44,617 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:29:44,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-17 11:29:44,618 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 11:29:44,621 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:29:44,622 INFO L85 PathProgramCache]: Analyzing trace with hash -1835715033, now seen corresponding path program 1 times [2023-11-17 11:29:44,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:29:44,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148783574] [2023-11-17 11:29:44,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:29:44,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:29:44,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:29:44,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:29:44,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:29:44,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148783574] [2023-11-17 11:29:44,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148783574] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:29:44,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:29:44,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 11:29:44,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647847782] [2023-11-17 11:29:44,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:29:44,833 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 11:29:44,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:29:44,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 11:29:44,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-17 11:29:44,835 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 61 [2023-11-17 11:29:44,835 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 20 transitions, 54 flow. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:44,835 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:29:44,835 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 61 [2023-11-17 11:29:44,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:29:45,166 INFO L124 PetriNetUnfolderBase]: 1219/1867 cut-off events. [2023-11-17 11:29:45,167 INFO L125 PetriNetUnfolderBase]: For 208/208 co-relation queries the response was YES. [2023-11-17 11:29:45,170 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4055 conditions, 1867 events. 1219/1867 cut-off events. For 208/208 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 8927 event pairs, 80 based on Foata normal form. 56/1923 useless extension candidates. Maximal degree in co-relation 4044. Up to 1183 conditions per place. [2023-11-17 11:29:45,179 INFO L140 encePairwiseOnDemand]: 55/61 looper letters, 39 selfloop transitions, 7 changer transitions 0/46 dead transitions. [2023-11-17 11:29:45,179 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 46 transitions, 210 flow [2023-11-17 11:29:45,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 11:29:45,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-17 11:29:45,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 100 transitions. [2023-11-17 11:29:45,183 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4098360655737705 [2023-11-17 11:29:45,183 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 100 transitions. [2023-11-17 11:29:45,183 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 100 transitions. [2023-11-17 11:29:45,184 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:29:45,184 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 100 transitions. [2023-11-17 11:29:45,185 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:45,186 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 61.0) internal successors, (305), 5 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:45,186 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 61.0) internal successors, (305), 5 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:45,186 INFO L175 Difference]: Start difference. First operand has 30 places, 20 transitions, 54 flow. Second operand 4 states and 100 transitions. [2023-11-17 11:29:45,186 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 46 transitions, 210 flow [2023-11-17 11:29:45,188 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 46 transitions, 202 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-17 11:29:45,189 INFO L231 Difference]: Finished difference. Result has 33 places, 25 transitions, 93 flow [2023-11-17 11:29:45,189 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=93, PETRI_PLACES=33, PETRI_TRANSITIONS=25} [2023-11-17 11:29:45,190 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 1 predicate places. [2023-11-17 11:29:45,190 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 25 transitions, 93 flow [2023-11-17 11:29:45,191 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:45,191 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:29:45,191 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:29:45,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-17 11:29:45,192 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 11:29:45,192 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:29:45,192 INFO L85 PathProgramCache]: Analyzing trace with hash -1072389330, now seen corresponding path program 1 times [2023-11-17 11:29:45,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:29:45,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033824225] [2023-11-17 11:29:45,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:29:45,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:29:45,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:29:45,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:29:45,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:29:45,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033824225] [2023-11-17 11:29:45,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033824225] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:29:45,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:29:45,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 11:29:45,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13408316] [2023-11-17 11:29:45,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:29:45,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 11:29:45,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:29:45,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 11:29:45,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-17 11:29:45,337 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 61 [2023-11-17 11:29:45,338 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 25 transitions, 93 flow. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:45,338 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:29:45,338 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 61 [2023-11-17 11:29:45,338 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:29:45,803 INFO L124 PetriNetUnfolderBase]: 1801/2764 cut-off events. [2023-11-17 11:29:45,803 INFO L125 PetriNetUnfolderBase]: For 1164/1164 co-relation queries the response was YES. [2023-11-17 11:29:45,807 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6680 conditions, 2764 events. 1801/2764 cut-off events. For 1164/1164 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 14093 event pairs, 382 based on Foata normal form. 69/2833 useless extension candidates. Maximal degree in co-relation 6667. Up to 1374 conditions per place. [2023-11-17 11:29:45,816 INFO L140 encePairwiseOnDemand]: 56/61 looper letters, 35 selfloop transitions, 5 changer transitions 9/49 dead transitions. [2023-11-17 11:29:45,816 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 49 transitions, 258 flow [2023-11-17 11:29:45,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 11:29:45,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-17 11:29:45,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 98 transitions. [2023-11-17 11:29:45,818 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4016393442622951 [2023-11-17 11:29:45,818 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 98 transitions. [2023-11-17 11:29:45,818 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 98 transitions. [2023-11-17 11:29:45,818 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:29:45,819 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 98 transitions. [2023-11-17 11:29:45,819 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:45,821 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 61.0) internal successors, (305), 5 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:45,821 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 61.0) internal successors, (305), 5 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:45,821 INFO L175 Difference]: Start difference. First operand has 33 places, 25 transitions, 93 flow. Second operand 4 states and 98 transitions. [2023-11-17 11:29:45,821 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 49 transitions, 258 flow [2023-11-17 11:29:45,823 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 49 transitions, 258 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-17 11:29:45,824 INFO L231 Difference]: Finished difference. Result has 37 places, 25 transitions, 109 flow [2023-11-17 11:29:45,825 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=93, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=109, PETRI_PLACES=37, PETRI_TRANSITIONS=25} [2023-11-17 11:29:45,826 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 5 predicate places. [2023-11-17 11:29:45,826 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 25 transitions, 109 flow [2023-11-17 11:29:45,826 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:45,826 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:29:45,827 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:29:45,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-17 11:29:45,827 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 11:29:45,827 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:29:45,827 INFO L85 PathProgramCache]: Analyzing trace with hash -1072594860, now seen corresponding path program 2 times [2023-11-17 11:29:45,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:29:45,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818324154] [2023-11-17 11:29:45,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:29:45,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:29:45,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:29:45,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:29:45,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:29:45,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818324154] [2023-11-17 11:29:45,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818324154] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:29:45,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:29:45,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 11:29:45,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817375259] [2023-11-17 11:29:45,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:29:45,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 11:29:45,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:29:45,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 11:29:45,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-17 11:29:45,991 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 61 [2023-11-17 11:29:45,991 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 25 transitions, 109 flow. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:45,991 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:29:45,991 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 61 [2023-11-17 11:29:45,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:29:46,212 INFO L124 PetriNetUnfolderBase]: 763/1280 cut-off events. [2023-11-17 11:29:46,212 INFO L125 PetriNetUnfolderBase]: For 664/669 co-relation queries the response was YES. [2023-11-17 11:29:46,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3374 conditions, 1280 events. 763/1280 cut-off events. For 664/669 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 6276 event pairs, 164 based on Foata normal form. 123/1399 useless extension candidates. Maximal degree in co-relation 3358. Up to 524 conditions per place. [2023-11-17 11:29:46,220 INFO L140 encePairwiseOnDemand]: 55/61 looper letters, 48 selfloop transitions, 5 changer transitions 1/56 dead transitions. [2023-11-17 11:29:46,220 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 56 transitions, 329 flow [2023-11-17 11:29:46,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 11:29:46,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-17 11:29:46,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 98 transitions. [2023-11-17 11:29:46,221 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4016393442622951 [2023-11-17 11:29:46,222 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 98 transitions. [2023-11-17 11:29:46,222 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 98 transitions. [2023-11-17 11:29:46,222 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:29:46,222 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 98 transitions. [2023-11-17 11:29:46,222 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:46,223 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 61.0) internal successors, (305), 5 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:46,223 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 61.0) internal successors, (305), 5 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:46,223 INFO L175 Difference]: Start difference. First operand has 37 places, 25 transitions, 109 flow. Second operand 4 states and 98 transitions. [2023-11-17 11:29:46,223 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 56 transitions, 329 flow [2023-11-17 11:29:46,227 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 56 transitions, 304 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-11-17 11:29:46,228 INFO L231 Difference]: Finished difference. Result has 38 places, 28 transitions, 126 flow [2023-11-17 11:29:46,228 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=126, PETRI_PLACES=38, PETRI_TRANSITIONS=28} [2023-11-17 11:29:46,230 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 6 predicate places. [2023-11-17 11:29:46,230 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 28 transitions, 126 flow [2023-11-17 11:29:46,230 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:46,230 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:29:46,231 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:29:46,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-17 11:29:46,231 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 11:29:46,231 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:29:46,231 INFO L85 PathProgramCache]: Analyzing trace with hash -1436317696, now seen corresponding path program 1 times [2023-11-17 11:29:46,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:29:46,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106142642] [2023-11-17 11:29:46,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:29:46,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:29:46,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:29:46,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:29:46,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:29:46,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106142642] [2023-11-17 11:29:46,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106142642] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:29:46,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:29:46,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-17 11:29:46,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065754262] [2023-11-17 11:29:46,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:29:46,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-17 11:29:46,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:29:46,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-17 11:29:46,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-17 11:29:46,424 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 61 [2023-11-17 11:29:46,425 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 28 transitions, 126 flow. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:46,425 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:29:46,425 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 61 [2023-11-17 11:29:46,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:29:46,605 INFO L124 PetriNetUnfolderBase]: 384/698 cut-off events. [2023-11-17 11:29:46,605 INFO L125 PetriNetUnfolderBase]: For 441/445 co-relation queries the response was YES. [2023-11-17 11:29:46,607 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2152 conditions, 698 events. 384/698 cut-off events. For 441/445 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 3144 event pairs, 75 based on Foata normal form. 73/767 useless extension candidates. Maximal degree in co-relation 2136. Up to 300 conditions per place. [2023-11-17 11:29:46,609 INFO L140 encePairwiseOnDemand]: 55/61 looper letters, 58 selfloop transitions, 8 changer transitions 1/69 dead transitions. [2023-11-17 11:29:46,609 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 69 transitions, 414 flow [2023-11-17 11:29:46,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 11:29:46,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 11:29:46,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 123 transitions. [2023-11-17 11:29:46,611 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40327868852459015 [2023-11-17 11:29:46,611 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 123 transitions. [2023-11-17 11:29:46,611 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 123 transitions. [2023-11-17 11:29:46,611 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:29:46,611 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 123 transitions. [2023-11-17 11:29:46,612 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 24.6) internal successors, (123), 5 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:46,613 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 61.0) internal successors, (366), 6 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:46,613 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 61.0) internal successors, (366), 6 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:46,613 INFO L175 Difference]: Start difference. First operand has 38 places, 28 transitions, 126 flow. Second operand 5 states and 123 transitions. [2023-11-17 11:29:46,614 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 69 transitions, 414 flow [2023-11-17 11:29:46,617 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 69 transitions, 404 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-11-17 11:29:46,619 INFO L231 Difference]: Finished difference. Result has 42 places, 31 transitions, 166 flow [2023-11-17 11:29:46,619 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=166, PETRI_PLACES=42, PETRI_TRANSITIONS=31} [2023-11-17 11:29:46,621 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 10 predicate places. [2023-11-17 11:29:46,622 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 31 transitions, 166 flow [2023-11-17 11:29:46,622 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:46,622 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:29:46,622 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:29:46,622 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-17 11:29:46,622 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 11:29:46,623 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:29:46,623 INFO L85 PathProgramCache]: Analyzing trace with hash 505179598, now seen corresponding path program 1 times [2023-11-17 11:29:46,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:29:46,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029725264] [2023-11-17 11:29:46,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:29:46,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:29:46,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:29:46,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:29:46,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:29:46,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029725264] [2023-11-17 11:29:46,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029725264] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:29:46,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:29:46,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-17 11:29:46,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884195781] [2023-11-17 11:29:46,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:29:46,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-17 11:29:46,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:29:46,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-17 11:29:46,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-17 11:29:46,892 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 61 [2023-11-17 11:29:46,892 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 31 transitions, 166 flow. Second operand has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:46,893 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:29:46,893 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 61 [2023-11-17 11:29:46,893 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:29:47,064 INFO L124 PetriNetUnfolderBase]: 251/464 cut-off events. [2023-11-17 11:29:47,064 INFO L125 PetriNetUnfolderBase]: For 571/575 co-relation queries the response was YES. [2023-11-17 11:29:47,066 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1581 conditions, 464 events. 251/464 cut-off events. For 571/575 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1909 event pairs, 75 based on Foata normal form. 21/481 useless extension candidates. Maximal degree in co-relation 1563. Up to 178 conditions per place. [2023-11-17 11:29:47,068 INFO L140 encePairwiseOnDemand]: 55/61 looper letters, 42 selfloop transitions, 11 changer transitions 2/57 dead transitions. [2023-11-17 11:29:47,068 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 57 transitions, 373 flow [2023-11-17 11:29:47,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-17 11:29:47,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-17 11:29:47,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 126 transitions. [2023-11-17 11:29:47,069 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3442622950819672 [2023-11-17 11:29:47,069 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 126 transitions. [2023-11-17 11:29:47,069 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 126 transitions. [2023-11-17 11:29:47,070 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:29:47,070 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 126 transitions. [2023-11-17 11:29:47,070 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 21.0) internal successors, (126), 6 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:47,071 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 61.0) internal successors, (427), 7 states have internal predecessors, (427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:47,071 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 61.0) internal successors, (427), 7 states have internal predecessors, (427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:47,071 INFO L175 Difference]: Start difference. First operand has 42 places, 31 transitions, 166 flow. Second operand 6 states and 126 transitions. [2023-11-17 11:29:47,071 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 57 transitions, 373 flow [2023-11-17 11:29:47,074 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 57 transitions, 339 flow, removed 5 selfloop flow, removed 5 redundant places. [2023-11-17 11:29:47,075 INFO L231 Difference]: Finished difference. Result has 44 places, 31 transitions, 175 flow [2023-11-17 11:29:47,075 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=139, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=175, PETRI_PLACES=44, PETRI_TRANSITIONS=31} [2023-11-17 11:29:47,076 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 12 predicate places. [2023-11-17 11:29:47,076 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 31 transitions, 175 flow [2023-11-17 11:29:47,076 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:47,077 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:29:47,077 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 11:29:47,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-17 11:29:47,077 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 11:29:47,077 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:29:47,077 INFO L85 PathProgramCache]: Analyzing trace with hash 1530742466, now seen corresponding path program 1 times [2023-11-17 11:29:47,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:29:47,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495956864] [2023-11-17 11:29:47,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:29:47,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:29:47,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:29:47,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:29:47,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:29:47,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495956864] [2023-11-17 11:29:47,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495956864] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:29:47,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:29:47,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-17 11:29:47,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854171497] [2023-11-17 11:29:47,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:29:47,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-17 11:29:47,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:29:47,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-17 11:29:47,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-17 11:29:47,893 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 61 [2023-11-17 11:29:47,893 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 31 transitions, 175 flow. Second operand has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 7 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:47,893 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:29:47,893 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 61 [2023-11-17 11:29:47,893 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:29:48,204 INFO L124 PetriNetUnfolderBase]: 257/494 cut-off events. [2023-11-17 11:29:48,205 INFO L125 PetriNetUnfolderBase]: For 721/721 co-relation queries the response was YES. [2023-11-17 11:29:48,206 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1666 conditions, 494 events. 257/494 cut-off events. For 721/721 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 2203 event pairs, 20 based on Foata normal form. 1/495 useless extension candidates. Maximal degree in co-relation 1648. Up to 248 conditions per place. [2023-11-17 11:29:48,208 INFO L140 encePairwiseOnDemand]: 55/61 looper letters, 40 selfloop transitions, 4 changer transitions 28/74 dead transitions. [2023-11-17 11:29:48,208 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 74 transitions, 560 flow [2023-11-17 11:29:48,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-17 11:29:48,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-17 11:29:48,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 162 transitions. [2023-11-17 11:29:48,209 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3793911007025761 [2023-11-17 11:29:48,210 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 162 transitions. [2023-11-17 11:29:48,210 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 162 transitions. [2023-11-17 11:29:48,210 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:29:48,210 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 162 transitions. [2023-11-17 11:29:48,210 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 23.142857142857142) internal successors, (162), 7 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:48,211 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 61.0) internal successors, (488), 8 states have internal predecessors, (488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:48,212 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 61.0) internal successors, (488), 8 states have internal predecessors, (488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:48,212 INFO L175 Difference]: Start difference. First operand has 44 places, 31 transitions, 175 flow. Second operand 7 states and 162 transitions. [2023-11-17 11:29:48,212 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 74 transitions, 560 flow [2023-11-17 11:29:48,216 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 74 transitions, 414 flow, removed 20 selfloop flow, removed 9 redundant places. [2023-11-17 11:29:48,217 INFO L231 Difference]: Finished difference. Result has 43 places, 31 transitions, 133 flow [2023-11-17 11:29:48,217 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=117, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=133, PETRI_PLACES=43, PETRI_TRANSITIONS=31} [2023-11-17 11:29:48,219 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 11 predicate places. [2023-11-17 11:29:48,219 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 31 transitions, 133 flow [2023-11-17 11:29:48,219 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 7 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:48,220 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:29:48,220 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 11:29:48,220 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-17 11:29:48,220 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 11:29:48,224 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:29:48,224 INFO L85 PathProgramCache]: Analyzing trace with hash -57744932, now seen corresponding path program 2 times [2023-11-17 11:29:48,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:29:48,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883445476] [2023-11-17 11:29:48,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:29:48,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:29:48,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-17 11:29:48,293 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-17 11:29:48,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-17 11:29:48,392 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-17 11:29:48,393 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-17 11:29:48,393 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2023-11-17 11:29:48,395 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-11-17 11:29:48,397 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2023-11-17 11:29:48,397 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2023-11-17 11:29:48,398 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2023-11-17 11:29:48,398 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-11-17 11:29:48,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-17 11:29:48,398 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1] [2023-11-17 11:29:48,404 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-17 11:29:48,405 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-17 11:29:48,450 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-17 11:29:48,453 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-17 11:29:48,455 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-17 11:29:48,479 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.11 11:29:48 BasicIcfg [2023-11-17 11:29:48,479 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-17 11:29:48,480 INFO L158 Benchmark]: Toolchain (without parser) took 7927.92ms. Allocated memory was 185.6MB in the beginning and 392.2MB in the end (delta: 206.6MB). Free memory was 131.2MB in the beginning and 218.7MB in the end (delta: -87.5MB). Peak memory consumption was 120.2MB. Max. memory is 8.0GB. [2023-11-17 11:29:48,480 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 185.6MB. Free memory is still 138.6MB. There was no memory consumed. Max. memory is 8.0GB. [2023-11-17 11:29:48,480 INFO L158 Benchmark]: CACSL2BoogieTranslator took 589.68ms. Allocated memory is still 185.6MB. Free memory was 130.9MB in the beginning and 107.7MB in the end (delta: 23.2MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. [2023-11-17 11:29:48,480 INFO L158 Benchmark]: Boogie Procedure Inliner took 72.92ms. Allocated memory is still 185.6MB. Free memory was 107.4MB in the beginning and 105.0MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-11-17 11:29:48,483 INFO L158 Benchmark]: Boogie Preprocessor took 60.38ms. Allocated memory is still 185.6MB. Free memory was 105.0MB in the beginning and 103.2MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-11-17 11:29:48,484 INFO L158 Benchmark]: RCFGBuilder took 734.86ms. Allocated memory was 185.6MB in the beginning and 271.6MB in the end (delta: 86.0MB). Free memory was 103.2MB in the beginning and 200.1MB in the end (delta: -96.9MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-11-17 11:29:48,484 INFO L158 Benchmark]: TraceAbstraction took 6464.38ms. Allocated memory was 271.6MB in the beginning and 392.2MB in the end (delta: 120.6MB). Free memory was 199.5MB in the beginning and 218.7MB in the end (delta: -19.1MB). Peak memory consumption was 101.4MB. Max. memory is 8.0GB. [2023-11-17 11:29:48,489 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 185.6MB. Free memory is still 138.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 589.68ms. Allocated memory is still 185.6MB. Free memory was 130.9MB in the beginning and 107.7MB in the end (delta: 23.2MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 72.92ms. Allocated memory is still 185.6MB. Free memory was 107.4MB in the beginning and 105.0MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 60.38ms. Allocated memory is still 185.6MB. Free memory was 105.0MB in the beginning and 103.2MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 734.86ms. Allocated memory was 185.6MB in the beginning and 271.6MB in the end (delta: 86.0MB). Free memory was 103.2MB in the beginning and 200.1MB in the end (delta: -96.9MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 6464.38ms. Allocated memory was 271.6MB in the beginning and 392.2MB in the end (delta: 120.6MB). Free memory was 199.5MB in the beginning and 218.7MB in the end (delta: -19.1MB). Peak memory consumption was 101.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.1s, 44 PlacesBefore, 32 PlacesAfterwards, 36 TransitionsBefore, 23 TransitionsAfterwards, 738 CoEnabledTransitionPairs, 4 FixpointIterations, 0 TrivialSequentialCompositions, 16 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 1 ChoiceCompositions, 22 TotalNumberOfCompositions, 2201 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1028, independent: 929, independent conditional: 0, independent unconditional: 929, dependent: 99, dependent conditional: 0, dependent unconditional: 99, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 547, independent: 510, independent conditional: 0, independent unconditional: 510, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 547, independent: 481, independent conditional: 0, independent unconditional: 481, dependent: 66, dependent conditional: 0, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 66, independent: 29, independent conditional: 0, independent unconditional: 29, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 348, independent: 43, independent conditional: 0, independent unconditional: 43, dependent: 305, dependent conditional: 0, dependent unconditional: 305, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1028, independent: 419, independent conditional: 0, independent unconditional: 419, dependent: 62, dependent conditional: 0, dependent unconditional: 62, unknown: 547, unknown conditional: 0, unknown unconditional: 547] , Statistics on independence cache: Total cache size (in pairs): 97, Positive cache size: 80, Positive conditional cache size: 0, Positive unconditional cache size: 80, Negative cache size: 17, Negative conditional cache size: 0, Negative unconditional cache size: 17, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L713] 0 int __unbuffered_p2_EBX = 0; [L714] 0 _Bool main$tmp_guard0; [L715] 0 _Bool main$tmp_guard1; [L717] 0 int x = 0; [L719] 0 int y = 0; [L720] 0 _Bool y$flush_delayed; [L721] 0 int y$mem_tmp; [L722] 0 _Bool y$r_buff0_thd0; [L723] 0 _Bool y$r_buff0_thd1; [L724] 0 _Bool y$r_buff0_thd2; [L725] 0 _Bool y$r_buff0_thd3; [L726] 0 _Bool y$r_buff1_thd0; [L727] 0 _Bool y$r_buff1_thd1; [L728] 0 _Bool y$r_buff1_thd2; [L729] 0 _Bool y$r_buff1_thd3; [L730] 0 _Bool y$read_delayed; [L731] 0 int *y$read_delayed_var; [L732] 0 int y$w_buff0; [L733] 0 _Bool y$w_buff0_used; [L734] 0 int y$w_buff1; [L735] 0 _Bool y$w_buff1_used; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L828] 0 pthread_t t2393; [L829] FCALL, FORK 0 pthread_create(&t2393, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2393={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L830] 0 pthread_t t2394; [L831] FCALL, FORK 0 pthread_create(&t2394, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2393={5:0}, t2394={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L832] 0 pthread_t t2395; [L833] FCALL, FORK 0 pthread_create(&t2395, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2393={5:0}, t2394={6:0}, t2395={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L741] 1 y$w_buff1 = y$w_buff0 [L742] 1 y$w_buff0 = 1 [L743] 1 y$w_buff1_used = y$w_buff0_used [L744] 1 y$w_buff0_used = (_Bool)1 [L745] CALL 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L745] RET 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L746] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L747] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L748] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L749] 1 y$r_buff1_thd3 = y$r_buff0_thd3 [L750] 1 y$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L753] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L770] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L773] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L774] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L775] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L776] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L777] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L787] 3 __unbuffered_p2_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L790] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L791] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L792] 3 y$flush_delayed = weak$$choice2 [L793] 3 y$mem_tmp = y [L794] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L795] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L796] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L797] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L798] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L799] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L800] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L801] 3 __unbuffered_p2_EBX = y [L802] 3 y = y$flush_delayed ? y$mem_tmp : y [L803] 3 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L806] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L807] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L808] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L809] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L810] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L756] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L757] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L758] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L759] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L760] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L763] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L765] 1 return 0; [L780] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L782] 2 return 0; [L813] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L815] 3 return 0; [L835] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2393={5:0}, t2394={6:0}, t2395={3:0}, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L837] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L837] RET 0 assume_abort_if_not(main$tmp_guard0) [L839] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L840] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L841] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L842] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L843] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2393={5:0}, t2394={6:0}, t2395={3:0}, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L846] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0) [L848] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=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: 833]: 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: 831]: 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: 829]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 62 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 6.3s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 1.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 272 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 272 mSDsluCounter, 3 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1 mSDsCounter, 28 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 508 IncrementalHoareTripleChecker+Invalid, 536 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 28 mSolverCounterUnsat, 2 mSDtfsCounter, 508 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 34 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=175occurred in iteration=7, InterpolantAutomatonStates: 36, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 113 NumberOfCodeBlocks, 113 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 85 ConstructedInterpolants, 0 QuantifiedInterpolants, 500 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-11-17 11:29:48,508 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...