/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/mix012_pso.opt_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.dk.datarace-free-lbe-02cf818-m [2023-11-17 11:24:24,865 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-17 11:24:24,918 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:24:24,940 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-17 11:24:24,940 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-17 11:24:24,941 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-17 11:24:24,941 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-17 11:24:24,942 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-17 11:24:24,942 INFO L153 SettingsManager]: * Use SBE=true [2023-11-17 11:24:24,942 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-17 11:24:24,943 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-17 11:24:24,943 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-17 11:24:24,943 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-17 11:24:24,943 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-17 11:24:24,944 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-17 11:24:24,944 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-17 11:24:24,944 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-17 11:24:24,945 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-17 11:24:24,945 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-17 11:24:24,945 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-17 11:24:24,946 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-17 11:24:24,950 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-17 11:24:24,950 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-17 11:24:24,950 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-17 11:24:24,950 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-17 11:24:24,951 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 11:24:24,951 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-17 11:24:24,951 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-17 11:24:24,951 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-17 11:24:24,952 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-17 11:24:24,952 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-17 11:24:24,952 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-17 11:24:24,952 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:24:25,196 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-17 11:24:25,219 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-17 11:24:25,222 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-17 11:24:25,223 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-17 11:24:25,224 INFO L274 PluginConnector]: CDTParser initialized [2023-11-17 11:24:25,225 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix012_pso.opt_tso.opt.i [2023-11-17 11:24:26,540 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-17 11:24:26,782 INFO L384 CDTParser]: Found 1 translation units. [2023-11-17 11:24:26,783 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix012_pso.opt_tso.opt.i [2023-11-17 11:24:26,798 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ac64f33e/8f3df38ed1494878b8165783bec35dbc/FLAGd95ad5fc2 [2023-11-17 11:24:26,812 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ac64f33e/8f3df38ed1494878b8165783bec35dbc [2023-11-17 11:24:26,815 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-17 11:24:26,816 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-17 11:24:26,817 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-17 11:24:26,817 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-17 11:24:26,821 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-17 11:24:26,822 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 11:24:26" (1/1) ... [2023-11-17 11:24:26,823 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a7aabc1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:24:26, skipping insertion in model container [2023-11-17 11:24:26,823 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 11:24:26" (1/1) ... [2023-11-17 11:24:26,878 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-17 11:24:27,044 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/mix012_pso.opt_tso.opt.i[999,1012] [2023-11-17 11:24:27,232 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 11:24:27,250 INFO L202 MainTranslator]: Completed pre-run [2023-11-17 11:24:27,266 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/mix012_pso.opt_tso.opt.i[999,1012] [2023-11-17 11:24:27,319 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 11:24:27,348 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-17 11:24:27,349 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-17 11:24:27,354 INFO L206 MainTranslator]: Completed translation [2023-11-17 11:24:27,355 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:24:27 WrapperNode [2023-11-17 11:24:27,355 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-17 11:24:27,356 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-17 11:24:27,356 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-17 11:24:27,356 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-17 11:24:27,363 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:24:27" (1/1) ... [2023-11-17 11:24:27,378 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:24:27" (1/1) ... [2023-11-17 11:24:27,411 INFO L138 Inliner]: procedures = 175, calls = 43, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 133 [2023-11-17 11:24:27,412 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-17 11:24:27,418 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-17 11:24:27,419 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-17 11:24:27,419 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-17 11:24:27,433 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:24:27" (1/1) ... [2023-11-17 11:24:27,433 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:24:27" (1/1) ... [2023-11-17 11:24:27,445 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:24:27" (1/1) ... [2023-11-17 11:24:27,446 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:24:27" (1/1) ... [2023-11-17 11:24:27,453 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:24:27" (1/1) ... [2023-11-17 11:24:27,455 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:24:27" (1/1) ... [2023-11-17 11:24:27,473 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:24:27" (1/1) ... [2023-11-17 11:24:27,475 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:24:27" (1/1) ... [2023-11-17 11:24:27,478 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-17 11:24:27,478 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-17 11:24:27,479 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-17 11:24:27,479 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-17 11:24:27,479 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:24:27" (1/1) ... [2023-11-17 11:24:27,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 11:24:27,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 11:24:27,526 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:24:27,541 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:24:27,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-17 11:24:27,556 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-17 11:24:27,556 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-17 11:24:27,557 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-17 11:24:27,557 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-17 11:24:27,557 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-17 11:24:27,557 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-17 11:24:27,557 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-17 11:24:27,557 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-17 11:24:27,557 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-17 11:24:27,557 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-17 11:24:27,557 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-17 11:24:27,558 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-17 11:24:27,559 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:24:27,689 INFO L239 CfgBuilder]: Building ICFG [2023-11-17 11:24:27,693 INFO L265 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-17 11:24:28,086 INFO L280 CfgBuilder]: Performing block encoding [2023-11-17 11:24:28,290 INFO L302 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-17 11:24:28,291 INFO L307 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-17 11:24:28,292 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 11:24:28 BoogieIcfgContainer [2023-11-17 11:24:28,292 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-17 11:24:28,294 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-17 11:24:28,294 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-17 11:24:28,296 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-17 11:24:28,296 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 11:24:26" (1/3) ... [2023-11-17 11:24:28,297 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@220b71b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 11:24:28, skipping insertion in model container [2023-11-17 11:24:28,297 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:24:27" (2/3) ... [2023-11-17 11:24:28,297 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@220b71b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 11:24:28, skipping insertion in model container [2023-11-17 11:24:28,298 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 11:24:28" (3/3) ... [2023-11-17 11:24:28,299 INFO L112 eAbstractionObserver]: Analyzing ICFG mix012_pso.opt_tso.opt.i [2023-11-17 11:24:28,316 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-17 11:24:28,316 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-17 11:24:28,316 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-17 11:24:28,365 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-17 11:24:28,399 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 31 transitions, 70 flow [2023-11-17 11:24:28,427 INFO L124 PetriNetUnfolderBase]: 1/29 cut-off events. [2023-11-17 11:24:28,427 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 11:24:28,432 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36 conditions, 29 events. 1/29 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 42 event pairs, 0 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 29. Up to 2 conditions per place. [2023-11-17 11:24:28,433 INFO L82 GeneralOperation]: Start removeDead. Operand has 37 places, 31 transitions, 70 flow [2023-11-17 11:24:28,438 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 35 places, 29 transitions, 64 flow [2023-11-17 11:24:28,441 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-11-17 11:24:28,458 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 29 transitions, 64 flow [2023-11-17 11:24:28,463 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 29 transitions, 64 flow [2023-11-17 11:24:28,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 29 transitions, 64 flow [2023-11-17 11:24:28,478 INFO L124 PetriNetUnfolderBase]: 1/29 cut-off events. [2023-11-17 11:24:28,478 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 11:24:28,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36 conditions, 29 events. 1/29 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 42 event pairs, 0 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 29. Up to 2 conditions per place. [2023-11-17 11:24:28,479 INFO L119 LiptonReduction]: Number of co-enabled transitions 428 [2023-11-17 11:24:29,683 INFO L134 LiptonReduction]: Checked pairs total: 1011 [2023-11-17 11:24:29,683 INFO L136 LiptonReduction]: Total number of compositions: 17 [2023-11-17 11:24:29,703 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-17 11:24:29,712 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;@79f116a9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-17 11:24:29,712 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-11-17 11:24:29,717 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-17 11:24:29,717 INFO L124 PetriNetUnfolderBase]: 0/8 cut-off events. [2023-11-17 11:24:29,717 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 11:24:29,717 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:24:29,718 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-17 11:24:29,719 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-17 11:24:29,723 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:24:29,723 INFO L85 PathProgramCache]: Analyzing trace with hash 327903922, now seen corresponding path program 1 times [2023-11-17 11:24:29,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:24:29,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207330812] [2023-11-17 11:24:29,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:24:29,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:24:29,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:24:30,216 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:24:30,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:24:30,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207330812] [2023-11-17 11:24:30,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207330812] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:24:30,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:24:30,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-17 11:24:30,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513006276] [2023-11-17 11:24:30,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:24:30,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 11:24:30,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:24:30,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 11:24:30,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 11:24:30,262 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 48 [2023-11-17 11:24:30,264 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 17 transitions, 40 flow. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 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:24:30,264 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:24:30,264 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 48 [2023-11-17 11:24:30,265 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:24:30,407 INFO L124 PetriNetUnfolderBase]: 142/271 cut-off events. [2023-11-17 11:24:30,407 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-17 11:24:30,409 INFO L83 FinitePrefix]: Finished finitePrefix Result has 536 conditions, 271 events. 142/271 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 989 event pairs, 18 based on Foata normal form. 0/251 useless extension candidates. Maximal degree in co-relation 526. Up to 205 conditions per place. [2023-11-17 11:24:30,412 INFO L140 encePairwiseOnDemand]: 45/48 looper letters, 18 selfloop transitions, 2 changer transitions 2/23 dead transitions. [2023-11-17 11:24:30,412 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 23 transitions, 96 flow [2023-11-17 11:24:30,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 11:24:30,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 11:24:30,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 65 transitions. [2023-11-17 11:24:30,424 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4513888888888889 [2023-11-17 11:24:30,425 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 65 transitions. [2023-11-17 11:24:30,425 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 65 transitions. [2023-11-17 11:24:30,426 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:24:30,428 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 65 transitions. [2023-11-17 11:24:30,430 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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:24:30,436 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 48.0) internal successors, (192), 4 states have internal predecessors, (192), 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:24:30,436 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 48.0) internal successors, (192), 4 states have internal predecessors, (192), 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:24:30,438 INFO L175 Difference]: Start difference. First operand has 24 places, 17 transitions, 40 flow. Second operand 3 states and 65 transitions. [2023-11-17 11:24:30,439 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 23 transitions, 96 flow [2023-11-17 11:24:30,441 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 23 transitions, 94 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-17 11:24:30,444 INFO L231 Difference]: Finished difference. Result has 23 places, 15 transitions, 38 flow [2023-11-17 11:24:30,445 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=36, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=38, PETRI_PLACES=23, PETRI_TRANSITIONS=15} [2023-11-17 11:24:30,448 INFO L281 CegarLoopForPetriNet]: 24 programPoint places, -1 predicate places. [2023-11-17 11:24:30,448 INFO L495 AbstractCegarLoop]: Abstraction has has 23 places, 15 transitions, 38 flow [2023-11-17 11:24:30,449 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 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:24:30,449 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:24:30,449 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:24:30,449 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-17 11:24:30,449 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-17 11:24:30,450 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:24:30,450 INFO L85 PathProgramCache]: Analyzing trace with hash 1583070423, now seen corresponding path program 1 times [2023-11-17 11:24:30,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:24:30,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424379262] [2023-11-17 11:24:30,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:24:30,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:24:30,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:24:30,671 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:24:30,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:24:30,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424379262] [2023-11-17 11:24:30,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424379262] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:24:30,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:24:30,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-17 11:24:30,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167512649] [2023-11-17 11:24:30,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:24:30,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 11:24:30,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:24:30,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 11:24:30,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 11:24:30,675 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 48 [2023-11-17 11:24:30,676 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 15 transitions, 38 flow. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 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:24:30,676 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:24:30,676 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 48 [2023-11-17 11:24:30,676 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:24:30,765 INFO L124 PetriNetUnfolderBase]: 127/228 cut-off events. [2023-11-17 11:24:30,765 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2023-11-17 11:24:30,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 484 conditions, 228 events. 127/228 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 718 event pairs, 43 based on Foata normal form. 4/232 useless extension candidates. Maximal degree in co-relation 474. Up to 201 conditions per place. [2023-11-17 11:24:30,767 INFO L140 encePairwiseOnDemand]: 44/48 looper letters, 20 selfloop transitions, 3 changer transitions 0/23 dead transitions. [2023-11-17 11:24:30,767 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 23 transitions, 104 flow [2023-11-17 11:24:30,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 11:24:30,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 11:24:30,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2023-11-17 11:24:30,769 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2023-11-17 11:24:30,769 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 60 transitions. [2023-11-17 11:24:30,770 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 60 transitions. [2023-11-17 11:24:30,770 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:24:30,770 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 60 transitions. [2023-11-17 11:24:30,770 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 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:24:30,771 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 48.0) internal successors, (192), 4 states have internal predecessors, (192), 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:24:30,771 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 48.0) internal successors, (192), 4 states have internal predecessors, (192), 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:24:30,771 INFO L175 Difference]: Start difference. First operand has 23 places, 15 transitions, 38 flow. Second operand 3 states and 60 transitions. [2023-11-17 11:24:30,772 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 23 transitions, 104 flow [2023-11-17 11:24:30,772 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 22 places, 23 transitions, 98 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-17 11:24:30,773 INFO L231 Difference]: Finished difference. Result has 23 places, 17 transitions, 53 flow [2023-11-17 11:24:30,773 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=34, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=53, PETRI_PLACES=23, PETRI_TRANSITIONS=17} [2023-11-17 11:24:30,774 INFO L281 CegarLoopForPetriNet]: 24 programPoint places, -1 predicate places. [2023-11-17 11:24:30,774 INFO L495 AbstractCegarLoop]: Abstraction has has 23 places, 17 transitions, 53 flow [2023-11-17 11:24:30,774 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 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:24:30,774 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:24:30,774 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:24:30,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-17 11:24:30,775 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-17 11:24:30,775 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:24:30,775 INFO L85 PathProgramCache]: Analyzing trace with hash 1875476050, now seen corresponding path program 1 times [2023-11-17 11:24:30,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:24:30,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243354517] [2023-11-17 11:24:30,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:24:30,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:24:30,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:24:30,930 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:24:30,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:24:30,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243354517] [2023-11-17 11:24:30,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243354517] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:24:30,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:24:30,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 11:24:30,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280339828] [2023-11-17 11:24:30,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:24:30,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 11:24:30,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:24:30,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 11:24:30,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-17 11:24:30,933 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 48 [2023-11-17 11:24:30,933 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 17 transitions, 53 flow. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 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:24:30,933 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:24:30,933 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 48 [2023-11-17 11:24:30,933 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:24:31,045 INFO L124 PetriNetUnfolderBase]: 121/218 cut-off events. [2023-11-17 11:24:31,046 INFO L125 PetriNetUnfolderBase]: For 33/33 co-relation queries the response was YES. [2023-11-17 11:24:31,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 517 conditions, 218 events. 121/218 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 649 event pairs, 41 based on Foata normal form. 4/222 useless extension candidates. Maximal degree in co-relation 506. Up to 157 conditions per place. [2023-11-17 11:24:31,049 INFO L140 encePairwiseOnDemand]: 45/48 looper letters, 18 selfloop transitions, 3 changer transitions 0/21 dead transitions. [2023-11-17 11:24:31,049 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 21 transitions, 103 flow [2023-11-17 11:24:31,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 11:24:31,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 11:24:31,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 57 transitions. [2023-11-17 11:24:31,052 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3958333333333333 [2023-11-17 11:24:31,052 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 57 transitions. [2023-11-17 11:24:31,052 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 57 transitions. [2023-11-17 11:24:31,054 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:24:31,054 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 57 transitions. [2023-11-17 11:24:31,054 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 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:24:31,055 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 48.0) internal successors, (192), 4 states have internal predecessors, (192), 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:24:31,055 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 48.0) internal successors, (192), 4 states have internal predecessors, (192), 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:24:31,055 INFO L175 Difference]: Start difference. First operand has 23 places, 17 transitions, 53 flow. Second operand 3 states and 57 transitions. [2023-11-17 11:24:31,055 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 21 transitions, 103 flow [2023-11-17 11:24:31,057 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 21 transitions, 100 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-17 11:24:31,058 INFO L231 Difference]: Finished difference. Result has 25 places, 17 transitions, 61 flow [2023-11-17 11:24:31,058 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=61, PETRI_PLACES=25, PETRI_TRANSITIONS=17} [2023-11-17 11:24:31,059 INFO L281 CegarLoopForPetriNet]: 24 programPoint places, 1 predicate places. [2023-11-17 11:24:31,060 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 17 transitions, 61 flow [2023-11-17 11:24:31,060 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 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:24:31,060 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:24:31,060 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:24:31,060 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-17 11:24:31,061 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-17 11:24:31,061 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:24:31,062 INFO L85 PathProgramCache]: Analyzing trace with hash 911994164, now seen corresponding path program 1 times [2023-11-17 11:24:31,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:24:31,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008591143] [2023-11-17 11:24:31,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:24:31,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:24:31,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:24:31,237 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:24:31,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:24:31,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008591143] [2023-11-17 11:24:31,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008591143] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:24:31,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:24:31,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 11:24:31,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157814274] [2023-11-17 11:24:31,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:24:31,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 11:24:31,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:24:31,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 11:24:31,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-17 11:24:31,240 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 48 [2023-11-17 11:24:31,241 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 17 transitions, 61 flow. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 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:24:31,241 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:24:31,241 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 48 [2023-11-17 11:24:31,241 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:24:31,349 INFO L124 PetriNetUnfolderBase]: 60/137 cut-off events. [2023-11-17 11:24:31,349 INFO L125 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2023-11-17 11:24:31,350 INFO L83 FinitePrefix]: Finished finitePrefix Result has 342 conditions, 137 events. 60/137 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 444 event pairs, 23 based on Foata normal form. 20/157 useless extension candidates. Maximal degree in co-relation 329. Up to 58 conditions per place. [2023-11-17 11:24:31,350 INFO L140 encePairwiseOnDemand]: 43/48 looper letters, 28 selfloop transitions, 4 changer transitions 1/34 dead transitions. [2023-11-17 11:24:31,350 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 34 transitions, 177 flow [2023-11-17 11:24:31,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 11:24:31,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-17 11:24:31,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 77 transitions. [2023-11-17 11:24:31,354 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4010416666666667 [2023-11-17 11:24:31,354 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 77 transitions. [2023-11-17 11:24:31,354 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 77 transitions. [2023-11-17 11:24:31,355 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:24:31,355 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 77 transitions. [2023-11-17 11:24:31,356 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 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:24:31,357 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 48.0) internal successors, (240), 5 states have internal predecessors, (240), 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:24:31,357 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 48.0) internal successors, (240), 5 states have internal predecessors, (240), 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:24:31,357 INFO L175 Difference]: Start difference. First operand has 25 places, 17 transitions, 61 flow. Second operand 4 states and 77 transitions. [2023-11-17 11:24:31,357 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 34 transitions, 177 flow [2023-11-17 11:24:31,359 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 34 transitions, 167 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-17 11:24:31,360 INFO L231 Difference]: Finished difference. Result has 28 places, 19 transitions, 81 flow [2023-11-17 11:24:31,360 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=55, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=81, PETRI_PLACES=28, PETRI_TRANSITIONS=19} [2023-11-17 11:24:31,361 INFO L281 CegarLoopForPetriNet]: 24 programPoint places, 4 predicate places. [2023-11-17 11:24:31,362 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 19 transitions, 81 flow [2023-11-17 11:24:31,362 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 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:24:31,362 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:24:31,362 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:24:31,362 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-17 11:24:31,363 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-17 11:24:31,363 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:24:31,363 INFO L85 PathProgramCache]: Analyzing trace with hash 650686583, now seen corresponding path program 1 times [2023-11-17 11:24:31,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:24:31,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879022759] [2023-11-17 11:24:31,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:24:31,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:24:31,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:24:31,510 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:24:31,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:24:31,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879022759] [2023-11-17 11:24:31,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879022759] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:24:31,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:24:31,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-17 11:24:31,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698854801] [2023-11-17 11:24:31,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:24:31,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-17 11:24:31,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:24:31,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-17 11:24:31,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-17 11:24:31,514 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 48 [2023-11-17 11:24:31,515 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 19 transitions, 81 flow. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 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:24:31,515 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:24:31,515 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 48 [2023-11-17 11:24:31,515 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:24:31,594 INFO L124 PetriNetUnfolderBase]: 24/67 cut-off events. [2023-11-17 11:24:31,595 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2023-11-17 11:24:31,598 INFO L83 FinitePrefix]: Finished finitePrefix Result has 210 conditions, 67 events. 24/67 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 152 event pairs, 8 based on Foata normal form. 8/75 useless extension candidates. Maximal degree in co-relation 195. Up to 29 conditions per place. [2023-11-17 11:24:31,600 INFO L140 encePairwiseOnDemand]: 43/48 looper letters, 19 selfloop transitions, 6 changer transitions 1/27 dead transitions. [2023-11-17 11:24:31,600 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 27 transitions, 159 flow [2023-11-17 11:24:31,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 11:24:31,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 11:24:31,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 81 transitions. [2023-11-17 11:24:31,602 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3375 [2023-11-17 11:24:31,602 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 81 transitions. [2023-11-17 11:24:31,602 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 81 transitions. [2023-11-17 11:24:31,602 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:24:31,602 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 81 transitions. [2023-11-17 11:24:31,603 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 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:24:31,603 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 48.0) internal successors, (288), 6 states have internal predecessors, (288), 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:24:31,604 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 48.0) internal successors, (288), 6 states have internal predecessors, (288), 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:24:31,604 INFO L175 Difference]: Start difference. First operand has 28 places, 19 transitions, 81 flow. Second operand 5 states and 81 transitions. [2023-11-17 11:24:31,604 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 27 transitions, 159 flow [2023-11-17 11:24:31,606 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 27 transitions, 142 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-11-17 11:24:31,607 INFO L231 Difference]: Finished difference. Result has 31 places, 19 transitions, 90 flow [2023-11-17 11:24:31,607 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=67, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=90, PETRI_PLACES=31, PETRI_TRANSITIONS=19} [2023-11-17 11:24:31,609 INFO L281 CegarLoopForPetriNet]: 24 programPoint places, 7 predicate places. [2023-11-17 11:24:31,609 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 19 transitions, 90 flow [2023-11-17 11:24:31,611 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 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:24:31,611 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:24:31,611 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:24:31,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-17 11:24:31,612 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-17 11:24:31,612 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:24:31,612 INFO L85 PathProgramCache]: Analyzing trace with hash -1713365348, now seen corresponding path program 1 times [2023-11-17 11:24:31,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:24:31,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230473968] [2023-11-17 11:24:31,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:24:31,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:24:31,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:24:31,856 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:24:31,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:24:31,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230473968] [2023-11-17 11:24:31,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230473968] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:24:31,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:24:31,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 11:24:31,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759066424] [2023-11-17 11:24:31,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:24:31,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 11:24:31,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:24:31,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 11:24:31,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-17 11:24:31,864 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 48 [2023-11-17 11:24:31,864 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 19 transitions, 90 flow. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 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:24:31,864 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:24:31,864 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 48 [2023-11-17 11:24:31,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:24:31,938 INFO L124 PetriNetUnfolderBase]: 24/71 cut-off events. [2023-11-17 11:24:31,938 INFO L125 PetriNetUnfolderBase]: For 74/74 co-relation queries the response was YES. [2023-11-17 11:24:31,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 241 conditions, 71 events. 24/71 cut-off events. For 74/74 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 180 event pairs, 1 based on Foata normal form. 1/72 useless extension candidates. Maximal degree in co-relation 225. Up to 41 conditions per place. [2023-11-17 11:24:31,939 INFO L140 encePairwiseOnDemand]: 42/48 looper letters, 21 selfloop transitions, 7 changer transitions 10/38 dead transitions. [2023-11-17 11:24:31,939 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 38 transitions, 252 flow [2023-11-17 11:24:31,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 11:24:31,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 11:24:31,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 89 transitions. [2023-11-17 11:24:31,942 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37083333333333335 [2023-11-17 11:24:31,942 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 89 transitions. [2023-11-17 11:24:31,942 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 89 transitions. [2023-11-17 11:24:31,942 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:24:31,942 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 89 transitions. [2023-11-17 11:24:31,943 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 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:24:31,943 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 48.0) internal successors, (288), 6 states have internal predecessors, (288), 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:24:31,943 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 48.0) internal successors, (288), 6 states have internal predecessors, (288), 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:24:31,944 INFO L175 Difference]: Start difference. First operand has 31 places, 19 transitions, 90 flow. Second operand 5 states and 89 transitions. [2023-11-17 11:24:31,944 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 38 transitions, 252 flow [2023-11-17 11:24:31,945 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 38 transitions, 190 flow, removed 10 selfloop flow, removed 7 redundant places. [2023-11-17 11:24:31,946 INFO L231 Difference]: Finished difference. Result has 30 places, 21 transitions, 92 flow [2023-11-17 11:24:31,946 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=92, PETRI_PLACES=30, PETRI_TRANSITIONS=21} [2023-11-17 11:24:31,946 INFO L281 CegarLoopForPetriNet]: 24 programPoint places, 6 predicate places. [2023-11-17 11:24:31,946 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 21 transitions, 92 flow [2023-11-17 11:24:31,946 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 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:24:31,947 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:24:31,947 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:24:31,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-17 11:24:31,947 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-17 11:24:31,947 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:24:31,947 INFO L85 PathProgramCache]: Analyzing trace with hash -2041362148, now seen corresponding path program 2 times [2023-11-17 11:24:31,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:24:31,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121000686] [2023-11-17 11:24:31,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:24:31,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:24:31,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:24:32,129 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:24:32,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:24:32,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121000686] [2023-11-17 11:24:32,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121000686] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:24:32,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:24:32,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 11:24:32,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821368284] [2023-11-17 11:24:32,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:24:32,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 11:24:32,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:24:32,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 11:24:32,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-17 11:24:32,132 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 48 [2023-11-17 11:24:32,132 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 21 transitions, 92 flow. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 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:24:32,132 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:24:32,132 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 48 [2023-11-17 11:24:32,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:24:32,208 INFO L124 PetriNetUnfolderBase]: 17/64 cut-off events. [2023-11-17 11:24:32,208 INFO L125 PetriNetUnfolderBase]: For 47/47 co-relation queries the response was YES. [2023-11-17 11:24:32,209 INFO L83 FinitePrefix]: Finished finitePrefix Result has 198 conditions, 64 events. 17/64 cut-off events. For 47/47 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 163 event pairs, 3 based on Foata normal form. 1/65 useless extension candidates. Maximal degree in co-relation 183. Up to 29 conditions per place. [2023-11-17 11:24:32,210 INFO L140 encePairwiseOnDemand]: 45/48 looper letters, 18 selfloop transitions, 1 changer transitions 14/33 dead transitions. [2023-11-17 11:24:32,210 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 33 transitions, 193 flow [2023-11-17 11:24:32,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 11:24:32,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-17 11:24:32,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 73 transitions. [2023-11-17 11:24:32,211 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3802083333333333 [2023-11-17 11:24:32,211 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 73 transitions. [2023-11-17 11:24:32,211 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 73 transitions. [2023-11-17 11:24:32,211 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:24:32,211 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 73 transitions. [2023-11-17 11:24:32,212 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 18.25) internal successors, (73), 4 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:24:32,213 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 48.0) internal successors, (240), 5 states have internal predecessors, (240), 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:24:32,213 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 48.0) internal successors, (240), 5 states have internal predecessors, (240), 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:24:32,214 INFO L175 Difference]: Start difference. First operand has 30 places, 21 transitions, 92 flow. Second operand 4 states and 73 transitions. [2023-11-17 11:24:32,214 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 33 transitions, 193 flow [2023-11-17 11:24:32,216 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 33 transitions, 190 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-17 11:24:32,217 INFO L231 Difference]: Finished difference. Result has 33 places, 17 transitions, 67 flow [2023-11-17 11:24:32,217 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=89, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=67, PETRI_PLACES=33, PETRI_TRANSITIONS=17} [2023-11-17 11:24:32,218 INFO L281 CegarLoopForPetriNet]: 24 programPoint places, 9 predicate places. [2023-11-17 11:24:32,218 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 17 transitions, 67 flow [2023-11-17 11:24:32,218 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 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:24:32,219 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:24:32,220 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:24:32,221 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-17 11:24:32,221 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-17 11:24:32,222 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:24:32,222 INFO L85 PathProgramCache]: Analyzing trace with hash 537258002, now seen corresponding path program 3 times [2023-11-17 11:24:32,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:24:32,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136259517] [2023-11-17 11:24:32,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:24:32,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:24:32,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:24:33,585 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:24:33,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:24:33,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136259517] [2023-11-17 11:24:33,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136259517] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:24:33,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:24:33,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-17 11:24:33,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012729956] [2023-11-17 11:24:33,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:24:33,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-17 11:24:33,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:24:33,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-17 11:24:33,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-17 11:24:33,589 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 48 [2023-11-17 11:24:33,589 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 17 transitions, 67 flow. Second operand has 7 states, 7 states have (on average 15.0) internal successors, (105), 7 states have internal predecessors, (105), 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:24:33,589 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:24:33,589 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 48 [2023-11-17 11:24:33,589 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:24:33,838 INFO L124 PetriNetUnfolderBase]: 6/36 cut-off events. [2023-11-17 11:24:33,838 INFO L125 PetriNetUnfolderBase]: For 33/33 co-relation queries the response was YES. [2023-11-17 11:24:33,838 INFO L83 FinitePrefix]: Finished finitePrefix Result has 117 conditions, 36 events. 6/36 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 58 event pairs, 1 based on Foata normal form. 1/37 useless extension candidates. Maximal degree in co-relation 105. Up to 14 conditions per place. [2023-11-17 11:24:33,838 INFO L140 encePairwiseOnDemand]: 41/48 looper letters, 12 selfloop transitions, 4 changer transitions 10/27 dead transitions. [2023-11-17 11:24:33,838 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 27 transitions, 158 flow [2023-11-17 11:24:33,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-17 11:24:33,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-17 11:24:33,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 127 transitions. [2023-11-17 11:24:33,841 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3307291666666667 [2023-11-17 11:24:33,841 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 127 transitions. [2023-11-17 11:24:33,841 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 127 transitions. [2023-11-17 11:24:33,842 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:24:33,842 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 127 transitions. [2023-11-17 11:24:33,842 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 15.875) internal successors, (127), 8 states have internal predecessors, (127), 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:24:33,843 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 48.0) internal successors, (432), 9 states have internal predecessors, (432), 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:24:33,843 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 48.0) internal successors, (432), 9 states have internal predecessors, (432), 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:24:33,843 INFO L175 Difference]: Start difference. First operand has 33 places, 17 transitions, 67 flow. Second operand 8 states and 127 transitions. [2023-11-17 11:24:33,843 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 27 transitions, 158 flow [2023-11-17 11:24:33,844 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 27 transitions, 140 flow, removed 6 selfloop flow, removed 5 redundant places. [2023-11-17 11:24:33,844 INFO L231 Difference]: Finished difference. Result has 36 places, 17 transitions, 70 flow [2023-11-17 11:24:33,845 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=70, PETRI_PLACES=36, PETRI_TRANSITIONS=17} [2023-11-17 11:24:33,845 INFO L281 CegarLoopForPetriNet]: 24 programPoint places, 12 predicate places. [2023-11-17 11:24:33,845 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 17 transitions, 70 flow [2023-11-17 11:24:33,845 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.0) internal successors, (105), 7 states have internal predecessors, (105), 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:24:33,846 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:24:33,846 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:24:33,846 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-17 11:24:33,846 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-17 11:24:33,846 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:24:33,846 INFO L85 PathProgramCache]: Analyzing trace with hash -1884672814, now seen corresponding path program 4 times [2023-11-17 11:24:33,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:24:33,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213530813] [2023-11-17 11:24:33,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:24:33,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:24:33,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-17 11:24:33,898 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-17 11:24:33,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-17 11:24:34,006 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-17 11:24:34,006 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-17 11:24:34,007 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2023-11-17 11:24:34,009 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2023-11-17 11:24:34,012 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2023-11-17 11:24:34,013 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2023-11-17 11:24:34,013 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2023-11-17 11:24:34,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-17 11:24:34,013 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1] [2023-11-17 11:24:34,019 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-17 11:24:34,019 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-17 11:24:34,062 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-17 11:24:34,064 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-17 11:24:34,082 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.11 11:24:34 BasicIcfg [2023-11-17 11:24:34,082 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-17 11:24:34,082 INFO L158 Benchmark]: Toolchain (without parser) took 7266.56ms. Allocated memory was 247.5MB in the beginning and 367.0MB in the end (delta: 119.5MB). Free memory was 196.4MB in the beginning and 318.3MB in the end (delta: -122.0MB). Peak memory consumption was 158.8MB. Max. memory is 8.0GB. [2023-11-17 11:24:34,083 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 205.5MB. Free memory was 157.4MB in the beginning and 157.4MB in the end (delta: 89.5kB). There was no memory consumed. Max. memory is 8.0GB. [2023-11-17 11:24:34,083 INFO L158 Benchmark]: CACSL2BoogieTranslator took 538.42ms. Allocated memory is still 247.5MB. Free memory was 196.1MB in the beginning and 172.6MB in the end (delta: 23.4MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. [2023-11-17 11:24:34,083 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.74ms. Allocated memory is still 247.5MB. Free memory was 172.5MB in the beginning and 169.9MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-11-17 11:24:34,084 INFO L158 Benchmark]: Boogie Preprocessor took 59.45ms. Allocated memory is still 247.5MB. Free memory was 169.9MB in the beginning and 168.0MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-11-17 11:24:34,084 INFO L158 Benchmark]: RCFGBuilder took 814.07ms. Allocated memory is still 247.5MB. Free memory was 167.8MB in the beginning and 173.1MB in the end (delta: -5.3MB). Peak memory consumption was 11.4MB. Max. memory is 8.0GB. [2023-11-17 11:24:34,084 INFO L158 Benchmark]: TraceAbstraction took 5787.91ms. Allocated memory was 247.5MB in the beginning and 367.0MB in the end (delta: 119.5MB). Free memory was 172.6MB in the beginning and 318.3MB in the end (delta: -145.7MB). Peak memory consumption was 134.7MB. Max. memory is 8.0GB. [2023-11-17 11:24:34,086 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 205.5MB. Free memory was 157.4MB in the beginning and 157.4MB in the end (delta: 89.5kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 538.42ms. Allocated memory is still 247.5MB. Free memory was 196.1MB in the beginning and 172.6MB in the end (delta: 23.4MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 55.74ms. Allocated memory is still 247.5MB. Free memory was 172.5MB in the beginning and 169.9MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 59.45ms. Allocated memory is still 247.5MB. Free memory was 169.9MB in the beginning and 168.0MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 814.07ms. Allocated memory is still 247.5MB. Free memory was 167.8MB in the beginning and 173.1MB in the end (delta: -5.3MB). Peak memory consumption was 11.4MB. Max. memory is 8.0GB. * TraceAbstraction took 5787.91ms. Allocated memory was 247.5MB in the beginning and 367.0MB in the end (delta: 119.5MB). Free memory was 172.6MB in the beginning and 318.3MB in the end (delta: -145.7MB). Peak memory consumption was 134.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - 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.2s, 35 PlacesBefore, 24 PlacesAfterwards, 29 TransitionsBefore, 17 TransitionsAfterwards, 428 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 15 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 1 ChoiceCompositions, 17 TotalNumberOfCompositions, 1011 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 493, independent: 426, independent conditional: 0, independent unconditional: 426, dependent: 67, dependent conditional: 0, dependent unconditional: 67, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 301, independent: 271, independent conditional: 0, independent unconditional: 271, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 301, independent: 269, independent conditional: 0, independent unconditional: 269, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 32, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 366, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 363, dependent conditional: 0, dependent unconditional: 363, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 493, independent: 155, independent conditional: 0, independent unconditional: 155, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 301, unknown conditional: 0, unknown unconditional: 301] , Statistics on independence cache: Total cache size (in pairs): 54, Positive cache size: 41, Positive conditional cache size: 0, Positive unconditional cache size: 41, Negative cache size: 13, Negative conditional cache size: 0, Negative unconditional cache size: 13, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L715] 0 int __unbuffered_p1_EBX = 0; [L716] 0 _Bool main$tmp_guard0; [L717] 0 _Bool main$tmp_guard1; [L719] 0 int x = 0; [L720] 0 _Bool x$flush_delayed; [L721] 0 int x$mem_tmp; [L722] 0 _Bool x$r_buff0_thd0; [L723] 0 _Bool x$r_buff0_thd1; [L724] 0 _Bool x$r_buff0_thd2; [L725] 0 _Bool x$r_buff1_thd0; [L726] 0 _Bool x$r_buff1_thd1; [L727] 0 _Bool x$r_buff1_thd2; [L728] 0 _Bool x$read_delayed; [L729] 0 int *x$read_delayed_var; [L730] 0 int x$w_buff0; [L731] 0 _Bool x$w_buff0_used; [L732] 0 int x$w_buff1; [L733] 0 _Bool x$w_buff1_used; [L735] 0 int y = 0; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L821] 0 pthread_t t311; [L822] FCALL, FORK 0 pthread_create(&t311, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t311={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L823] 0 pthread_t t312; [L824] FCALL, FORK 0 pthread_create(&t312, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t311={5:0}, t312={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L769] 2 x$w_buff1 = x$w_buff0 [L770] 2 x$w_buff0 = 1 [L771] 2 x$w_buff1_used = x$w_buff0_used [L772] 2 x$w_buff0_used = (_Bool)1 [L773] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L773] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L774] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L775] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L776] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L777] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L780] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L781] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L782] 2 x$flush_delayed = weak$$choice2 [L783] 2 x$mem_tmp = x [L784] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L785] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L786] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L787] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L788] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L789] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L790] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L791] 2 __unbuffered_p1_EAX = x [L792] 2 x = x$flush_delayed ? x$mem_tmp : x [L793] 2 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L796] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L741] 1 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L744] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L745] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L746] 1 x$flush_delayed = weak$$choice2 [L747] 1 x$mem_tmp = x [L748] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L749] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L750] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L751] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L752] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L753] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L754] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L755] 1 __unbuffered_p0_EAX = x [L756] 1 x = x$flush_delayed ? x$mem_tmp : x [L757] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L762] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L764] 1 return 0; [L799] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L800] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L801] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L802] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L803] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1] [L806] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L808] 2 return 0; [L826] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t311={5:0}, t312={3:0}, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1] [L828] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L828] RET 0 assume_abort_if_not(main$tmp_guard0) [L830] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L831] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L832] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L833] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L834] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t311={5:0}, t312={3:0}, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1] [L837] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) [L839] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1] - UnprovableResult [Line: 19]: 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: 822]: 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: 824]: 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 5 procedures, 49 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 5.6s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 1.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 110 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 110 mSDsluCounter, 5 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1 mSDsCounter, 13 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 329 IncrementalHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 13 mSolverCounterUnsat, 4 mSDtfsCounter, 329 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 30 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=92occurred in iteration=6, InterpolantAutomatonStates: 35, 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.6s InterpolantComputationTime, 102 NumberOfCodeBlocks, 102 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 79 ConstructedInterpolants, 0 QuantifiedInterpolants, 779 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:24:34,107 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...