/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.dk.datarace-free-lbe-02cf818-m [2023-11-17 15:13:42,482 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-17 15:13:42,764 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf [2023-11-17 15:13:42,795 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-17 15:13:42,796 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-17 15:13:42,797 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-17 15:13:42,797 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-17 15:13:42,798 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-17 15:13:42,798 INFO L153 SettingsManager]: * Use SBE=true [2023-11-17 15:13:42,802 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-17 15:13:42,803 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-17 15:13:42,803 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-17 15:13:42,803 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-17 15:13:42,804 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-17 15:13:42,804 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-17 15:13:42,805 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-17 15:13:42,805 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-17 15:13:42,805 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-17 15:13:42,805 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-17 15:13:42,805 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-17 15:13:42,806 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-17 15:13:42,806 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-17 15:13:42,807 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-17 15:13:42,807 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-17 15:13:42,807 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-17 15:13:42,807 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 15:13:42,808 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-17 15:13:42,808 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-17 15:13:42,808 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-17 15:13:42,808 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-17 15:13:42,809 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-17 15:13:42,809 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-17 15:13:42,810 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2023-11-17 15:13:43,058 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-17 15:13:43,086 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-17 15:13:43,088 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-17 15:13:43,089 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-17 15:13:43,089 INFO L274 PluginConnector]: CDTParser initialized [2023-11-17 15:13:43,091 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-11-17 15:13:44,253 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-17 15:13:44,478 INFO L384 CDTParser]: Found 1 translation units. [2023-11-17 15:13:44,478 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-11-17 15:13:44,502 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be2a3bc91/01f3f84ff8ee4b17b07ab7d67f53bed3/FLAG7eb0356c3 [2023-11-17 15:13:44,513 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be2a3bc91/01f3f84ff8ee4b17b07ab7d67f53bed3 [2023-11-17 15:13:44,515 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-17 15:13:44,516 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-17 15:13:44,517 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-17 15:13:44,517 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-17 15:13:44,521 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-17 15:13:44,521 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 03:13:44" (1/1) ... [2023-11-17 15:13:44,522 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e09cd63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:13:44, skipping insertion in model container [2023-11-17 15:13:44,522 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 03:13:44" (1/1) ... [2023-11-17 15:13:44,568 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-17 15:13:44,704 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/mix022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[995,1008] [2023-11-17 15:13:44,906 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 15:13:44,925 INFO L202 MainTranslator]: Completed pre-run [2023-11-17 15:13:44,936 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/mix022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[995,1008] [2023-11-17 15:13:44,985 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 15:13:45,018 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-17 15:13:45,019 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-17 15:13:45,025 INFO L206 MainTranslator]: Completed translation [2023-11-17 15:13:45,026 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:13:45 WrapperNode [2023-11-17 15:13:45,026 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-17 15:13:45,027 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-17 15:13:45,027 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-17 15:13:45,027 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-17 15:13:45,033 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:13:45" (1/1) ... [2023-11-17 15:13:45,047 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:13:45" (1/1) ... [2023-11-17 15:13:45,067 INFO L138 Inliner]: procedures = 175, calls = 43, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 112 [2023-11-17 15:13:45,067 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-17 15:13:45,068 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-17 15:13:45,068 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-17 15:13:45,068 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-17 15:13:45,076 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:13:45" (1/1) ... [2023-11-17 15:13:45,076 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:13:45" (1/1) ... [2023-11-17 15:13:45,080 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:13:45" (1/1) ... [2023-11-17 15:13:45,080 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:13:45" (1/1) ... [2023-11-17 15:13:45,087 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:13:45" (1/1) ... [2023-11-17 15:13:45,088 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:13:45" (1/1) ... [2023-11-17 15:13:45,090 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:13:45" (1/1) ... [2023-11-17 15:13:45,091 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:13:45" (1/1) ... [2023-11-17 15:13:45,103 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-17 15:13:45,104 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-17 15:13:45,104 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-17 15:13:45,104 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-17 15:13:45,105 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:13:45" (1/1) ... [2023-11-17 15:13:45,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 15:13:45,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 15:13:45,150 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-17 15:13:45,169 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-17 15:13:45,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-17 15:13:45,185 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-17 15:13:45,185 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-17 15:13:45,185 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-17 15:13:45,186 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-17 15:13:45,186 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-17 15:13:45,187 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-17 15:13:45,187 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-17 15:13:45,187 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-17 15:13:45,187 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-17 15:13:45,187 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-17 15:13:45,187 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-17 15:13:45,187 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-17 15:13:45,188 WARN L211 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-17 15:13:45,344 INFO L239 CfgBuilder]: Building ICFG [2023-11-17 15:13:45,347 INFO L265 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-17 15:13:45,680 INFO L280 CfgBuilder]: Performing block encoding [2023-11-17 15:13:45,832 INFO L302 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-17 15:13:45,833 INFO L307 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-17 15:13:45,834 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 03:13:45 BoogieIcfgContainer [2023-11-17 15:13:45,834 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-17 15:13:45,836 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-17 15:13:45,836 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-17 15:13:45,839 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-17 15:13:45,839 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 03:13:44" (1/3) ... [2023-11-17 15:13:45,840 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3be2dcd4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 03:13:45, skipping insertion in model container [2023-11-17 15:13:45,840 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:13:45" (2/3) ... [2023-11-17 15:13:45,841 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3be2dcd4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 03:13:45, skipping insertion in model container [2023-11-17 15:13:45,841 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 03:13:45" (3/3) ... [2023-11-17 15:13:45,842 INFO L112 eAbstractionObserver]: Analyzing ICFG mix022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-11-17 15:13:45,857 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-17 15:13:45,857 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-17 15:13:45,857 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-17 15:13:45,913 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-17 15:13:45,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 97 places, 93 transitions, 194 flow [2023-11-17 15:13:45,997 INFO L124 PetriNetUnfolderBase]: 3/91 cut-off events. [2023-11-17 15:13:45,997 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 15:13:46,002 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98 conditions, 91 events. 3/91 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 48 event pairs, 0 based on Foata normal form. 0/86 useless extension candidates. Maximal degree in co-relation 57. Up to 2 conditions per place. [2023-11-17 15:13:46,002 INFO L82 GeneralOperation]: Start removeDead. Operand has 97 places, 93 transitions, 194 flow [2023-11-17 15:13:46,005 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 95 places, 91 transitions, 188 flow [2023-11-17 15:13:46,009 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-11-17 15:13:46,020 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 95 places, 91 transitions, 188 flow [2023-11-17 15:13:46,022 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 95 places, 91 transitions, 188 flow [2023-11-17 15:13:46,023 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 95 places, 91 transitions, 188 flow [2023-11-17 15:13:46,041 INFO L124 PetriNetUnfolderBase]: 3/91 cut-off events. [2023-11-17 15:13:46,041 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 15:13:46,042 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98 conditions, 91 events. 3/91 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 48 event pairs, 0 based on Foata normal form. 0/86 useless extension candidates. Maximal degree in co-relation 57. Up to 2 conditions per place. [2023-11-17 15:13:46,043 INFO L119 LiptonReduction]: Number of co-enabled transitions 1324 [2023-11-17 15:13:49,704 INFO L134 LiptonReduction]: Checked pairs total: 3485 [2023-11-17 15:13:49,704 INFO L136 LiptonReduction]: Total number of compositions: 89 [2023-11-17 15:13:49,719 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-17 15:13:49,725 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@736746d9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-17 15:13:49,725 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-11-17 15:13:49,727 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-17 15:13:49,727 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-11-17 15:13:49,727 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 15:13:49,727 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:13:49,728 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-11-17 15:13:49,728 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-11-17 15:13:49,731 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:13:49,732 INFO L85 PathProgramCache]: Analyzing trace with hash 424115, now seen corresponding path program 1 times [2023-11-17 15:13:49,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:13:49,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807327789] [2023-11-17 15:13:49,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:13:49,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:13:49,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:13:50,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:13:50,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:13:50,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807327789] [2023-11-17 15:13:50,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807327789] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:13:50,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:13:50,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-17 15:13:50,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18977279] [2023-11-17 15:13:50,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:13:50,155 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 15:13:50,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:13:50,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 15:13:50,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 15:13:50,190 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 182 [2023-11-17 15:13:50,192 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 19 transitions, 44 flow. Second operand has 3 states, 3 states have (on average 81.0) internal successors, (243), 3 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:13:50,192 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:13:50,192 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 182 [2023-11-17 15:13:50,193 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:13:50,332 INFO L124 PetriNetUnfolderBase]: 142/280 cut-off events. [2023-11-17 15:13:50,332 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-17 15:13:50,334 INFO L83 FinitePrefix]: Finished finitePrefix Result has 545 conditions, 280 events. 142/280 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1205 event pairs, 16 based on Foata normal form. 0/259 useless extension candidates. Maximal degree in co-relation 535. Up to 208 conditions per place. [2023-11-17 15:13:50,337 INFO L140 encePairwiseOnDemand]: 178/182 looper letters, 21 selfloop transitions, 2 changer transitions 2/27 dead transitions. [2023-11-17 15:13:50,337 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 27 transitions, 113 flow [2023-11-17 15:13:50,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 15:13:50,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 15:13:50,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 267 transitions. [2023-11-17 15:13:50,357 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.489010989010989 [2023-11-17 15:13:50,358 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 267 transitions. [2023-11-17 15:13:50,359 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 267 transitions. [2023-11-17 15:13:50,362 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:13:50,364 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 267 transitions. [2023-11-17 15:13:50,368 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 89.0) internal successors, (267), 3 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:13:50,372 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 182.0) internal successors, (728), 4 states have internal predecessors, (728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:13:50,373 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 182.0) internal successors, (728), 4 states have internal predecessors, (728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:13:50,374 INFO L175 Difference]: Start difference. First operand has 25 places, 19 transitions, 44 flow. Second operand 3 states and 267 transitions. [2023-11-17 15:13:50,375 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 27 transitions, 113 flow [2023-11-17 15:13:50,377 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 27 transitions, 110 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-17 15:13:50,378 INFO L231 Difference]: Finished difference. Result has 24 places, 16 transitions, 40 flow [2023-11-17 15:13:50,380 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=40, PETRI_PLACES=24, PETRI_TRANSITIONS=16} [2023-11-17 15:13:50,384 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, -1 predicate places. [2023-11-17 15:13:50,384 INFO L495 AbstractCegarLoop]: Abstraction has has 24 places, 16 transitions, 40 flow [2023-11-17 15:13:50,385 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 81.0) internal successors, (243), 3 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:13:50,385 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:13:50,385 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:13:50,385 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-17 15:13:50,385 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-11-17 15:13:50,387 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:13:50,387 INFO L85 PathProgramCache]: Analyzing trace with hash 879971290, now seen corresponding path program 1 times [2023-11-17 15:13:50,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:13:50,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566030068] [2023-11-17 15:13:50,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:13:50,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:13:50,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:13:50,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:13:50,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:13:50,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566030068] [2023-11-17 15:13:50,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566030068] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:13:50,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:13:50,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-17 15:13:50,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725604433] [2023-11-17 15:13:50,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:13:50,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 15:13:50,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:13:50,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 15:13:50,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 15:13:50,581 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 182 [2023-11-17 15:13:50,581 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 16 transitions, 40 flow. Second operand has 3 states, 3 states have (on average 76.33333333333333) internal successors, (229), 3 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:13:50,581 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:13:50,582 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 182 [2023-11-17 15:13:50,582 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:13:50,692 INFO L124 PetriNetUnfolderBase]: 224/410 cut-off events. [2023-11-17 15:13:50,692 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2023-11-17 15:13:50,695 INFO L83 FinitePrefix]: Finished finitePrefix Result has 861 conditions, 410 events. 224/410 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1665 event pairs, 66 based on Foata normal form. 20/430 useless extension candidates. Maximal degree in co-relation 851. Up to 255 conditions per place. [2023-11-17 15:13:50,698 INFO L140 encePairwiseOnDemand]: 176/182 looper letters, 21 selfloop transitions, 5 changer transitions 0/26 dead transitions. [2023-11-17 15:13:50,698 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 26 transitions, 114 flow [2023-11-17 15:13:50,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 15:13:50,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 15:13:50,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 249 transitions. [2023-11-17 15:13:50,701 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45604395604395603 [2023-11-17 15:13:50,701 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 249 transitions. [2023-11-17 15:13:50,701 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 249 transitions. [2023-11-17 15:13:50,701 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:13:50,701 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 249 transitions. [2023-11-17 15:13:50,702 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 83.0) internal successors, (249), 3 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:13:50,703 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 182.0) internal successors, (728), 4 states have internal predecessors, (728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:13:50,704 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 182.0) internal successors, (728), 4 states have internal predecessors, (728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:13:50,704 INFO L175 Difference]: Start difference. First operand has 24 places, 16 transitions, 40 flow. Second operand 3 states and 249 transitions. [2023-11-17 15:13:50,704 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 26 transitions, 114 flow [2023-11-17 15:13:50,704 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 26 transitions, 108 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-17 15:13:50,705 INFO L231 Difference]: Finished difference. Result has 25 places, 19 transitions, 70 flow [2023-11-17 15:13:50,705 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=36, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=70, PETRI_PLACES=25, PETRI_TRANSITIONS=19} [2023-11-17 15:13:50,706 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, 0 predicate places. [2023-11-17 15:13:50,706 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 19 transitions, 70 flow [2023-11-17 15:13:50,706 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 76.33333333333333) internal successors, (229), 3 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:13:50,706 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:13:50,707 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:13:50,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-17 15:13:50,707 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-11-17 15:13:50,707 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:13:50,708 INFO L85 PathProgramCache]: Analyzing trace with hash 1509304893, now seen corresponding path program 1 times [2023-11-17 15:13:50,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:13:50,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478065885] [2023-11-17 15:13:50,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:13:50,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:13:50,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:13:50,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:13:50,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:13:50,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478065885] [2023-11-17 15:13:50,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478065885] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:13:50,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:13:50,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 15:13:50,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645145477] [2023-11-17 15:13:50,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:13:50,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 15:13:50,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:13:50,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 15:13:50,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-17 15:13:50,850 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 182 [2023-11-17 15:13:50,850 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 19 transitions, 70 flow. Second operand has 4 states, 4 states have (on average 76.0) internal successors, (304), 4 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:13:50,850 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:13:50,850 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 182 [2023-11-17 15:13:50,850 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:13:50,942 INFO L124 PetriNetUnfolderBase]: 213/391 cut-off events. [2023-11-17 15:13:50,943 INFO L125 PetriNetUnfolderBase]: For 137/137 co-relation queries the response was YES. [2023-11-17 15:13:50,943 INFO L83 FinitePrefix]: Finished finitePrefix Result has 970 conditions, 391 events. 213/391 cut-off events. For 137/137 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1517 event pairs, 56 based on Foata normal form. 5/396 useless extension candidates. Maximal degree in co-relation 958. Up to 205 conditions per place. [2023-11-17 15:13:50,945 INFO L140 encePairwiseOnDemand]: 177/182 looper letters, 26 selfloop transitions, 5 changer transitions 0/31 dead transitions. [2023-11-17 15:13:50,945 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 31 transitions, 160 flow [2023-11-17 15:13:50,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 15:13:50,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-17 15:13:50,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 326 transitions. [2023-11-17 15:13:50,947 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4478021978021978 [2023-11-17 15:13:50,947 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 326 transitions. [2023-11-17 15:13:50,947 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 326 transitions. [2023-11-17 15:13:50,947 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:13:50,947 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 326 transitions. [2023-11-17 15:13:50,948 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 81.5) internal successors, (326), 4 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:13:50,950 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 182.0) internal successors, (910), 5 states have internal predecessors, (910), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:13:50,950 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 182.0) internal successors, (910), 5 states have internal predecessors, (910), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:13:50,950 INFO L175 Difference]: Start difference. First operand has 25 places, 19 transitions, 70 flow. Second operand 4 states and 326 transitions. [2023-11-17 15:13:50,950 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 31 transitions, 160 flow [2023-11-17 15:13:50,952 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 31 transitions, 148 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-17 15:13:50,953 INFO L231 Difference]: Finished difference. Result has 28 places, 20 transitions, 86 flow [2023-11-17 15:13:50,953 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=86, PETRI_PLACES=28, PETRI_TRANSITIONS=20} [2023-11-17 15:13:50,954 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, 3 predicate places. [2023-11-17 15:13:50,954 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 20 transitions, 86 flow [2023-11-17 15:13:50,954 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 76.0) internal successors, (304), 4 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:13:50,954 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:13:50,954 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:13:50,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-17 15:13:50,955 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-11-17 15:13:50,955 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:13:50,955 INFO L85 PathProgramCache]: Analyzing trace with hash -457747551, now seen corresponding path program 1 times [2023-11-17 15:13:50,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:13:50,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776932460] [2023-11-17 15:13:50,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:13:50,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:13:50,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:13:51,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:13:51,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:13:51,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776932460] [2023-11-17 15:13:51,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776932460] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:13:51,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:13:51,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 15:13:51,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698221478] [2023-11-17 15:13:51,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:13:51,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 15:13:51,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:13:51,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 15:13:51,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-17 15:13:51,090 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 182 [2023-11-17 15:13:51,090 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 20 transitions, 86 flow. Second operand has 4 states, 4 states have (on average 76.0) internal successors, (304), 4 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:13:51,090 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:13:51,090 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 182 [2023-11-17 15:13:51,090 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:13:51,197 INFO L124 PetriNetUnfolderBase]: 93/221 cut-off events. [2023-11-17 15:13:51,197 INFO L125 PetriNetUnfolderBase]: For 70/76 co-relation queries the response was YES. [2023-11-17 15:13:51,198 INFO L83 FinitePrefix]: Finished finitePrefix Result has 536 conditions, 221 events. 93/221 cut-off events. For 70/76 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 943 event pairs, 16 based on Foata normal form. 34/253 useless extension candidates. Maximal degree in co-relation 522. Up to 100 conditions per place. [2023-11-17 15:13:51,199 INFO L140 encePairwiseOnDemand]: 177/182 looper letters, 25 selfloop transitions, 5 changer transitions 12/47 dead transitions. [2023-11-17 15:13:51,199 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 47 transitions, 253 flow [2023-11-17 15:13:51,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 15:13:51,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 15:13:51,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 410 transitions. [2023-11-17 15:13:51,201 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45054945054945056 [2023-11-17 15:13:51,201 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 410 transitions. [2023-11-17 15:13:51,201 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 410 transitions. [2023-11-17 15:13:51,202 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:13:51,202 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 410 transitions. [2023-11-17 15:13:51,203 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 82.0) internal successors, (410), 5 states have internal predecessors, (410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:13:51,205 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 182.0) internal successors, (1092), 6 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:13:51,206 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 182.0) internal successors, (1092), 6 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:13:51,206 INFO L175 Difference]: Start difference. First operand has 28 places, 20 transitions, 86 flow. Second operand 5 states and 410 transitions. [2023-11-17 15:13:51,206 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 47 transitions, 253 flow [2023-11-17 15:13:51,209 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 47 transitions, 250 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-17 15:13:51,210 INFO L231 Difference]: Finished difference. Result has 34 places, 24 transitions, 120 flow [2023-11-17 15:13:51,210 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=83, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=120, PETRI_PLACES=34, PETRI_TRANSITIONS=24} [2023-11-17 15:13:51,212 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, 9 predicate places. [2023-11-17 15:13:51,213 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 24 transitions, 120 flow [2023-11-17 15:13:51,213 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 76.0) internal successors, (304), 4 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:13:51,213 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:13:51,213 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:13:51,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-17 15:13:51,214 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-11-17 15:13:51,214 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:13:51,214 INFO L85 PathProgramCache]: Analyzing trace with hash 1526850675, now seen corresponding path program 1 times [2023-11-17 15:13:51,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:13:51,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195452217] [2023-11-17 15:13:51,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:13:51,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:13:51,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:13:51,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:13:51,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:13:51,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195452217] [2023-11-17 15:13:51,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195452217] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:13:51,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:13:51,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-17 15:13:51,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484460817] [2023-11-17 15:13:51,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:13:51,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-17 15:13:51,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:13:51,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-17 15:13:51,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-17 15:13:51,468 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 182 [2023-11-17 15:13:51,469 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 24 transitions, 120 flow. Second operand has 5 states, 5 states have (on average 76.2) internal successors, (381), 5 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:13:51,469 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:13:51,469 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 182 [2023-11-17 15:13:51,469 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:13:51,595 INFO L124 PetriNetUnfolderBase]: 68/170 cut-off events. [2023-11-17 15:13:51,595 INFO L125 PetriNetUnfolderBase]: For 140/144 co-relation queries the response was YES. [2023-11-17 15:13:51,596 INFO L83 FinitePrefix]: Finished finitePrefix Result has 536 conditions, 170 events. 68/170 cut-off events. For 140/144 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 690 event pairs, 11 based on Foata normal form. 15/183 useless extension candidates. Maximal degree in co-relation 518. Up to 56 conditions per place. [2023-11-17 15:13:51,597 INFO L140 encePairwiseOnDemand]: 177/182 looper letters, 22 selfloop transitions, 8 changer transitions 12/47 dead transitions. [2023-11-17 15:13:51,597 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 47 transitions, 287 flow [2023-11-17 15:13:51,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-17 15:13:51,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-17 15:13:51,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 558 transitions. [2023-11-17 15:13:51,599 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4379905808477237 [2023-11-17 15:13:51,599 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 558 transitions. [2023-11-17 15:13:51,599 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 558 transitions. [2023-11-17 15:13:51,600 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:13:51,600 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 558 transitions. [2023-11-17 15:13:51,601 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 79.71428571428571) internal successors, (558), 7 states have internal predecessors, (558), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:13:51,603 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 182.0) internal successors, (1456), 8 states have internal predecessors, (1456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:13:51,604 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 182.0) internal successors, (1456), 8 states have internal predecessors, (1456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:13:51,604 INFO L175 Difference]: Start difference. First operand has 34 places, 24 transitions, 120 flow. Second operand 7 states and 558 transitions. [2023-11-17 15:13:51,604 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 47 transitions, 287 flow [2023-11-17 15:13:51,605 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 47 transitions, 282 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-11-17 15:13:51,606 INFO L231 Difference]: Finished difference. Result has 42 places, 25 transitions, 148 flow [2023-11-17 15:13:51,607 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=115, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=148, PETRI_PLACES=42, PETRI_TRANSITIONS=25} [2023-11-17 15:13:51,607 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, 17 predicate places. [2023-11-17 15:13:51,607 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 25 transitions, 148 flow [2023-11-17 15:13:51,608 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 76.2) internal successors, (381), 5 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:13:51,608 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:13:51,608 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:13:51,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-17 15:13:51,608 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-11-17 15:13:51,609 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:13:51,609 INFO L85 PathProgramCache]: Analyzing trace with hash 2092083266, now seen corresponding path program 1 times [2023-11-17 15:13:51,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:13:51,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4912789] [2023-11-17 15:13:51,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:13:51,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:13:51,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:13:52,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:13:52,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:13:52,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4912789] [2023-11-17 15:13:52,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4912789] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:13:52,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:13:52,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-17 15:13:52,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742840231] [2023-11-17 15:13:52,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:13:52,020 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-17 15:13:52,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:13:52,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-17 15:13:52,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-17 15:13:52,021 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 182 [2023-11-17 15:13:52,022 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 25 transitions, 148 flow. Second operand has 6 states, 6 states have (on average 77.33333333333333) internal successors, (464), 6 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:13:52,022 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:13:52,022 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 182 [2023-11-17 15:13:52,022 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:13:52,170 INFO L124 PetriNetUnfolderBase]: 71/187 cut-off events. [2023-11-17 15:13:52,170 INFO L125 PetriNetUnfolderBase]: For 369/375 co-relation queries the response was YES. [2023-11-17 15:13:52,171 INFO L83 FinitePrefix]: Finished finitePrefix Result has 686 conditions, 187 events. 71/187 cut-off events. For 369/375 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 794 event pairs, 15 based on Foata normal form. 1/187 useless extension candidates. Maximal degree in co-relation 664. Up to 84 conditions per place. [2023-11-17 15:13:52,172 INFO L140 encePairwiseOnDemand]: 176/182 looper letters, 21 selfloop transitions, 5 changer transitions 25/56 dead transitions. [2023-11-17 15:13:52,172 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 56 transitions, 446 flow [2023-11-17 15:13:52,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-17 15:13:52,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-17 15:13:52,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 561 transitions. [2023-11-17 15:13:52,179 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4403453689167975 [2023-11-17 15:13:52,179 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 561 transitions. [2023-11-17 15:13:52,179 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 561 transitions. [2023-11-17 15:13:52,179 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:13:52,180 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 561 transitions. [2023-11-17 15:13:52,181 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 80.14285714285714) internal successors, (561), 7 states have internal predecessors, (561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:13:52,184 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 182.0) internal successors, (1456), 8 states have internal predecessors, (1456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:13:52,185 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 182.0) internal successors, (1456), 8 states have internal predecessors, (1456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:13:52,185 INFO L175 Difference]: Start difference. First operand has 42 places, 25 transitions, 148 flow. Second operand 7 states and 561 transitions. [2023-11-17 15:13:52,185 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 56 transitions, 446 flow [2023-11-17 15:13:52,188 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 56 transitions, 379 flow, removed 14 selfloop flow, removed 6 redundant places. [2023-11-17 15:13:52,189 INFO L231 Difference]: Finished difference. Result has 44 places, 25 transitions, 138 flow [2023-11-17 15:13:52,189 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=123, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=138, PETRI_PLACES=44, PETRI_TRANSITIONS=25} [2023-11-17 15:13:52,191 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, 19 predicate places. [2023-11-17 15:13:52,191 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 25 transitions, 138 flow [2023-11-17 15:13:52,191 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 77.33333333333333) internal successors, (464), 6 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:13:52,191 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:13:52,191 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:13:52,192 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-17 15:13:52,192 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-11-17 15:13:52,192 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:13:52,192 INFO L85 PathProgramCache]: Analyzing trace with hash 751225850, now seen corresponding path program 2 times [2023-11-17 15:13:52,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:13:52,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820394639] [2023-11-17 15:13:52,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:13:52,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:13:52,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-17 15:13:52,259 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-17 15:13:52,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-17 15:13:52,341 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-17 15:13:52,342 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-17 15:13:52,343 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2023-11-17 15:13:52,344 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2023-11-17 15:13:52,345 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2023-11-17 15:13:52,345 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2023-11-17 15:13:52,346 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2023-11-17 15:13:52,347 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-17 15:13:52,347 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1] [2023-11-17 15:13:52,353 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-17 15:13:52,353 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-17 15:13:52,402 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-17 15:13:52,403 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-17 15:13:52,422 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.11 03:13:52 BasicIcfg [2023-11-17 15:13:52,423 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-17 15:13:52,423 INFO L158 Benchmark]: Toolchain (without parser) took 7906.69ms. Allocated memory was 195.0MB in the beginning and 305.1MB in the end (delta: 110.1MB). Free memory was 152.4MB in the beginning and 239.6MB in the end (delta: -87.1MB). Peak memory consumption was 23.9MB. Max. memory is 8.0GB. [2023-11-17 15:13:52,423 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 195.0MB. Free memory is still 154.2MB. There was no memory consumed. Max. memory is 8.0GB. [2023-11-17 15:13:52,424 INFO L158 Benchmark]: CACSL2BoogieTranslator took 508.77ms. Allocated memory is still 195.0MB. Free memory was 152.4MB in the beginning and 129.7MB in the end (delta: 22.7MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. [2023-11-17 15:13:52,424 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.44ms. Allocated memory is still 195.0MB. Free memory was 129.7MB in the beginning and 127.2MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-11-17 15:13:52,428 INFO L158 Benchmark]: Boogie Preprocessor took 35.64ms. Allocated memory is still 195.0MB. Free memory was 127.2MB in the beginning and 125.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-11-17 15:13:52,431 INFO L158 Benchmark]: RCFGBuilder took 730.19ms. Allocated memory is still 195.0MB. Free memory was 125.5MB in the beginning and 148.9MB in the end (delta: -23.4MB). Peak memory consumption was 19.2MB. Max. memory is 8.0GB. [2023-11-17 15:13:52,431 INFO L158 Benchmark]: TraceAbstraction took 6586.31ms. Allocated memory was 195.0MB in the beginning and 305.1MB in the end (delta: 110.1MB). Free memory was 148.3MB in the beginning and 239.6MB in the end (delta: -91.2MB). Peak memory consumption was 18.4MB. Max. memory is 8.0GB. [2023-11-17 15:13:52,439 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 195.0MB. Free memory is still 154.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 508.77ms. Allocated memory is still 195.0MB. Free memory was 152.4MB in the beginning and 129.7MB in the end (delta: 22.7MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 40.44ms. Allocated memory is still 195.0MB. Free memory was 129.7MB in the beginning and 127.2MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 35.64ms. Allocated memory is still 195.0MB. Free memory was 127.2MB in the beginning and 125.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 730.19ms. Allocated memory is still 195.0MB. Free memory was 125.5MB in the beginning and 148.9MB in the end (delta: -23.4MB). Peak memory consumption was 19.2MB. Max. memory is 8.0GB. * TraceAbstraction took 6586.31ms. Allocated memory was 195.0MB in the beginning and 305.1MB in the end (delta: 110.1MB). Free memory was 148.3MB in the beginning and 239.6MB in the end (delta: -91.2MB). Peak memory consumption was 18.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.7s, 95 PlacesBefore, 25 PlacesAfterwards, 91 TransitionsBefore, 19 TransitionsAfterwards, 1324 CoEnabledTransitionPairs, 7 FixpointIterations, 34 TrivialSequentialCompositions, 42 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 11 ConcurrentYvCompositions, 2 ChoiceCompositions, 89 TotalNumberOfCompositions, 3485 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1803, independent: 1656, independent conditional: 0, independent unconditional: 1656, dependent: 147, dependent conditional: 0, dependent unconditional: 147, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1095, independent: 1052, independent conditional: 0, independent unconditional: 1052, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1095, independent: 1018, independent conditional: 0, independent unconditional: 1018, dependent: 77, dependent conditional: 0, dependent unconditional: 77, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 77, independent: 34, independent conditional: 0, independent unconditional: 34, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 343, independent: 46, independent conditional: 0, independent unconditional: 46, dependent: 297, dependent conditional: 0, dependent unconditional: 297, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1803, independent: 604, independent conditional: 0, independent unconditional: 604, dependent: 104, dependent conditional: 0, dependent unconditional: 104, unknown: 1095, unknown conditional: 0, unknown unconditional: 1095] , Statistics on independence cache: Total cache size (in pairs): 78, Positive cache size: 59, Positive conditional cache size: 0, Positive unconditional cache size: 59, Negative cache size: 19, Negative conditional cache size: 0, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p1_EAX = 0; [L712] 0 int __unbuffered_p1_EBX = 0; [L713] 0 _Bool main$tmp_guard0; [L714] 0 _Bool main$tmp_guard1; [L716] 0 int x = 0; [L718] 0 int y = 0; [L719] 0 _Bool y$flush_delayed; [L720] 0 int y$mem_tmp; [L721] 0 _Bool y$r_buff0_thd0; [L722] 0 _Bool y$r_buff0_thd1; [L723] 0 _Bool y$r_buff0_thd2; [L724] 0 _Bool y$r_buff1_thd0; [L725] 0 _Bool y$r_buff1_thd1; [L726] 0 _Bool y$r_buff1_thd2; [L727] 0 _Bool y$read_delayed; [L728] 0 int *y$read_delayed_var; [L729] 0 int y$w_buff0; [L730] 0 _Bool y$w_buff0_used; [L731] 0 int y$w_buff1; [L732] 0 _Bool y$w_buff1_used; [L733] 0 _Bool weak$$choice0; [L734] 0 _Bool weak$$choice2; [L810] 0 pthread_t t585; [L811] FCALL, FORK 0 pthread_create(&t585, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t585={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L812] 0 pthread_t t586; [L813] FCALL, FORK 0 pthread_create(&t586, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t585={5:0}, t586={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L738] 1 y$w_buff1 = y$w_buff0 [L739] 1 y$w_buff0 = 1 [L740] 1 y$w_buff1_used = y$w_buff0_used [L741] 1 y$w_buff0_used = (_Bool)1 [L742] CALL 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L742] RET 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L743] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L744] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L745] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L746] 1 y$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L749] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L766] 2 x = 2 VAL [__unbuffered_cnt=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=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L769] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __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=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L772] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L773] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L774] 2 y$flush_delayed = weak$$choice2 [L775] 2 y$mem_tmp = y [L776] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L777] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L778] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L779] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L780] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L781] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L782] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L783] 2 __unbuffered_p1_EBX = y [L784] 2 y = y$flush_delayed ? y$mem_tmp : y [L785] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L788] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L789] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L790] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L791] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L792] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L795] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L797] 2 return 0; [L752] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L753] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L754] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L755] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L756] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __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=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L759] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L761] 1 return 0; [L815] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L817] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L817] RET 0 assume_abort_if_not(main$tmp_guard0) [L819] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L820] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L821] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L822] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L823] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t585={5:0}, t586={3:0}, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L826] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0) [L828] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] - UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 811]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 813]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 111 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.4s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 83 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 83 mSDsluCounter, 5 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 314 IncrementalHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 4 mSDtfsCounter, 314 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=148occurred in iteration=5, InterpolantAutomatonStates: 29, 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.2s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 71 NumberOfCodeBlocks, 71 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 49 ConstructedInterpolants, 0 QuantifiedInterpolants, 295 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-11-17 15:13:52,472 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...