/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf --rcfgbuilder.only.consider.context.switches.at.boundaries.of.atomic.blocks true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe033_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.dk.datarace-free-lbe-02cf818-m [2023-11-17 11:30:01,012 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-17 11:30:01,077 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf [2023-11-17 11:30:01,102 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-17 11:30:01,102 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-17 11:30:01,103 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-17 11:30:01,103 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-17 11:30:01,103 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-17 11:30:01,104 INFO L153 SettingsManager]: * Use SBE=true [2023-11-17 11:30:01,106 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-17 11:30:01,107 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-17 11:30:01,107 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-17 11:30:01,107 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-17 11:30:01,108 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-17 11:30:01,108 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-17 11:30:01,108 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-17 11:30:01,109 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-17 11:30:01,109 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-17 11:30:01,109 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-17 11:30:01,109 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-17 11:30:01,109 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-17 11:30:01,110 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-17 11:30:01,110 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-17 11:30:01,110 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-17 11:30:01,110 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-17 11:30:01,111 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 11:30:01,111 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-17 11:30:01,111 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-17 11:30:01,111 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-17 11:30:01,112 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-17 11:30:01,112 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-17 11:30:01,113 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-17 11:30:01,113 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Only consider context switches at boundaries of atomic blocks -> true [2023-11-17 11:30:01,295 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-17 11:30:01,322 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-17 11:30:01,324 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-17 11:30:01,325 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-17 11:30:01,325 INFO L274 PluginConnector]: CDTParser initialized [2023-11-17 11:30:01,326 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe033_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-11-17 11:30:02,281 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-17 11:30:02,475 INFO L384 CDTParser]: Found 1 translation units. [2023-11-17 11:30:02,476 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe033_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-11-17 11:30:02,491 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b92a4d287/237613234cb0453ab5f4656171cc47cb/FLAGeed5ffc70 [2023-11-17 11:30:02,501 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b92a4d287/237613234cb0453ab5f4656171cc47cb [2023-11-17 11:30:02,503 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-17 11:30:02,504 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-17 11:30:02,504 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-17 11:30:02,504 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-17 11:30:02,507 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-17 11:30:02,508 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 11:30:02" (1/1) ... [2023-11-17 11:30:02,509 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1528021b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:30:02, skipping insertion in model container [2023-11-17 11:30:02,509 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 11:30:02" (1/1) ... [2023-11-17 11:30:02,551 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-17 11:30:02,711 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/safe033_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1039,1052] [2023-11-17 11:30:02,873 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 11:30:02,881 INFO L202 MainTranslator]: Completed pre-run [2023-11-17 11:30:02,890 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/safe033_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1039,1052] [2023-11-17 11:30:02,942 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 11:30:02,966 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-17 11:30:02,966 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-17 11:30:02,971 INFO L206 MainTranslator]: Completed translation [2023-11-17 11:30:02,971 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:30:02 WrapperNode [2023-11-17 11:30:02,971 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-17 11:30:02,972 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-17 11:30:02,973 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-17 11:30:02,973 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-17 11:30:02,978 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:30:02" (1/1) ... [2023-11-17 11:30:03,002 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:30:02" (1/1) ... [2023-11-17 11:30:03,016 INFO L138 Inliner]: procedures = 175, calls = 43, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 111 [2023-11-17 11:30:03,017 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-17 11:30:03,017 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-17 11:30:03,017 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-17 11:30:03,017 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-17 11:30:03,023 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:30:02" (1/1) ... [2023-11-17 11:30:03,023 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:30:02" (1/1) ... [2023-11-17 11:30:03,025 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:30:02" (1/1) ... [2023-11-17 11:30:03,025 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:30:02" (1/1) ... [2023-11-17 11:30:03,030 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:30:02" (1/1) ... [2023-11-17 11:30:03,031 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:30:02" (1/1) ... [2023-11-17 11:30:03,032 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:30:02" (1/1) ... [2023-11-17 11:30:03,033 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:30:02" (1/1) ... [2023-11-17 11:30:03,035 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-17 11:30:03,036 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-17 11:30:03,036 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-17 11:30:03,036 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-17 11:30:03,037 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:30:02" (1/1) ... [2023-11-17 11:30:03,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 11:30:03,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 11:30:03,065 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-17 11:30:03,076 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-17 11:30:03,088 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-17 11:30:03,089 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-17 11:30:03,089 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-17 11:30:03,089 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-17 11:30:03,089 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-17 11:30:03,089 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-17 11:30:03,089 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-17 11:30:03,089 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-17 11:30:03,089 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-17 11:30:03,089 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-17 11:30:03,090 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-17 11:30:03,090 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-17 11:30:03,090 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-17 11:30:03,091 WARN L211 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-17 11:30:03,208 INFO L239 CfgBuilder]: Building ICFG [2023-11-17 11:30:03,210 INFO L265 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-17 11:30:03,463 INFO L280 CfgBuilder]: Performing block encoding [2023-11-17 11:30:03,637 INFO L302 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-17 11:30:03,637 INFO L307 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-17 11:30:03,639 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 11:30:03 BoogieIcfgContainer [2023-11-17 11:30:03,639 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-17 11:30:03,640 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-17 11:30:03,641 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-17 11:30:03,643 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-17 11:30:03,643 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 11:30:02" (1/3) ... [2023-11-17 11:30:03,643 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71eb25a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 11:30:03, skipping insertion in model container [2023-11-17 11:30:03,644 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:30:02" (2/3) ... [2023-11-17 11:30:03,644 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71eb25a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 11:30:03, skipping insertion in model container [2023-11-17 11:30:03,644 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 11:30:03" (3/3) ... [2023-11-17 11:30:03,645 INFO L112 eAbstractionObserver]: Analyzing ICFG safe033_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-11-17 11:30:03,658 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-17 11:30:03,658 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-17 11:30:03,658 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-17 11:30:03,689 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-17 11:30:03,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 31 transitions, 70 flow [2023-11-17 11:30:03,740 INFO L124 PetriNetUnfolderBase]: 1/29 cut-off events. [2023-11-17 11:30:03,741 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 11:30:03,745 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36 conditions, 29 events. 1/29 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 45 event pairs, 0 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 29. Up to 2 conditions per place. [2023-11-17 11:30:03,746 INFO L82 GeneralOperation]: Start removeDead. Operand has 37 places, 31 transitions, 70 flow [2023-11-17 11:30:03,748 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 35 places, 29 transitions, 64 flow [2023-11-17 11:30:03,751 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-11-17 11:30:03,762 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 29 transitions, 64 flow [2023-11-17 11:30:03,765 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 29 transitions, 64 flow [2023-11-17 11:30:03,766 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 29 transitions, 64 flow [2023-11-17 11:30:03,776 INFO L124 PetriNetUnfolderBase]: 1/29 cut-off events. [2023-11-17 11:30:03,776 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 11:30:03,777 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36 conditions, 29 events. 1/29 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 45 event pairs, 0 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 29. Up to 2 conditions per place. [2023-11-17 11:30:03,777 INFO L119 LiptonReduction]: Number of co-enabled transitions 434 [2023-11-17 11:30:04,527 INFO L134 LiptonReduction]: Checked pairs total: 870 [2023-11-17 11:30:04,527 INFO L136 LiptonReduction]: Total number of compositions: 18 [2023-11-17 11:30:04,537 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-17 11:30:04,541 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;@5935869b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-17 11:30:04,542 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-11-17 11:30:04,544 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-17 11:30:04,545 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2023-11-17 11:30:04,545 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 11:30:04,545 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:30:04,545 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-17 11:30:04,545 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-17 11:30:04,549 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:30:04,549 INFO L85 PathProgramCache]: Analyzing trace with hash 295406430, now seen corresponding path program 1 times [2023-11-17 11:30:04,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:30:04,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873334401] [2023-11-17 11:30:04,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:30:04,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:30:04,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:30:04,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:30:04,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:30:04,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873334401] [2023-11-17 11:30:04,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873334401] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:30:04,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:30:04,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-17 11:30:04,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126631829] [2023-11-17 11:30:04,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:30:04,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 11:30:04,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:30:04,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 11:30:04,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 11:30:04,849 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 49 [2023-11-17 11:30:04,850 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 16 transitions, 38 flow. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:30:04,850 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:30:04,851 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 49 [2023-11-17 11:30:04,851 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:30:04,955 INFO L124 PetriNetUnfolderBase]: 111/220 cut-off events. [2023-11-17 11:30:04,955 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-17 11:30:04,957 INFO L83 FinitePrefix]: Finished finitePrefix Result has 434 conditions, 220 events. 111/220 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 798 event pairs, 18 based on Foata normal form. 0/204 useless extension candidates. Maximal degree in co-relation 424. Up to 154 conditions per place. [2023-11-17 11:30:04,960 INFO L140 encePairwiseOnDemand]: 46/49 looper letters, 17 selfloop transitions, 2 changer transitions 2/22 dead transitions. [2023-11-17 11:30:04,960 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 22 transitions, 92 flow [2023-11-17 11:30:04,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 11:30:04,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 11:30:04,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 67 transitions. [2023-11-17 11:30:04,969 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4557823129251701 [2023-11-17 11:30:04,970 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 67 transitions. [2023-11-17 11:30:04,970 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 67 transitions. [2023-11-17 11:30:04,971 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:30:04,972 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 67 transitions. [2023-11-17 11:30:04,974 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:30:04,979 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 49.0) internal successors, (196), 4 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:30:04,979 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 49.0) internal successors, (196), 4 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:30:04,981 INFO L175 Difference]: Start difference. First operand has 23 places, 16 transitions, 38 flow. Second operand 3 states and 67 transitions. [2023-11-17 11:30:04,981 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 22 transitions, 92 flow [2023-11-17 11:30:04,983 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 22 places, 22 transitions, 90 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-17 11:30:04,984 INFO L231 Difference]: Finished difference. Result has 22 places, 14 transitions, 36 flow [2023-11-17 11:30:04,985 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=34, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=36, PETRI_PLACES=22, PETRI_TRANSITIONS=14} [2023-11-17 11:30:04,988 INFO L281 CegarLoopForPetriNet]: 23 programPoint places, -1 predicate places. [2023-11-17 11:30:04,988 INFO L495 AbstractCegarLoop]: Abstraction has has 22 places, 14 transitions, 36 flow [2023-11-17 11:30:04,989 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:30:04,989 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:30:04,989 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:30:04,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-17 11:30:04,989 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-17 11:30:04,990 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:30:04,990 INFO L85 PathProgramCache]: Analyzing trace with hash 417746500, now seen corresponding path program 1 times [2023-11-17 11:30:04,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:30:04,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906566362] [2023-11-17 11:30:04,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:30:04,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:30:05,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:30:05,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:30:05,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:30:05,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906566362] [2023-11-17 11:30:05,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906566362] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:30:05,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:30:05,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-17 11:30:05,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030735816] [2023-11-17 11:30:05,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:30:05,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 11:30:05,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:30:05,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 11:30:05,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 11:30:05,150 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 49 [2023-11-17 11:30:05,150 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 22 places, 14 transitions, 36 flow. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:30:05,151 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:30:05,151 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 49 [2023-11-17 11:30:05,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:30:05,232 INFO L124 PetriNetUnfolderBase]: 132/252 cut-off events. [2023-11-17 11:30:05,232 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2023-11-17 11:30:05,233 INFO L83 FinitePrefix]: Finished finitePrefix Result has 533 conditions, 252 events. 132/252 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1005 event pairs, 36 based on Foata normal form. 14/266 useless extension candidates. Maximal degree in co-relation 523. Up to 161 conditions per place. [2023-11-17 11:30:05,234 INFO L140 encePairwiseOnDemand]: 44/49 looper letters, 20 selfloop transitions, 4 changer transitions 0/24 dead transitions. [2023-11-17 11:30:05,234 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 23 places, 24 transitions, 108 flow [2023-11-17 11:30:05,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 11:30:05,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 11:30:05,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2023-11-17 11:30:05,235 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41496598639455784 [2023-11-17 11:30:05,235 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 61 transitions. [2023-11-17 11:30:05,235 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 61 transitions. [2023-11-17 11:30:05,236 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:30:05,236 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 61 transitions. [2023-11-17 11:30:05,236 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:30:05,237 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 49.0) internal successors, (196), 4 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:30:05,237 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 49.0) internal successors, (196), 4 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:30:05,237 INFO L175 Difference]: Start difference. First operand has 22 places, 14 transitions, 36 flow. Second operand 3 states and 61 transitions. [2023-11-17 11:30:05,237 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 23 places, 24 transitions, 108 flow [2023-11-17 11:30:05,237 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 21 places, 24 transitions, 102 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-17 11:30:05,238 INFO L231 Difference]: Finished difference. Result has 23 places, 16 transitions, 58 flow [2023-11-17 11:30:05,238 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=32, PETRI_DIFFERENCE_MINUEND_PLACES=19, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=14, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=10, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=58, PETRI_PLACES=23, PETRI_TRANSITIONS=16} [2023-11-17 11:30:05,238 INFO L281 CegarLoopForPetriNet]: 23 programPoint places, 0 predicate places. [2023-11-17 11:30:05,239 INFO L495 AbstractCegarLoop]: Abstraction has has 23 places, 16 transitions, 58 flow [2023-11-17 11:30:05,239 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:30:05,239 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:30:05,239 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:30:05,239 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-17 11:30:05,239 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-17 11:30:05,240 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:30:05,240 INFO L85 PathProgramCache]: Analyzing trace with hash 65239831, now seen corresponding path program 1 times [2023-11-17 11:30:05,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:30:05,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353456573] [2023-11-17 11:30:05,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:30:05,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:30:05,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:30:05,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:30:05,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:30:05,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353456573] [2023-11-17 11:30:05,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353456573] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:30:05,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:30:05,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 11:30:05,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99090930] [2023-11-17 11:30:05,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:30:05,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 11:30:05,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:30:05,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 11:30:05,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-17 11:30:05,391 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 49 [2023-11-17 11:30:05,391 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 16 transitions, 58 flow. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:30:05,391 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:30:05,392 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 49 [2023-11-17 11:30:05,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:30:05,453 INFO L124 PetriNetUnfolderBase]: 71/170 cut-off events. [2023-11-17 11:30:05,453 INFO L125 PetriNetUnfolderBase]: For 75/75 co-relation queries the response was YES. [2023-11-17 11:30:05,454 INFO L83 FinitePrefix]: Finished finitePrefix Result has 427 conditions, 170 events. 71/170 cut-off events. For 75/75 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 657 event pairs, 24 based on Foata normal form. 25/195 useless extension candidates. Maximal degree in co-relation 415. Up to 61 conditions per place. [2023-11-17 11:30:05,454 INFO L140 encePairwiseOnDemand]: 44/49 looper letters, 26 selfloop transitions, 4 changer transitions 1/33 dead transitions. [2023-11-17 11:30:05,455 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 33 transitions, 176 flow [2023-11-17 11:30:05,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 11:30:05,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-17 11:30:05,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 78 transitions. [2023-11-17 11:30:05,456 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3979591836734694 [2023-11-17 11:30:05,456 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 78 transitions. [2023-11-17 11:30:05,456 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 78 transitions. [2023-11-17 11:30:05,456 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:30:05,456 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 78 transitions. [2023-11-17 11:30:05,456 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:30:05,457 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 49.0) internal successors, (245), 5 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:30:05,457 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 49.0) internal successors, (245), 5 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:30:05,457 INFO L175 Difference]: Start difference. First operand has 23 places, 16 transitions, 58 flow. Second operand 4 states and 78 transitions. [2023-11-17 11:30:05,457 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 33 transitions, 176 flow [2023-11-17 11:30:05,458 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 33 transitions, 160 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-17 11:30:05,458 INFO L231 Difference]: Finished difference. Result has 26 places, 18 transitions, 76 flow [2023-11-17 11:30:05,459 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=50, 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=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=76, PETRI_PLACES=26, PETRI_TRANSITIONS=18} [2023-11-17 11:30:05,459 INFO L281 CegarLoopForPetriNet]: 23 programPoint places, 3 predicate places. [2023-11-17 11:30:05,459 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 18 transitions, 76 flow [2023-11-17 11:30:05,459 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:30:05,459 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:30:05,459 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:30:05,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-17 11:30:05,460 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-17 11:30:05,460 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:30:05,460 INFO L85 PathProgramCache]: Analyzing trace with hash 1985160698, now seen corresponding path program 1 times [2023-11-17 11:30:05,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:30:05,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588255335] [2023-11-17 11:30:05,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:30:05,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:30:05,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:30:05,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:30:05,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:30:05,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588255335] [2023-11-17 11:30:05,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588255335] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:30:05,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:30:05,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-17 11:30:05,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223480093] [2023-11-17 11:30:05,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:30:05,610 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-17 11:30:05,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:30:05,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-17 11:30:05,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-17 11:30:05,611 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 49 [2023-11-17 11:30:05,611 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 18 transitions, 76 flow. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:30:05,611 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:30:05,611 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 49 [2023-11-17 11:30:05,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:30:05,683 INFO L124 PetriNetUnfolderBase]: 28/82 cut-off events. [2023-11-17 11:30:05,683 INFO L125 PetriNetUnfolderBase]: For 42/42 co-relation queries the response was YES. [2023-11-17 11:30:05,684 INFO L83 FinitePrefix]: Finished finitePrefix Result has 263 conditions, 82 events. 28/82 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 238 event pairs, 8 based on Foata normal form. 12/94 useless extension candidates. Maximal degree in co-relation 249. Up to 36 conditions per place. [2023-11-17 11:30:05,684 INFO L140 encePairwiseOnDemand]: 44/49 looper letters, 14 selfloop transitions, 6 changer transitions 4/26 dead transitions. [2023-11-17 11:30:05,684 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 26 transitions, 151 flow [2023-11-17 11:30:05,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 11:30:05,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 11:30:05,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 84 transitions. [2023-11-17 11:30:05,686 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34285714285714286 [2023-11-17 11:30:05,686 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 84 transitions. [2023-11-17 11:30:05,686 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 84 transitions. [2023-11-17 11:30:05,686 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:30:05,686 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 84 transitions. [2023-11-17 11:30:05,687 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:30:05,687 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 49.0) internal successors, (294), 6 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:30:05,688 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 49.0) internal successors, (294), 6 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:30:05,688 INFO L175 Difference]: Start difference. First operand has 26 places, 18 transitions, 76 flow. Second operand 5 states and 84 transitions. [2023-11-17 11:30:05,688 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 26 transitions, 151 flow [2023-11-17 11:30:05,689 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 26 transitions, 142 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-11-17 11:30:05,689 INFO L231 Difference]: Finished difference. Result has 30 places, 18 transitions, 92 flow [2023-11-17 11:30:05,689 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=69, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=92, PETRI_PLACES=30, PETRI_TRANSITIONS=18} [2023-11-17 11:30:05,690 INFO L281 CegarLoopForPetriNet]: 23 programPoint places, 7 predicate places. [2023-11-17 11:30:05,690 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 18 transitions, 92 flow [2023-11-17 11:30:05,690 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:30:05,690 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:30:05,690 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:30:05,690 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-17 11:30:05,690 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-17 11:30:05,690 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:30:05,691 INFO L85 PathProgramCache]: Analyzing trace with hash 50482320, now seen corresponding path program 1 times [2023-11-17 11:30:05,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:30:05,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488273446] [2023-11-17 11:30:05,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:30:05,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:30:05,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-17 11:30:05,716 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-17 11:30:05,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-17 11:30:05,754 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-17 11:30:05,754 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-17 11:30:05,755 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2023-11-17 11:30:05,756 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2023-11-17 11:30:05,760 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2023-11-17 11:30:05,761 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2023-11-17 11:30:05,761 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2023-11-17 11:30:05,761 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-17 11:30:05,761 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2023-11-17 11:30:05,765 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-17 11:30:05,765 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-17 11:30:05,797 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-17 11:30:05,798 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-17 11:30:05,812 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.11 11:30:05 BasicIcfg [2023-11-17 11:30:05,812 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-17 11:30:05,813 INFO L158 Benchmark]: Toolchain (without parser) took 3309.11ms. Allocated memory was 185.6MB in the beginning and 294.6MB in the end (delta: 109.1MB). Free memory was 138.9MB in the beginning and 175.1MB in the end (delta: -36.2MB). Peak memory consumption was 75.4MB. Max. memory is 8.0GB. [2023-11-17 11:30:05,813 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 185.6MB. Free memory is still 143.5MB. There was no memory consumed. Max. memory is 8.0GB. [2023-11-17 11:30:05,813 INFO L158 Benchmark]: CACSL2BoogieTranslator took 467.38ms. Allocated memory is still 185.6MB. Free memory was 138.9MB in the beginning and 116.3MB in the end (delta: 22.6MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. [2023-11-17 11:30:05,813 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.17ms. Allocated memory is still 185.6MB. Free memory was 116.3MB in the beginning and 113.7MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-11-17 11:30:05,814 INFO L158 Benchmark]: Boogie Preprocessor took 18.22ms. Allocated memory is still 185.6MB. Free memory was 113.7MB in the beginning and 112.1MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-11-17 11:30:05,814 INFO L158 Benchmark]: RCFGBuilder took 603.12ms. Allocated memory is still 185.6MB. Free memory was 112.1MB in the beginning and 149.4MB in the end (delta: -37.3MB). Peak memory consumption was 36.6MB. Max. memory is 8.0GB. [2023-11-17 11:30:05,814 INFO L158 Benchmark]: TraceAbstraction took 2171.79ms. Allocated memory was 185.6MB in the beginning and 294.6MB in the end (delta: 109.1MB). Free memory was 148.8MB in the beginning and 175.1MB in the end (delta: -26.2MB). Peak memory consumption was 82.8MB. Max. memory is 8.0GB. [2023-11-17 11:30:05,815 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.12ms. Allocated memory is still 185.6MB. Free memory is still 143.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 467.38ms. Allocated memory is still 185.6MB. Free memory was 138.9MB in the beginning and 116.3MB in the end (delta: 22.6MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 44.17ms. Allocated memory is still 185.6MB. Free memory was 116.3MB in the beginning and 113.7MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 18.22ms. Allocated memory is still 185.6MB. Free memory was 113.7MB in the beginning and 112.1MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 603.12ms. Allocated memory is still 185.6MB. Free memory was 112.1MB in the beginning and 149.4MB in the end (delta: -37.3MB). Peak memory consumption was 36.6MB. Max. memory is 8.0GB. * TraceAbstraction took 2171.79ms. Allocated memory was 185.6MB in the beginning and 294.6MB in the end (delta: 109.1MB). Free memory was 148.8MB in the beginning and 175.1MB in the end (delta: -26.2MB). Peak memory consumption was 82.8MB. 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: 0.8s, 35 PlacesBefore, 23 PlacesAfterwards, 29 TransitionsBefore, 16 TransitionsAfterwards, 434 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 16 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 1 ChoiceCompositions, 18 TotalNumberOfCompositions, 870 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 431, independent: 373, independent conditional: 0, independent unconditional: 373, dependent: 58, dependent conditional: 0, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 277, independent: 255, independent conditional: 0, independent unconditional: 255, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 277, independent: 254, independent conditional: 0, independent unconditional: 254, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 23, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 127, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 124, dependent conditional: 0, dependent unconditional: 124, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 431, independent: 118, independent conditional: 0, independent unconditional: 118, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 277, unknown conditional: 0, unknown unconditional: 277] , Statistics on independence cache: Total cache size (in pairs): 39, Positive cache size: 28, Positive conditional cache size: 0, Positive unconditional cache size: 28, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L712] 0 _Bool main$tmp_guard0; [L713] 0 _Bool main$tmp_guard1; [L715] 0 int x = 0; [L716] 0 _Bool x$flush_delayed; [L717] 0 int x$mem_tmp; [L718] 0 _Bool x$r_buff0_thd0; [L719] 0 _Bool x$r_buff0_thd1; [L720] 0 _Bool x$r_buff0_thd2; [L721] 0 _Bool x$r_buff1_thd0; [L722] 0 _Bool x$r_buff1_thd1; [L723] 0 _Bool x$r_buff1_thd2; [L724] 0 _Bool x$read_delayed; [L725] 0 int *x$read_delayed_var; [L726] 0 int x$w_buff0; [L727] 0 _Bool x$w_buff0_used; [L728] 0 int x$w_buff1; [L729] 0 _Bool x$w_buff1_used; [L731] 0 int y = 0; [L732] 0 _Bool weak$$choice0; [L733] 0 _Bool weak$$choice2; [L803] 0 pthread_t t2561; [L804] FCALL, FORK 0 pthread_create(&t2561, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2561={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L805] 0 pthread_t t2562; [L806] FCALL, FORK 0 pthread_create(&t2562, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2561={5:0}, t2562={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L767] 2 x$w_buff1 = x$w_buff0 [L768] 2 x$w_buff0 = 1 [L769] 2 x$w_buff1_used = x$w_buff0_used [L770] 2 x$w_buff0_used = (_Bool)1 [L771] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L771] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L772] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L773] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L774] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L775] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L778] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L737] 1 y = 2 [L742] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L743] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L744] 1 x$flush_delayed = weak$$choice2 [L745] 1 x$mem_tmp = x [L746] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L747] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L748] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L749] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L750] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L751] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L752] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L753] 1 __unbuffered_p0_EAX = x [L754] 1 x = x$flush_delayed ? x$mem_tmp : x [L755] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L781] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L782] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L783] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L784] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L785] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L762] 1 return 0; [L788] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L790] 2 return 0; [L808] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2561={5:0}, t2562={3:0}, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L810] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L810] RET 0 assume_abort_if_not(main$tmp_guard0) [L812] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L813] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L814] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L815] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L816] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2561={5:0}, t2562={3:0}, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L819] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0) [L821] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 804]: 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: 806]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 49 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 2.0s, OverallIterations: 5, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 57 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 57 mSDsluCounter, 1 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 7 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 116 IncrementalHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7 mSolverCounterUnsat, 1 mSDtfsCounter, 116 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=92occurred in iteration=4, InterpolantAutomatonStates: 15, 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.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 44 NumberOfCodeBlocks, 44 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 26 ConstructedInterpolants, 0 QuantifiedInterpolants, 124 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-11-17 11:30:05,834 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...