/usr/bin/java -Xmx16000000000 -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-VariableLbe.epf --traceabstraction.order.of.the.error.locations.to.be.checked PROGRAM_FIRST -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/rfi008.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-24 11:46:12,328 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-24 11:46:12,372 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-VariableLbe.epf [2023-08-24 11:46:12,375 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-24 11:46:12,375 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-24 11:46:12,389 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-24 11:46:12,390 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-24 11:46:12,390 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-24 11:46:12,390 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-24 11:46:12,391 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-24 11:46:12,391 INFO L153 SettingsManager]: * Use SBE=true [2023-08-24 11:46:12,391 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-24 11:46:12,391 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-24 11:46:12,392 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-24 11:46:12,392 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-24 11:46:12,392 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-24 11:46:12,392 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-24 11:46:12,393 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-24 11:46:12,393 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-24 11:46:12,393 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-24 11:46:12,393 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-24 11:46:12,398 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-24 11:46:12,398 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-24 11:46:12,398 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-24 11:46:12,401 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-24 11:46:12,401 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-24 11:46:12,401 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-24 11:46:12,402 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-24 11:46:12,403 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-24 11:46:12,403 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-24 11:46:12,403 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-24 11:46:12,404 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-24 11:46:12,404 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-24 11:46:12,404 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-24 11:46:12,404 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-24 11:46:12,404 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC 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.traceabstraction: Order of the error locations to be checked -> PROGRAM_FIRST [2023-08-24 11:46:12,647 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-24 11:46:12,668 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-24 11:46:12,670 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-24 11:46:12,670 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-24 11:46:12,670 INFO L274 PluginConnector]: CDTParser initialized [2023-08-24 11:46:12,681 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi008.oepc.i [2023-08-24 11:46:13,709 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-24 11:46:13,929 INFO L384 CDTParser]: Found 1 translation units. [2023-08-24 11:46:13,930 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi008.oepc.i [2023-08-24 11:46:13,944 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6780f2fe1/c7fac34e505b407ebe9b659af517e5d8/FLAG8dbfea658 [2023-08-24 11:46:13,955 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6780f2fe1/c7fac34e505b407ebe9b659af517e5d8 [2023-08-24 11:46:13,958 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-24 11:46:13,959 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-24 11:46:13,962 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-24 11:46:13,963 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-24 11:46:13,964 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-24 11:46:13,965 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.08 11:46:13" (1/1) ... [2023-08-24 11:46:13,966 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76715d0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:46:13, skipping insertion in model container [2023-08-24 11:46:13,966 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.08 11:46:13" (1/1) ... [2023-08-24 11:46:14,007 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-24 11:46:14,125 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/rfi008.oepc.i[988,1001] [2023-08-24 11:46:14,264 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-24 11:46:14,270 INFO L201 MainTranslator]: Completed pre-run [2023-08-24 11:46:14,277 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/rfi008.oepc.i[988,1001] [2023-08-24 11:46:14,282 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [268] [2023-08-24 11:46:14,283 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [268] [2023-08-24 11:46:14,308 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-24 11:46:14,330 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-24 11:46:14,330 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-24 11:46:14,334 INFO L206 MainTranslator]: Completed translation [2023-08-24 11:46:14,334 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:46:14 WrapperNode [2023-08-24 11:46:14,334 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-24 11:46:14,335 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-24 11:46:14,335 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-24 11:46:14,335 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-24 11:46:14,339 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:46:14" (1/1) ... [2023-08-24 11:46:14,349 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:46:14" (1/1) ... [2023-08-24 11:46:14,377 INFO L138 Inliner]: procedures = 175, calls = 45, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 135 [2023-08-24 11:46:14,377 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-24 11:46:14,378 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-24 11:46:14,378 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-24 11:46:14,378 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-24 11:46:14,384 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:46:14" (1/1) ... [2023-08-24 11:46:14,384 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:46:14" (1/1) ... [2023-08-24 11:46:14,397 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:46:14" (1/1) ... [2023-08-24 11:46:14,397 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:46:14" (1/1) ... [2023-08-24 11:46:14,402 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:46:14" (1/1) ... [2023-08-24 11:46:14,404 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:46:14" (1/1) ... [2023-08-24 11:46:14,405 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:46:14" (1/1) ... [2023-08-24 11:46:14,406 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:46:14" (1/1) ... [2023-08-24 11:46:14,408 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-24 11:46:14,422 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-24 11:46:14,422 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-24 11:46:14,422 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-24 11:46:14,423 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:46:14" (1/1) ... [2023-08-24 11:46:14,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-24 11:46:14,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 11:46:14,486 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-08-24 11:46:14,505 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-08-24 11:46:14,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-24 11:46:14,515 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-24 11:46:14,515 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-24 11:46:14,515 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-24 11:46:14,515 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-24 11:46:14,516 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-24 11:46:14,516 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-24 11:46:14,516 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-24 11:46:14,516 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-24 11:46:14,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-24 11:46:14,516 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-24 11:46:14,516 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-24 11:46:14,517 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-24 11:46:14,518 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-24 11:46:14,639 INFO L236 CfgBuilder]: Building ICFG [2023-08-24 11:46:14,640 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-24 11:46:14,836 INFO L277 CfgBuilder]: Performing block encoding [2023-08-24 11:46:14,964 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-24 11:46:14,964 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-24 11:46:14,966 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.08 11:46:14 BoogieIcfgContainer [2023-08-24 11:46:14,966 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-24 11:46:14,968 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-24 11:46:14,968 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-24 11:46:14,970 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-24 11:46:14,970 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.08 11:46:13" (1/3) ... [2023-08-24 11:46:14,971 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49443deb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.08 11:46:14, skipping insertion in model container [2023-08-24 11:46:14,971 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:46:14" (2/3) ... [2023-08-24 11:46:14,972 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49443deb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.08 11:46:14, skipping insertion in model container [2023-08-24 11:46:14,972 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.08 11:46:14" (3/3) ... [2023-08-24 11:46:14,972 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi008.oepc.i [2023-08-24 11:46:14,983 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-24 11:46:14,984 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-24 11:46:14,984 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-24 11:46:15,022 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-24 11:46:15,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 97 places, 92 transitions, 194 flow [2023-08-24 11:46:15,089 INFO L124 PetriNetUnfolderBase]: 2/90 cut-off events. [2023-08-24 11:46:15,089 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 11:46:15,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97 conditions, 90 events. 2/90 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 46 event pairs, 0 based on Foata normal form. 0/86 useless extension candidates. Maximal degree in co-relation 53. Up to 2 conditions per place. [2023-08-24 11:46:15,093 INFO L82 GeneralOperation]: Start removeDead. Operand has 97 places, 92 transitions, 194 flow [2023-08-24 11:46:15,096 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 95 places, 90 transitions, 186 flow [2023-08-24 11:46:15,098 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-24 11:46:15,104 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 95 places, 90 transitions, 186 flow [2023-08-24 11:46:15,105 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 95 places, 90 transitions, 186 flow [2023-08-24 11:46:15,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 95 places, 90 transitions, 186 flow [2023-08-24 11:46:15,128 INFO L124 PetriNetUnfolderBase]: 2/90 cut-off events. [2023-08-24 11:46:15,129 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 11:46:15,129 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97 conditions, 90 events. 2/90 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 46 event pairs, 0 based on Foata normal form. 0/86 useless extension candidates. Maximal degree in co-relation 53. Up to 2 conditions per place. [2023-08-24 11:46:15,130 INFO L119 LiptonReduction]: Number of co-enabled transitions 1188 [2023-08-24 11:46:17,596 INFO L134 LiptonReduction]: Checked pairs total: 3678 [2023-08-24 11:46:17,597 INFO L136 LiptonReduction]: Total number of compositions: 81 [2023-08-24 11:46:17,608 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-24 11:46:17,623 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=LoopsAndPotentialCycles, 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;@5ec99dfc, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-24 11:46:17,624 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-08-24 11:46:17,626 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-24 11:46:17,626 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2023-08-24 11:46:17,627 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 11:46:17,627 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:46:17,627 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-24 11:46:17,641 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-24 11:46:17,646 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:46:17,646 INFO L85 PathProgramCache]: Analyzing trace with hash 445221, now seen corresponding path program 1 times [2023-08-24 11:46:17,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:46:17,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364087783] [2023-08-24 11:46:17,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:46:17,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:46:17,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:46:17,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 11:46:17,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:46:17,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364087783] [2023-08-24 11:46:17,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364087783] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:46:17,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:46:17,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-24 11:46:17,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907876818] [2023-08-24 11:46:17,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:46:17,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-24 11:46:17,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:46:17,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-24 11:46:17,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-24 11:46:17,919 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 173 [2023-08-24 11:46:17,920 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 21 transitions, 48 flow. Second operand has 3 states, 3 states have (on average 80.0) internal successors, (240), 3 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-08-24 11:46:17,920 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:46:17,921 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 173 [2023-08-24 11:46:17,921 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:46:18,086 INFO L124 PetriNetUnfolderBase]: 224/418 cut-off events. [2023-08-24 11:46:18,087 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-08-24 11:46:18,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 819 conditions, 418 events. 224/418 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1927 event pairs, 20 based on Foata normal form. 0/392 useless extension candidates. Maximal degree in co-relation 809. Up to 333 conditions per place. [2023-08-24 11:46:18,091 INFO L140 encePairwiseOnDemand]: 169/173 looper letters, 24 selfloop transitions, 2 changer transitions 2/30 dead transitions. [2023-08-24 11:46:18,091 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 30 transitions, 125 flow [2023-08-24 11:46:18,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-24 11:46:18,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-24 11:46:18,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 268 transitions. [2023-08-24 11:46:18,106 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5163776493256262 [2023-08-24 11:46:18,106 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 268 transitions. [2023-08-24 11:46:18,107 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 268 transitions. [2023-08-24 11:46:18,109 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:46:18,110 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 268 transitions. [2023-08-24 11:46:18,113 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 89.33333333333333) internal successors, (268), 3 states have internal predecessors, (268), 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-08-24 11:46:18,116 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 173.0) internal successors, (692), 4 states have internal predecessors, (692), 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-08-24 11:46:18,116 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 173.0) internal successors, (692), 4 states have internal predecessors, (692), 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-08-24 11:46:18,117 INFO L175 Difference]: Start difference. First operand has 27 places, 21 transitions, 48 flow. Second operand 3 states and 268 transitions. [2023-08-24 11:46:18,117 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 30 transitions, 125 flow [2023-08-24 11:46:18,119 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 30 transitions, 122 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-24 11:46:18,120 INFO L231 Difference]: Finished difference. Result has 26 places, 18 transitions, 44 flow [2023-08-24 11:46:18,121 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=173, PETRI_DIFFERENCE_MINUEND_FLOW=42, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=44, PETRI_PLACES=26, PETRI_TRANSITIONS=18} [2023-08-24 11:46:18,124 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, -1 predicate places. [2023-08-24 11:46:18,124 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 18 transitions, 44 flow [2023-08-24 11:46:18,125 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.0) internal successors, (240), 3 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-08-24 11:46:18,125 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:46:18,125 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:46:18,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-24 11:46:18,125 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-24 11:46:18,127 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:46:18,127 INFO L85 PathProgramCache]: Analyzing trace with hash 21222427, now seen corresponding path program 1 times [2023-08-24 11:46:18,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:46:18,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256974124] [2023-08-24 11:46:18,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:46:18,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:46:18,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:46:18,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 11:46:18,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:46:18,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256974124] [2023-08-24 11:46:18,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256974124] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:46:18,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:46:18,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-24 11:46:18,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839367422] [2023-08-24 11:46:18,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:46:18,334 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 11:46:18,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:46:18,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 11:46:18,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-24 11:46:18,335 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 173 [2023-08-24 11:46:18,335 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 18 transitions, 44 flow. Second operand has 4 states, 4 states have (on average 73.0) internal successors, (292), 4 states have internal predecessors, (292), 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-08-24 11:46:18,335 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:46:18,335 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 173 [2023-08-24 11:46:18,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:46:18,442 INFO L124 PetriNetUnfolderBase]: 287/508 cut-off events. [2023-08-24 11:46:18,442 INFO L125 PetriNetUnfolderBase]: For 33/33 co-relation queries the response was YES. [2023-08-24 11:46:18,443 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1068 conditions, 508 events. 287/508 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1970 event pairs, 139 based on Foata normal form. 36/544 useless extension candidates. Maximal degree in co-relation 1058. Up to 417 conditions per place. [2023-08-24 11:46:18,444 INFO L140 encePairwiseOnDemand]: 168/173 looper letters, 23 selfloop transitions, 3 changer transitions 15/41 dead transitions. [2023-08-24 11:46:18,444 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 41 transitions, 180 flow [2023-08-24 11:46:18,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 11:46:18,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 11:46:18,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 398 transitions. [2023-08-24 11:46:18,446 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4601156069364162 [2023-08-24 11:46:18,446 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 398 transitions. [2023-08-24 11:46:18,446 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 398 transitions. [2023-08-24 11:46:18,446 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:46:18,446 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 398 transitions. [2023-08-24 11:46:18,447 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 79.6) internal successors, (398), 5 states have internal predecessors, (398), 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-08-24 11:46:18,448 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 173.0) internal successors, (1038), 6 states have internal predecessors, (1038), 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-08-24 11:46:18,449 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 173.0) internal successors, (1038), 6 states have internal predecessors, (1038), 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-08-24 11:46:18,449 INFO L175 Difference]: Start difference. First operand has 26 places, 18 transitions, 44 flow. Second operand 5 states and 398 transitions. [2023-08-24 11:46:18,449 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 41 transitions, 180 flow [2023-08-24 11:46:18,449 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 41 transitions, 170 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-24 11:46:18,450 INFO L231 Difference]: Finished difference. Result has 30 places, 20 transitions, 67 flow [2023-08-24 11:46:18,450 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=173, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=67, PETRI_PLACES=30, PETRI_TRANSITIONS=20} [2023-08-24 11:46:18,450 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 3 predicate places. [2023-08-24 11:46:18,451 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 20 transitions, 67 flow [2023-08-24 11:46:18,451 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 73.0) internal successors, (292), 4 states have internal predecessors, (292), 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-08-24 11:46:18,451 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:46:18,451 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:46:18,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-24 11:46:18,451 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-24 11:46:18,452 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:46:18,452 INFO L85 PathProgramCache]: Analyzing trace with hash 79521106, now seen corresponding path program 1 times [2023-08-24 11:46:18,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:46:18,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140177876] [2023-08-24 11:46:18,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:46:18,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:46:18,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:46:18,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 11:46:18,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:46:18,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140177876] [2023-08-24 11:46:18,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140177876] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:46:18,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:46:18,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 11:46:18,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38351808] [2023-08-24 11:46:18,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:46:18,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 11:46:18,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:46:18,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 11:46:18,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-24 11:46:18,564 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 173 [2023-08-24 11:46:18,564 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 20 transitions, 67 flow. Second operand has 5 states, 5 states have (on average 73.0) internal successors, (365), 5 states have internal predecessors, (365), 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-08-24 11:46:18,564 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:46:18,564 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 173 [2023-08-24 11:46:18,564 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:46:18,663 INFO L124 PetriNetUnfolderBase]: 253/446 cut-off events. [2023-08-24 11:46:18,663 INFO L125 PetriNetUnfolderBase]: For 191/191 co-relation queries the response was YES. [2023-08-24 11:46:18,664 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1093 conditions, 446 events. 253/446 cut-off events. For 191/191 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1620 event pairs, 83 based on Foata normal form. 24/470 useless extension candidates. Maximal degree in co-relation 1080. Up to 305 conditions per place. [2023-08-24 11:46:18,665 INFO L140 encePairwiseOnDemand]: 169/173 looper letters, 23 selfloop transitions, 3 changer transitions 12/38 dead transitions. [2023-08-24 11:46:18,665 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 38 transitions, 185 flow [2023-08-24 11:46:18,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 11:46:18,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 11:46:18,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 394 transitions. [2023-08-24 11:46:18,667 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4554913294797688 [2023-08-24 11:46:18,667 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 394 transitions. [2023-08-24 11:46:18,667 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 394 transitions. [2023-08-24 11:46:18,667 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:46:18,667 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 394 transitions. [2023-08-24 11:46:18,668 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 78.8) internal successors, (394), 5 states have internal predecessors, (394), 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-08-24 11:46:18,669 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 173.0) internal successors, (1038), 6 states have internal predecessors, (1038), 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-08-24 11:46:18,669 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 173.0) internal successors, (1038), 6 states have internal predecessors, (1038), 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-08-24 11:46:18,669 INFO L175 Difference]: Start difference. First operand has 30 places, 20 transitions, 67 flow. Second operand 5 states and 394 transitions. [2023-08-24 11:46:18,669 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 38 transitions, 185 flow [2023-08-24 11:46:18,671 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 38 transitions, 176 flow, removed 3 selfloop flow, removed 2 redundant places. [2023-08-24 11:46:18,671 INFO L231 Difference]: Finished difference. Result has 33 places, 20 transitions, 75 flow [2023-08-24 11:46:18,671 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=173, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=75, PETRI_PLACES=33, PETRI_TRANSITIONS=20} [2023-08-24 11:46:18,672 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 6 predicate places. [2023-08-24 11:46:18,672 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 20 transitions, 75 flow [2023-08-24 11:46:18,672 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 73.0) internal successors, (365), 5 states have internal predecessors, (365), 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-08-24 11:46:18,672 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:46:18,672 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:46:18,673 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-24 11:46:18,673 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-24 11:46:18,673 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:46:18,673 INFO L85 PathProgramCache]: Analyzing trace with hash 2030473584, now seen corresponding path program 1 times [2023-08-24 11:46:18,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:46:18,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180795278] [2023-08-24 11:46:18,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:46:18,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:46:18,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:46:18,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 11:46:18,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:46:18,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180795278] [2023-08-24 11:46:18,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180795278] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:46:18,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:46:18,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-24 11:46:18,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114106952] [2023-08-24 11:46:18,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:46:18,735 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 11:46:18,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:46:18,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 11:46:18,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-24 11:46:18,736 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 173 [2023-08-24 11:46:18,736 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 20 transitions, 75 flow. Second operand has 4 states, 4 states have (on average 78.25) internal successors, (313), 4 states have internal predecessors, (313), 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-08-24 11:46:18,736 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:46:18,736 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 173 [2023-08-24 11:46:18,736 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:46:18,814 INFO L124 PetriNetUnfolderBase]: 160/307 cut-off events. [2023-08-24 11:46:18,814 INFO L125 PetriNetUnfolderBase]: For 231/233 co-relation queries the response was YES. [2023-08-24 11:46:18,815 INFO L83 FinitePrefix]: Finished finitePrefix Result has 750 conditions, 307 events. 160/307 cut-off events. For 231/233 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1172 event pairs, 84 based on Foata normal form. 20/324 useless extension candidates. Maximal degree in co-relation 734. Up to 185 conditions per place. [2023-08-24 11:46:18,816 INFO L140 encePairwiseOnDemand]: 169/173 looper letters, 22 selfloop transitions, 3 changer transitions 11/39 dead transitions. [2023-08-24 11:46:18,816 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 39 transitions, 195 flow [2023-08-24 11:46:18,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 11:46:18,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 11:46:18,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 417 transitions. [2023-08-24 11:46:18,817 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4820809248554913 [2023-08-24 11:46:18,817 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 417 transitions. [2023-08-24 11:46:18,817 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 417 transitions. [2023-08-24 11:46:18,817 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:46:18,817 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 417 transitions. [2023-08-24 11:46:18,818 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 83.4) internal successors, (417), 5 states have internal predecessors, (417), 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-08-24 11:46:18,819 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 173.0) internal successors, (1038), 6 states have internal predecessors, (1038), 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-08-24 11:46:18,820 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 173.0) internal successors, (1038), 6 states have internal predecessors, (1038), 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-08-24 11:46:18,820 INFO L175 Difference]: Start difference. First operand has 33 places, 20 transitions, 75 flow. Second operand 5 states and 417 transitions. [2023-08-24 11:46:18,820 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 39 transitions, 195 flow [2023-08-24 11:46:18,821 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 39 transitions, 181 flow, removed 4 selfloop flow, removed 4 redundant places. [2023-08-24 11:46:18,821 INFO L231 Difference]: Finished difference. Result has 34 places, 20 transitions, 78 flow [2023-08-24 11:46:18,821 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=173, PETRI_DIFFERENCE_MINUEND_FLOW=63, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=78, PETRI_PLACES=34, PETRI_TRANSITIONS=20} [2023-08-24 11:46:18,822 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 7 predicate places. [2023-08-24 11:46:18,822 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 20 transitions, 78 flow [2023-08-24 11:46:18,822 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 78.25) internal successors, (313), 4 states have internal predecessors, (313), 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-08-24 11:46:18,822 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:46:18,822 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:46:18,822 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-24 11:46:18,822 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-24 11:46:18,823 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:46:18,823 INFO L85 PathProgramCache]: Analyzing trace with hash 1633195207, now seen corresponding path program 1 times [2023-08-24 11:46:18,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:46:18,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505563249] [2023-08-24 11:46:18,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:46:18,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:46:18,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:46:18,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 11:46:18,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:46:18,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505563249] [2023-08-24 11:46:18,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505563249] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:46:18,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:46:18,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 11:46:18,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695271598] [2023-08-24 11:46:18,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:46:18,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 11:46:18,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:46:18,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 11:46:18,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-24 11:46:18,983 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 173 [2023-08-24 11:46:18,984 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 20 transitions, 78 flow. Second operand has 4 states, 4 states have (on average 76.75) internal successors, (307), 4 states have internal predecessors, (307), 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-08-24 11:46:18,984 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:46:18,984 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 173 [2023-08-24 11:46:18,984 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:46:19,076 INFO L124 PetriNetUnfolderBase]: 85/186 cut-off events. [2023-08-24 11:46:19,076 INFO L125 PetriNetUnfolderBase]: For 88/89 co-relation queries the response was YES. [2023-08-24 11:46:19,076 INFO L83 FinitePrefix]: Finished finitePrefix Result has 480 conditions, 186 events. 85/186 cut-off events. For 88/89 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 650 event pairs, 17 based on Foata normal form. 28/213 useless extension candidates. Maximal degree in co-relation 463. Up to 77 conditions per place. [2023-08-24 11:46:19,077 INFO L140 encePairwiseOnDemand]: 168/173 looper letters, 24 selfloop transitions, 3 changer transitions 18/48 dead transitions. [2023-08-24 11:46:19,077 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 48 transitions, 246 flow [2023-08-24 11:46:19,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 11:46:19,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 11:46:19,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 415 transitions. [2023-08-24 11:46:19,079 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4797687861271676 [2023-08-24 11:46:19,079 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 415 transitions. [2023-08-24 11:46:19,079 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 415 transitions. [2023-08-24 11:46:19,079 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:46:19,079 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 415 transitions. [2023-08-24 11:46:19,080 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 83.0) internal successors, (415), 5 states have internal predecessors, (415), 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-08-24 11:46:19,082 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 173.0) internal successors, (1038), 6 states have internal predecessors, (1038), 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-08-24 11:46:19,082 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 173.0) internal successors, (1038), 6 states have internal predecessors, (1038), 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-08-24 11:46:19,082 INFO L175 Difference]: Start difference. First operand has 34 places, 20 transitions, 78 flow. Second operand 5 states and 415 transitions. [2023-08-24 11:46:19,083 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 48 transitions, 246 flow [2023-08-24 11:46:19,085 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 48 transitions, 226 flow, removed 3 selfloop flow, removed 5 redundant places. [2023-08-24 11:46:19,085 INFO L231 Difference]: Finished difference. Result has 34 places, 22 transitions, 93 flow [2023-08-24 11:46:19,085 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=173, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=93, PETRI_PLACES=34, PETRI_TRANSITIONS=22} [2023-08-24 11:46:19,087 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 7 predicate places. [2023-08-24 11:46:19,087 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 22 transitions, 93 flow [2023-08-24 11:46:19,088 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 76.75) internal successors, (307), 4 states have internal predecessors, (307), 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-08-24 11:46:19,088 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:46:19,088 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:46:19,088 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-24 11:46:19,088 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-24 11:46:19,088 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:46:19,088 INFO L85 PathProgramCache]: Analyzing trace with hash 1526004677, now seen corresponding path program 1 times [2023-08-24 11:46:19,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:46:19,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638079474] [2023-08-24 11:46:19,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:46:19,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:46:19,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:46:19,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 11:46:19,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:46:19,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638079474] [2023-08-24 11:46:19,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638079474] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:46:19,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:46:19,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-24 11:46:19,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352561582] [2023-08-24 11:46:19,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:46:19,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 11:46:19,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:46:19,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 11:46:19,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-24 11:46:19,258 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 173 [2023-08-24 11:46:19,259 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 22 transitions, 93 flow. Second operand has 5 states, 5 states have (on average 76.6) internal successors, (383), 5 states have internal predecessors, (383), 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-08-24 11:46:19,259 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:46:19,259 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 173 [2023-08-24 11:46:19,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:46:19,345 INFO L124 PetriNetUnfolderBase]: 32/87 cut-off events. [2023-08-24 11:46:19,345 INFO L125 PetriNetUnfolderBase]: For 29/29 co-relation queries the response was YES. [2023-08-24 11:46:19,345 INFO L83 FinitePrefix]: Finished finitePrefix Result has 259 conditions, 87 events. 32/87 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 233 event pairs, 13 based on Foata normal form. 9/95 useless extension candidates. Maximal degree in co-relation 242. Up to 41 conditions per place. [2023-08-24 11:46:19,345 INFO L140 encePairwiseOnDemand]: 168/173 looper letters, 22 selfloop transitions, 5 changer transitions 9/39 dead transitions. [2023-08-24 11:46:19,346 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 39 transitions, 217 flow [2023-08-24 11:46:19,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-24 11:46:19,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-24 11:46:19,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 481 transitions. [2023-08-24 11:46:19,349 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4633911368015414 [2023-08-24 11:46:19,349 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 481 transitions. [2023-08-24 11:46:19,349 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 481 transitions. [2023-08-24 11:46:19,349 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:46:19,349 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 481 transitions. [2023-08-24 11:46:19,350 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 80.16666666666667) internal successors, (481), 6 states have internal predecessors, (481), 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-08-24 11:46:19,352 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 173.0) internal successors, (1211), 7 states have internal predecessors, (1211), 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-08-24 11:46:19,353 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 173.0) internal successors, (1211), 7 states have internal predecessors, (1211), 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-08-24 11:46:19,353 INFO L175 Difference]: Start difference. First operand has 34 places, 22 transitions, 93 flow. Second operand 6 states and 481 transitions. [2023-08-24 11:46:19,354 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 39 transitions, 217 flow [2023-08-24 11:46:19,355 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 39 transitions, 190 flow, removed 8 selfloop flow, removed 4 redundant places. [2023-08-24 11:46:19,356 INFO L231 Difference]: Finished difference. Result has 36 places, 22 transitions, 92 flow [2023-08-24 11:46:19,356 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=173, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=92, PETRI_PLACES=36, PETRI_TRANSITIONS=22} [2023-08-24 11:46:19,358 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 9 predicate places. [2023-08-24 11:46:19,358 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 22 transitions, 92 flow [2023-08-24 11:46:19,358 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 76.6) internal successors, (383), 5 states have internal predecessors, (383), 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-08-24 11:46:19,358 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:46:19,358 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:46:19,358 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-24 11:46:19,358 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-24 11:46:19,359 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:46:19,359 INFO L85 PathProgramCache]: Analyzing trace with hash 1506654891, now seen corresponding path program 1 times [2023-08-24 11:46:19,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:46:19,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329773849] [2023-08-24 11:46:19,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:46:19,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:46:19,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:46:20,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 11:46:20,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:46:20,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329773849] [2023-08-24 11:46:20,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329773849] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:46:20,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:46:20,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-24 11:46:20,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522044482] [2023-08-24 11:46:20,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:46:20,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-24 11:46:20,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:46:20,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-24 11:46:20,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-08-24 11:46:20,295 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 173 [2023-08-24 11:46:20,296 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 22 transitions, 92 flow. Second operand has 8 states, 8 states have (on average 70.0) internal successors, (560), 8 states have internal predecessors, (560), 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-08-24 11:46:20,296 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:46:20,296 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 173 [2023-08-24 11:46:20,296 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:46:20,498 INFO L124 PetriNetUnfolderBase]: 26/81 cut-off events. [2023-08-24 11:46:20,498 INFO L125 PetriNetUnfolderBase]: For 60/61 co-relation queries the response was YES. [2023-08-24 11:46:20,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 238 conditions, 81 events. 26/81 cut-off events. For 60/61 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 211 event pairs, 0 based on Foata normal form. 2/83 useless extension candidates. Maximal degree in co-relation 220. Up to 25 conditions per place. [2023-08-24 11:46:20,499 INFO L140 encePairwiseOnDemand]: 165/173 looper letters, 27 selfloop transitions, 6 changer transitions 12/48 dead transitions. [2023-08-24 11:46:20,499 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 48 transitions, 285 flow [2023-08-24 11:46:20,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-24 11:46:20,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-24 11:46:20,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 653 transitions. [2023-08-24 11:46:20,501 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4193962748876044 [2023-08-24 11:46:20,501 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 653 transitions. [2023-08-24 11:46:20,501 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 653 transitions. [2023-08-24 11:46:20,502 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:46:20,502 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 653 transitions. [2023-08-24 11:46:20,503 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 72.55555555555556) internal successors, (653), 9 states have internal predecessors, (653), 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-08-24 11:46:20,504 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 173.0) internal successors, (1730), 10 states have internal predecessors, (1730), 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-08-24 11:46:20,505 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 173.0) internal successors, (1730), 10 states have internal predecessors, (1730), 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-08-24 11:46:20,505 INFO L175 Difference]: Start difference. First operand has 36 places, 22 transitions, 92 flow. Second operand 9 states and 653 transitions. [2023-08-24 11:46:20,505 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 48 transitions, 285 flow [2023-08-24 11:46:20,506 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 48 transitions, 252 flow, removed 10 selfloop flow, removed 5 redundant places. [2023-08-24 11:46:20,507 INFO L231 Difference]: Finished difference. Result has 40 places, 22 transitions, 96 flow [2023-08-24 11:46:20,507 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=173, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=96, PETRI_PLACES=40, PETRI_TRANSITIONS=22} [2023-08-24 11:46:20,508 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 13 predicate places. [2023-08-24 11:46:20,508 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 22 transitions, 96 flow [2023-08-24 11:46:20,512 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 70.0) internal successors, (560), 8 states have internal predecessors, (560), 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-08-24 11:46:20,512 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:46:20,512 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:46:20,512 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-24 11:46:20,512 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-24 11:46:20,513 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:46:20,513 INFO L85 PathProgramCache]: Analyzing trace with hash -556602077, now seen corresponding path program 2 times [2023-08-24 11:46:20,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:46:20,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900171411] [2023-08-24 11:46:20,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:46:20,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:46:20,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:46:20,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 11:46:20,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:46:20,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900171411] [2023-08-24 11:46:20,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900171411] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:46:20,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:46:20,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-24 11:46:20,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808997164] [2023-08-24 11:46:20,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:46:20,776 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-24 11:46:20,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:46:20,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-24 11:46:20,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-24 11:46:20,777 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 173 [2023-08-24 11:46:20,778 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 22 transitions, 96 flow. Second operand has 6 states, 6 states have (on average 72.0) internal successors, (432), 6 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-08-24 11:46:20,778 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:46:20,778 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 173 [2023-08-24 11:46:20,778 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:46:20,889 INFO L124 PetriNetUnfolderBase]: 38/109 cut-off events. [2023-08-24 11:46:20,889 INFO L125 PetriNetUnfolderBase]: For 81/81 co-relation queries the response was YES. [2023-08-24 11:46:20,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 346 conditions, 109 events. 38/109 cut-off events. For 81/81 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 314 event pairs, 5 based on Foata normal form. 1/110 useless extension candidates. Maximal degree in co-relation 334. Up to 49 conditions per place. [2023-08-24 11:46:20,890 INFO L140 encePairwiseOnDemand]: 166/173 looper letters, 19 selfloop transitions, 3 changer transitions 20/42 dead transitions. [2023-08-24 11:46:20,890 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 42 transitions, 265 flow [2023-08-24 11:46:20,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-24 11:46:20,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-24 11:46:20,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 522 transitions. [2023-08-24 11:46:20,892 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4310487200660611 [2023-08-24 11:46:20,892 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 522 transitions. [2023-08-24 11:46:20,892 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 522 transitions. [2023-08-24 11:46:20,892 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:46:20,892 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 522 transitions. [2023-08-24 11:46:20,893 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 74.57142857142857) internal successors, (522), 7 states have internal predecessors, (522), 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-08-24 11:46:20,894 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 173.0) internal successors, (1384), 8 states have internal predecessors, (1384), 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-08-24 11:46:20,895 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 173.0) internal successors, (1384), 8 states have internal predecessors, (1384), 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-08-24 11:46:20,895 INFO L175 Difference]: Start difference. First operand has 40 places, 22 transitions, 96 flow. Second operand 7 states and 522 transitions. [2023-08-24 11:46:20,895 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 42 transitions, 265 flow [2023-08-24 11:46:20,896 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 42 transitions, 235 flow, removed 3 selfloop flow, removed 7 redundant places. [2023-08-24 11:46:20,897 INFO L231 Difference]: Finished difference. Result has 39 places, 20 transitions, 85 flow [2023-08-24 11:46:20,897 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=173, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=85, PETRI_PLACES=39, PETRI_TRANSITIONS=20} [2023-08-24 11:46:20,898 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 12 predicate places. [2023-08-24 11:46:20,898 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 20 transitions, 85 flow [2023-08-24 11:46:20,898 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 72.0) internal successors, (432), 6 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-08-24 11:46:20,899 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:46:20,899 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:46:20,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-24 11:46:20,899 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-24 11:46:20,899 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:46:20,899 INFO L85 PathProgramCache]: Analyzing trace with hash 1519174015, now seen corresponding path program 3 times [2023-08-24 11:46:20,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:46:20,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260251288] [2023-08-24 11:46:20,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:46:20,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:46:20,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-24 11:46:20,959 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-24 11:46:21,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-24 11:46:21,035 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-24 11:46:21,035 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-24 11:46:21,036 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2023-08-24 11:46:21,037 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2023-08-24 11:46:21,039 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2023-08-24 11:46:21,040 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2023-08-24 11:46:21,042 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2023-08-24 11:46:21,042 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-24 11:46:21,042 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1] [2023-08-24 11:46:21,046 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-24 11:46:21,046 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-24 11:46:21,096 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.08 11:46:21 BasicIcfg [2023-08-24 11:46:21,097 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-24 11:46:21,097 INFO L158 Benchmark]: Toolchain (without parser) took 7138.02ms. Allocated memory was 390.1MB in the beginning and 652.2MB in the end (delta: 262.1MB). Free memory was 364.4MB in the beginning and 495.5MB in the end (delta: -131.1MB). Peak memory consumption was 132.9MB. Max. memory is 16.0GB. [2023-08-24 11:46:21,097 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 390.1MB. Free memory was 368.0MB in the beginning and 367.9MB in the end (delta: 157.4kB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-24 11:46:21,098 INFO L158 Benchmark]: CACSL2BoogieTranslator took 372.15ms. Allocated memory is still 390.1MB. Free memory was 364.4MB in the beginning and 340.4MB in the end (delta: 24.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-24 11:46:21,098 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.26ms. Allocated memory is still 390.1MB. Free memory was 340.4MB in the beginning and 338.0MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-24 11:46:21,098 INFO L158 Benchmark]: Boogie Preprocessor took 43.68ms. Allocated memory is still 390.1MB. Free memory was 338.0MB in the beginning and 336.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-24 11:46:21,098 INFO L158 Benchmark]: RCFGBuilder took 544.40ms. Allocated memory is still 390.1MB. Free memory was 336.3MB in the beginning and 296.5MB in the end (delta: 39.8MB). Peak memory consumption was 39.8MB. Max. memory is 16.0GB. [2023-08-24 11:46:21,098 INFO L158 Benchmark]: TraceAbstraction took 6128.40ms. Allocated memory was 390.1MB in the beginning and 652.2MB in the end (delta: 262.1MB). Free memory was 296.0MB in the beginning and 495.5MB in the end (delta: -199.5MB). Peak memory consumption was 65.8MB. Max. memory is 16.0GB. [2023-08-24 11:46:21,100 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.13ms. Allocated memory is still 390.1MB. Free memory was 368.0MB in the beginning and 367.9MB in the end (delta: 157.4kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 372.15ms. Allocated memory is still 390.1MB. Free memory was 364.4MB in the beginning and 340.4MB in the end (delta: 24.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 42.26ms. Allocated memory is still 390.1MB. Free memory was 340.4MB in the beginning and 338.0MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 43.68ms. Allocated memory is still 390.1MB. Free memory was 338.0MB in the beginning and 336.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 544.40ms. Allocated memory is still 390.1MB. Free memory was 336.3MB in the beginning and 296.5MB in the end (delta: 39.8MB). Peak memory consumption was 39.8MB. Max. memory is 16.0GB. * TraceAbstraction took 6128.40ms. Allocated memory was 390.1MB in the beginning and 652.2MB in the end (delta: 262.1MB). Free memory was 296.0MB in the beginning and 495.5MB in the end (delta: -199.5MB). Peak memory consumption was 65.8MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 268]: Unsoundness Warning unspecified type, defaulting to int C: short [268] - GenericResultAtLocation [Line: 268]: Unsoundness Warning unspecified type, defaulting to int C: short [268] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.5s, 95 PlacesBefore, 27 PlacesAfterwards, 90 TransitionsBefore, 21 TransitionsAfterwards, 1188 CoEnabledTransitionPairs, 7 FixpointIterations, 37 TrivialSequentialCompositions, 34 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 81 TotalNumberOfCompositions, 3678 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1366, independent: 1201, independent conditional: 0, independent unconditional: 1201, dependent: 165, dependent conditional: 0, dependent unconditional: 165, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 662, independent: 630, independent conditional: 0, independent unconditional: 630, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1366, independent: 571, independent conditional: 0, independent unconditional: 571, dependent: 133, dependent conditional: 0, dependent unconditional: 133, unknown: 662, unknown conditional: 0, unknown unconditional: 662] , Statistics on independence cache: Total cache size (in pairs): 70, Positive cache size: 54, Positive conditional cache size: 0, Positive unconditional cache size: 54, Negative cache size: 16, Negative conditional cache size: 0, Negative unconditional cache size: 16, 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_p0_EBX = 0; [L715] 0 int __unbuffered_p1_EAX = 0; [L717] 0 int __unbuffered_p1_EBX = 0; [L718] 0 _Bool main$tmp_guard0; [L719] 0 _Bool main$tmp_guard1; [L721] 0 int x = 0; [L722] 0 _Bool x$flush_delayed; [L723] 0 int x$mem_tmp; [L724] 0 _Bool x$r_buff0_thd0; [L725] 0 _Bool x$r_buff0_thd1; [L726] 0 _Bool x$r_buff0_thd2; [L727] 0 _Bool x$r_buff1_thd0; [L728] 0 _Bool x$r_buff1_thd1; [L729] 0 _Bool x$r_buff1_thd2; [L730] 0 _Bool x$read_delayed; [L731] 0 int *x$read_delayed_var; [L732] 0 int x$w_buff0; [L733] 0 _Bool x$w_buff0_used; [L734] 0 int x$w_buff1; [L735] 0 _Bool x$w_buff1_used; [L737] 0 int y = 0; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L831] 0 pthread_t t1721; [L832] FCALL, FORK 0 pthread_create(&t1721, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1721, ((void *)0), P0, ((void *)0))=-1, t1721={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] [L743] 1 x$w_buff1 = x$w_buff0 [L744] 1 x$w_buff0 = 1 [L745] 1 x$w_buff1_used = x$w_buff0_used [L746] 1 x$w_buff0_used = (_Bool)1 [L747] CALL 1 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 1 !(!expression) [L747] RET 1 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L748] 1 x$r_buff1_thd0 = x$r_buff0_thd0 [L749] 1 x$r_buff1_thd1 = x$r_buff0_thd1 [L750] 1 x$r_buff1_thd2 = x$r_buff0_thd2 [L751] 1 x$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L833] 0 pthread_t t1722; [L834] FCALL, FORK 0 pthread_create(&t1722, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1722, ((void *)0), P1, ((void *)0))=0, t1721={5:0}, t1722={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=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L754] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L755] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L756] 1 x$flush_delayed = weak$$choice2 [L757] 1 x$mem_tmp = x [L758] 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) [L759] 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)) [L760] 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)) [L761] 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)) [L762] 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)) [L763] 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)) [L764] 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)) [L765] 1 __unbuffered_p0_EAX = x [L766] 1 x = x$flush_delayed ? x$mem_tmp : x [L767] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L770] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L787] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __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=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L790] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L793] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L794] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L795] 2 x$flush_delayed = weak$$choice2 [L796] 2 x$mem_tmp = x [L797] 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) [L798] 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)) [L799] 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)) [L800] 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)) [L801] 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)) [L802] 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)) [L803] 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)) [L804] 2 __unbuffered_p1_EBX = x [L805] 2 x = x$flush_delayed ? x$mem_tmp : x [L806] 2 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L809] 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) [L810] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L811] 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 [L812] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L813] 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 [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L773] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L774] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L775] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L776] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L777] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1] [L816] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L818] 2 return 0; [L780] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L782] 1 return 0; [L836] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L838] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L838] RET 0 assume_abort_if_not(main$tmp_guard0) [L840] 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) [L841] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L842] 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 [L843] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L844] 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=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1721={5:0}, t1722={3:0}, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1] [L847] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) [L849] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, expression=0, expression=1, 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=1, 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=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 call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 834]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 832]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 112 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: 6.0s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 142 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 142 mSDsluCounter, 16 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7 mSDsCounter, 15 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 648 IncrementalHoareTripleChecker+Invalid, 663 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 15 mSolverCounterUnsat, 9 mSDtfsCounter, 648 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=96occurred in iteration=7, InterpolantAutomatonStates: 45, 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, 1.8s InterpolantComputationTime, 112 NumberOfCodeBlocks, 112 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 86 ConstructedInterpolants, 0 QuantifiedInterpolants, 610 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-08-24 11:46:21,138 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...