/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/rfi003_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:27:36,191 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-17 11:27:36,259 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:27:36,283 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-17 11:27:36,284 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-17 11:27:36,284 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-17 11:27:36,284 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-17 11:27:36,285 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-17 11:27:36,285 INFO L153 SettingsManager]: * Use SBE=true [2023-11-17 11:27:36,288 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-17 11:27:36,288 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-17 11:27:36,288 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-17 11:27:36,288 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-17 11:27:36,289 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-17 11:27:36,289 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-17 11:27:36,289 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-17 11:27:36,290 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-17 11:27:36,290 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-17 11:27:36,290 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-17 11:27:36,290 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-17 11:27:36,290 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-17 11:27:36,291 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-17 11:27:36,291 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-17 11:27:36,291 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-17 11:27:36,291 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-17 11:27:36,292 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 11:27:36,292 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-17 11:27:36,292 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-17 11:27:36,292 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-17 11:27:36,293 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-17 11:27:36,293 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-17 11:27:36,293 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-17 11:27:36,293 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:27:36,496 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-17 11:27:36,516 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-17 11:27:36,518 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-17 11:27:36,519 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-17 11:27:36,519 INFO L274 PluginConnector]: CDTParser initialized [2023-11-17 11:27:36,520 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi003_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-11-17 11:27:37,489 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-17 11:27:37,705 INFO L384 CDTParser]: Found 1 translation units. [2023-11-17 11:27:37,706 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi003_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-11-17 11:27:37,716 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45b34d9f2/389fcb49131846029d71fc522f2ff31b/FLAG7f318ad29 [2023-11-17 11:27:37,727 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45b34d9f2/389fcb49131846029d71fc522f2ff31b [2023-11-17 11:27:37,729 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-17 11:27:37,730 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-17 11:27:37,731 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-17 11:27:37,731 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-17 11:27:37,734 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-17 11:27:37,735 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 11:27:37" (1/1) ... [2023-11-17 11:27:37,735 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f4f849b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:27:37, skipping insertion in model container [2023-11-17 11:27:37,735 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 11:27:37" (1/1) ... [2023-11-17 11:27:37,771 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-17 11:27:37,879 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/rfi003_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1038,1051] [2023-11-17 11:27:38,041 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 11:27:38,049 INFO L202 MainTranslator]: Completed pre-run [2023-11-17 11:27:38,058 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/rfi003_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1038,1051] [2023-11-17 11:27:38,088 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 11:27:38,109 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-17 11:27:38,109 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-17 11:27:38,114 INFO L206 MainTranslator]: Completed translation [2023-11-17 11:27:38,114 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:27:38 WrapperNode [2023-11-17 11:27:38,115 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-17 11:27:38,115 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-17 11:27:38,115 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-17 11:27:38,116 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-17 11:27:38,120 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:27:38" (1/1) ... [2023-11-17 11:27:38,139 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:27:38" (1/1) ... [2023-11-17 11:27:38,159 INFO L138 Inliner]: procedures = 175, calls = 47, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 119 [2023-11-17 11:27:38,159 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-17 11:27:38,159 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-17 11:27:38,160 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-17 11:27:38,160 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-17 11:27:38,166 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:27:38" (1/1) ... [2023-11-17 11:27:38,166 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:27:38" (1/1) ... [2023-11-17 11:27:38,168 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:27:38" (1/1) ... [2023-11-17 11:27:38,169 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:27:38" (1/1) ... [2023-11-17 11:27:38,173 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:27:38" (1/1) ... [2023-11-17 11:27:38,175 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:27:38" (1/1) ... [2023-11-17 11:27:38,179 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:27:38" (1/1) ... [2023-11-17 11:27:38,180 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:27:38" (1/1) ... [2023-11-17 11:27:38,182 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-17 11:27:38,183 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-17 11:27:38,183 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-17 11:27:38,183 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-17 11:27:38,183 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:27:38" (1/1) ... [2023-11-17 11:27:38,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 11:27:38,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 11:27:38,205 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:27:38,217 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:27:38,226 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-17 11:27:38,226 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-17 11:27:38,226 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-17 11:27:38,226 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-17 11:27:38,226 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-17 11:27:38,227 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-17 11:27:38,227 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-17 11:27:38,227 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-17 11:27:38,229 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-17 11:27:38,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-17 11:27:38,229 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-17 11:27:38,230 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-17 11:27:38,230 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-17 11:27:38,231 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:27:38,321 INFO L239 CfgBuilder]: Building ICFG [2023-11-17 11:27:38,322 INFO L265 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-17 11:27:38,530 INFO L280 CfgBuilder]: Performing block encoding [2023-11-17 11:27:38,678 INFO L302 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-17 11:27:38,679 INFO L307 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-17 11:27:38,680 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 11:27:38 BoogieIcfgContainer [2023-11-17 11:27:38,680 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-17 11:27:38,682 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-17 11:27:38,682 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-17 11:27:38,684 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-17 11:27:38,685 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 11:27:37" (1/3) ... [2023-11-17 11:27:38,685 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13182d62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 11:27:38, skipping insertion in model container [2023-11-17 11:27:38,685 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:27:38" (2/3) ... [2023-11-17 11:27:38,686 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13182d62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 11:27:38, skipping insertion in model container [2023-11-17 11:27:38,686 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 11:27:38" (3/3) ... [2023-11-17 11:27:38,687 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi003_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-11-17 11:27:38,699 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-17 11:27:38,699 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-17 11:27:38,699 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-17 11:27:38,760 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-17 11:27:38,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 33 transitions, 74 flow [2023-11-17 11:27:38,804 INFO L124 PetriNetUnfolderBase]: 1/31 cut-off events. [2023-11-17 11:27:38,804 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 11:27:38,807 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38 conditions, 31 events. 1/31 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 51 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 31. Up to 2 conditions per place. [2023-11-17 11:27:38,807 INFO L82 GeneralOperation]: Start removeDead. Operand has 39 places, 33 transitions, 74 flow [2023-11-17 11:27:38,809 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 37 places, 31 transitions, 68 flow [2023-11-17 11:27:38,811 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-11-17 11:27:38,825 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 31 transitions, 68 flow [2023-11-17 11:27:38,829 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 31 transitions, 68 flow [2023-11-17 11:27:38,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 31 transitions, 68 flow [2023-11-17 11:27:38,842 INFO L124 PetriNetUnfolderBase]: 1/31 cut-off events. [2023-11-17 11:27:38,842 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 11:27:38,843 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38 conditions, 31 events. 1/31 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 51 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 31. Up to 2 conditions per place. [2023-11-17 11:27:38,843 INFO L119 LiptonReduction]: Number of co-enabled transitions 506 [2023-11-17 11:27:39,728 INFO L134 LiptonReduction]: Checked pairs total: 1056 [2023-11-17 11:27:39,729 INFO L136 LiptonReduction]: Total number of compositions: 18 [2023-11-17 11:27:39,743 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-17 11:27:39,748 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;@4f814f91, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-17 11:27:39,748 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-11-17 11:27:39,751 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-17 11:27:39,751 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2023-11-17 11:27:39,751 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 11:27:39,752 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:27:39,752 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-17 11:27:39,752 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:27:39,755 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:27:39,756 INFO L85 PathProgramCache]: Analyzing trace with hash 301192996, now seen corresponding path program 1 times [2023-11-17 11:27:39,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:27:39,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864380344] [2023-11-17 11:27:39,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:27:39,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:27:39,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:27:40,112 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:27:40,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:27:40,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864380344] [2023-11-17 11:27:40,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864380344] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:27:40,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:27:40,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-17 11:27:40,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895811814] [2023-11-17 11:27:40,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:27:40,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 11:27:40,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:27:40,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 11:27:40,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 11:27:40,158 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 51 [2023-11-17 11:27:40,159 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 18 transitions, 42 flow. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 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:27:40,159 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:27:40,159 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 51 [2023-11-17 11:27:40,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:27:40,263 INFO L124 PetriNetUnfolderBase]: 111/260 cut-off events. [2023-11-17 11:27:40,263 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-17 11:27:40,265 INFO L83 FinitePrefix]: Finished finitePrefix Result has 474 conditions, 260 events. 111/260 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1102 event pairs, 18 based on Foata normal form. 0/244 useless extension candidates. Maximal degree in co-relation 464. Up to 154 conditions per place. [2023-11-17 11:27:40,267 INFO L140 encePairwiseOnDemand]: 48/51 looper letters, 17 selfloop transitions, 2 changer transitions 2/24 dead transitions. [2023-11-17 11:27:40,267 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 24 transitions, 96 flow [2023-11-17 11:27:40,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 11:27:40,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 11:27:40,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 73 transitions. [2023-11-17 11:27:40,276 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.477124183006536 [2023-11-17 11:27:40,277 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 73 transitions. [2023-11-17 11:27:40,277 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 73 transitions. [2023-11-17 11:27:40,278 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:27:40,280 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 73 transitions. [2023-11-17 11:27:40,281 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:27:40,283 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 51.0) internal successors, (204), 4 states have internal predecessors, (204), 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:27:40,283 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 51.0) internal successors, (204), 4 states have internal predecessors, (204), 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:27:40,285 INFO L175 Difference]: Start difference. First operand has 25 places, 18 transitions, 42 flow. Second operand 3 states and 73 transitions. [2023-11-17 11:27:40,285 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 24 transitions, 96 flow [2023-11-17 11:27:40,287 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 24 transitions, 94 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-17 11:27:40,288 INFO L231 Difference]: Finished difference. Result has 24 places, 16 transitions, 40 flow [2023-11-17 11:27:40,289 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, 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 11:27:40,292 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, -1 predicate places. [2023-11-17 11:27:40,292 INFO L495 AbstractCegarLoop]: Abstraction has has 24 places, 16 transitions, 40 flow [2023-11-17 11:27:40,292 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 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:27:40,292 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:27:40,292 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:27:40,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-17 11:27:40,293 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:27:40,298 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:27:40,298 INFO L85 PathProgramCache]: Analyzing trace with hash 1683674163, now seen corresponding path program 1 times [2023-11-17 11:27:40,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:27:40,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748944072] [2023-11-17 11:27:40,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:27:40,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:27:40,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:27:40,470 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:27:40,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:27:40,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748944072] [2023-11-17 11:27:40,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748944072] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:27:40,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:27:40,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-17 11:27:40,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446840540] [2023-11-17 11:27:40,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:27:40,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 11:27:40,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:27:40,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 11:27:40,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 11:27:40,473 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 51 [2023-11-17 11:27:40,474 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 16 transitions, 40 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:27:40,474 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:27:40,474 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 51 [2023-11-17 11:27:40,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:27:40,583 INFO L124 PetriNetUnfolderBase]: 204/378 cut-off events. [2023-11-17 11:27:40,583 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2023-11-17 11:27:40,585 INFO L83 FinitePrefix]: Finished finitePrefix Result has 785 conditions, 378 events. 204/378 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1572 event pairs, 56 based on Foata normal form. 22/400 useless extension candidates. Maximal degree in co-relation 775. Up to 209 conditions per place. [2023-11-17 11:27:40,588 INFO L140 encePairwiseOnDemand]: 44/51 looper letters, 22 selfloop transitions, 6 changer transitions 0/28 dead transitions. [2023-11-17 11:27:40,588 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 28 transitions, 124 flow [2023-11-17 11:27:40,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 11:27:40,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 11:27:40,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 65 transitions. [2023-11-17 11:27:40,592 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42483660130718953 [2023-11-17 11:27:40,592 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 65 transitions. [2023-11-17 11:27:40,592 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 65 transitions. [2023-11-17 11:27:40,592 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:27:40,593 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 65 transitions. [2023-11-17 11:27:40,595 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:27:40,597 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 51.0) internal successors, (204), 4 states have internal predecessors, (204), 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:27:40,597 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 51.0) internal successors, (204), 4 states have internal predecessors, (204), 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:27:40,597 INFO L175 Difference]: Start difference. First operand has 24 places, 16 transitions, 40 flow. Second operand 3 states and 65 transitions. [2023-11-17 11:27:40,597 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 28 transitions, 124 flow [2023-11-17 11:27:40,600 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 28 transitions, 118 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-17 11:27:40,601 INFO L231 Difference]: Finished difference. Result has 25 places, 20 transitions, 78 flow [2023-11-17 11:27:40,601 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, 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=10, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=25, PETRI_TRANSITIONS=20} [2023-11-17 11:27:40,602 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, 0 predicate places. [2023-11-17 11:27:40,602 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 20 transitions, 78 flow [2023-11-17 11:27:40,602 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:27:40,603 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:27:40,603 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:27:40,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-17 11:27:40,603 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:27:40,604 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:27:40,605 INFO L85 PathProgramCache]: Analyzing trace with hash 654291576, now seen corresponding path program 1 times [2023-11-17 11:27:40,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:27:40,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283264594] [2023-11-17 11:27:40,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:27:40,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:27:40,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:27:40,716 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:27:40,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:27:40,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283264594] [2023-11-17 11:27:40,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283264594] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:27:40,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:27:40,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 11:27:40,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880430881] [2023-11-17 11:27:40,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:27:40,720 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 11:27:40,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:27:40,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 11:27:40,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-17 11:27:40,721 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 51 [2023-11-17 11:27:40,721 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 20 transitions, 78 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:27:40,721 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:27:40,721 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 51 [2023-11-17 11:27:40,721 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:27:40,783 INFO L124 PetriNetUnfolderBase]: 177/324 cut-off events. [2023-11-17 11:27:40,783 INFO L125 PetriNetUnfolderBase]: For 122/122 co-relation queries the response was YES. [2023-11-17 11:27:40,784 INFO L83 FinitePrefix]: Finished finitePrefix Result has 856 conditions, 324 events. 177/324 cut-off events. For 122/122 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1166 event pairs, 66 based on Foata normal form. 12/336 useless extension candidates. Maximal degree in co-relation 844. Up to 153 conditions per place. [2023-11-17 11:27:40,786 INFO L140 encePairwiseOnDemand]: 46/51 looper letters, 22 selfloop transitions, 5 changer transitions 4/31 dead transitions. [2023-11-17 11:27:40,786 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 31 transitions, 172 flow [2023-11-17 11:27:40,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 11:27:40,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-17 11:27:40,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 76 transitions. [2023-11-17 11:27:40,787 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37254901960784315 [2023-11-17 11:27:40,787 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 76 transitions. [2023-11-17 11:27:40,787 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 76 transitions. [2023-11-17 11:27:40,788 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:27:40,788 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 76 transitions. [2023-11-17 11:27:40,788 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 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:27:40,789 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 51.0) internal successors, (255), 5 states have internal predecessors, (255), 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:27:40,789 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 51.0) internal successors, (255), 5 states have internal predecessors, (255), 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:27:40,789 INFO L175 Difference]: Start difference. First operand has 25 places, 20 transitions, 78 flow. Second operand 4 states and 76 transitions. [2023-11-17 11:27:40,789 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 31 transitions, 172 flow [2023-11-17 11:27:40,792 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 31 transitions, 156 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-17 11:27:40,792 INFO L231 Difference]: Finished difference. Result has 28 places, 21 transitions, 91 flow [2023-11-17 11:27:40,792 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=91, PETRI_PLACES=28, PETRI_TRANSITIONS=21} [2023-11-17 11:27:40,793 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, 3 predicate places. [2023-11-17 11:27:40,793 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 21 transitions, 91 flow [2023-11-17 11:27:40,793 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:27:40,794 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:27:40,794 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:27:40,794 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-17 11:27:40,794 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:27:40,794 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:27:40,794 INFO L85 PathProgramCache]: Analyzing trace with hash -968110067, now seen corresponding path program 1 times [2023-11-17 11:27:40,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:27:40,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135650123] [2023-11-17 11:27:40,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:27:40,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:27:40,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:27:40,925 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:27:40,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:27:40,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135650123] [2023-11-17 11:27:40,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135650123] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:27:40,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:27:40,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 11:27:40,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685791128] [2023-11-17 11:27:40,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:27:40,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 11:27:40,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:27:40,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 11:27:40,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-17 11:27:40,929 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 51 [2023-11-17 11:27:40,929 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 21 transitions, 91 flow. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:27:40,929 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:27:40,929 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 51 [2023-11-17 11:27:40,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:27:41,005 INFO L124 PetriNetUnfolderBase]: 82/204 cut-off events. [2023-11-17 11:27:41,005 INFO L125 PetriNetUnfolderBase]: For 95/96 co-relation queries the response was YES. [2023-11-17 11:27:41,006 INFO L83 FinitePrefix]: Finished finitePrefix Result has 543 conditions, 204 events. 82/204 cut-off events. For 95/96 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 826 event pairs, 28 based on Foata normal form. 32/236 useless extension candidates. Maximal degree in co-relation 529. Up to 73 conditions per place. [2023-11-17 11:27:41,006 INFO L140 encePairwiseOnDemand]: 46/51 looper letters, 24 selfloop transitions, 4 changer transitions 4/38 dead transitions. [2023-11-17 11:27:41,006 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 38 transitions, 215 flow [2023-11-17 11:27:41,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 11:27:41,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-17 11:27:41,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 86 transitions. [2023-11-17 11:27:41,009 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4215686274509804 [2023-11-17 11:27:41,009 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 86 transitions. [2023-11-17 11:27:41,009 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 86 transitions. [2023-11-17 11:27:41,009 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:27:41,009 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 86 transitions. [2023-11-17 11:27:41,010 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 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:27:41,011 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 51.0) internal successors, (255), 5 states have internal predecessors, (255), 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:27:41,011 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 51.0) internal successors, (255), 5 states have internal predecessors, (255), 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:27:41,011 INFO L175 Difference]: Start difference. First operand has 28 places, 21 transitions, 91 flow. Second operand 4 states and 86 transitions. [2023-11-17 11:27:41,011 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 38 transitions, 215 flow [2023-11-17 11:27:41,013 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 38 transitions, 205 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-17 11:27:41,014 INFO L231 Difference]: Finished difference. Result has 31 places, 24 transitions, 115 flow [2023-11-17 11:27:41,014 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=85, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=115, PETRI_PLACES=31, PETRI_TRANSITIONS=24} [2023-11-17 11:27:41,015 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, 6 predicate places. [2023-11-17 11:27:41,015 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 24 transitions, 115 flow [2023-11-17 11:27:41,016 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:27:41,016 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:27:41,016 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:27:41,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-17 11:27:41,016 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:27:41,016 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:27:41,016 INFO L85 PathProgramCache]: Analyzing trace with hash -2129773671, now seen corresponding path program 1 times [2023-11-17 11:27:41,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:27:41,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291527833] [2023-11-17 11:27:41,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:27:41,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:27:41,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:27:41,121 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:27:41,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:27:41,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291527833] [2023-11-17 11:27:41,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291527833] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:27:41,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:27:41,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 11:27:41,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451058955] [2023-11-17 11:27:41,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:27:41,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 11:27:41,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:27:41,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 11:27:41,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-17 11:27:41,124 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 51 [2023-11-17 11:27:41,124 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 24 transitions, 115 flow. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:27:41,124 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:27:41,124 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 51 [2023-11-17 11:27:41,124 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:27:41,210 INFO L124 PetriNetUnfolderBase]: 159/369 cut-off events. [2023-11-17 11:27:41,212 INFO L125 PetriNetUnfolderBase]: For 303/303 co-relation queries the response was YES. [2023-11-17 11:27:41,213 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1279 conditions, 369 events. 159/369 cut-off events. For 303/303 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1830 event pairs, 47 based on Foata normal form. 4/373 useless extension candidates. Maximal degree in co-relation 1263. Up to 141 conditions per place. [2023-11-17 11:27:41,214 INFO L140 encePairwiseOnDemand]: 47/51 looper letters, 28 selfloop transitions, 4 changer transitions 14/46 dead transitions. [2023-11-17 11:27:41,215 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 46 transitions, 308 flow [2023-11-17 11:27:41,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 11:27:41,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-17 11:27:41,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 84 transitions. [2023-11-17 11:27:41,217 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4117647058823529 [2023-11-17 11:27:41,217 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 84 transitions. [2023-11-17 11:27:41,217 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 84 transitions. [2023-11-17 11:27:41,217 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:27:41,217 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 84 transitions. [2023-11-17 11:27:41,217 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 21.0) internal successors, (84), 4 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:27:41,218 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 51.0) internal successors, (255), 5 states have internal predecessors, (255), 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:27:41,219 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 51.0) internal successors, (255), 5 states have internal predecessors, (255), 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:27:41,219 INFO L175 Difference]: Start difference. First operand has 31 places, 24 transitions, 115 flow. Second operand 4 states and 84 transitions. [2023-11-17 11:27:41,219 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 46 transitions, 308 flow [2023-11-17 11:27:41,221 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 46 transitions, 304 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-17 11:27:41,222 INFO L231 Difference]: Finished difference. Result has 36 places, 22 transitions, 126 flow [2023-11-17 11:27:41,222 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=113, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=126, PETRI_PLACES=36, PETRI_TRANSITIONS=22} [2023-11-17 11:27:41,223 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, 11 predicate places. [2023-11-17 11:27:41,224 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 22 transitions, 126 flow [2023-11-17 11:27:41,224 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:27:41,224 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:27:41,224 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:27:41,224 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-17 11:27:41,224 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-17 11:27:41,224 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:27:41,224 INFO L85 PathProgramCache]: Analyzing trace with hash -2127989733, now seen corresponding path program 2 times [2023-11-17 11:27:41,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:27:41,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973734365] [2023-11-17 11:27:41,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:27:41,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:27:41,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:27:41,355 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:27:41,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:27:41,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973734365] [2023-11-17 11:27:41,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973734365] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:27:41,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:27:41,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-17 11:27:41,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314890897] [2023-11-17 11:27:41,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:27:41,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-17 11:27:41,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:27:41,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-17 11:27:41,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-17 11:27:41,361 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 51 [2023-11-17 11:27:41,361 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 22 transitions, 126 flow. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:27:41,361 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:27:41,361 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 51 [2023-11-17 11:27:41,361 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:27:41,414 INFO L124 PetriNetUnfolderBase]: 32/112 cut-off events. [2023-11-17 11:27:41,414 INFO L125 PetriNetUnfolderBase]: For 166/166 co-relation queries the response was YES. [2023-11-17 11:27:41,414 INFO L83 FinitePrefix]: Finished finitePrefix Result has 395 conditions, 112 events. 32/112 cut-off events. For 166/166 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 395 event pairs, 9 based on Foata normal form. 18/129 useless extension candidates. Maximal degree in co-relation 379. Up to 48 conditions per place. [2023-11-17 11:27:41,415 INFO L140 encePairwiseOnDemand]: 46/51 looper letters, 16 selfloop transitions, 6 changer transitions 4/30 dead transitions. [2023-11-17 11:27:41,415 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 30 transitions, 212 flow [2023-11-17 11:27:41,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 11:27:41,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 11:27:41,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 94 transitions. [2023-11-17 11:27:41,416 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3686274509803922 [2023-11-17 11:27:41,416 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 94 transitions. [2023-11-17 11:27:41,416 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 94 transitions. [2023-11-17 11:27:41,416 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:27:41,416 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 94 transitions. [2023-11-17 11:27:41,417 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:27:41,418 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 51.0) internal successors, (306), 6 states have internal predecessors, (306), 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:27:41,418 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 51.0) internal successors, (306), 6 states have internal predecessors, (306), 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:27:41,418 INFO L175 Difference]: Start difference. First operand has 36 places, 22 transitions, 126 flow. Second operand 5 states and 94 transitions. [2023-11-17 11:27:41,418 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 30 transitions, 212 flow [2023-11-17 11:27:41,419 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 30 transitions, 186 flow, removed 5 selfloop flow, removed 5 redundant places. [2023-11-17 11:27:41,420 INFO L231 Difference]: Finished difference. Result has 36 places, 22 transitions, 126 flow [2023-11-17 11:27:41,420 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=103, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=126, PETRI_PLACES=36, PETRI_TRANSITIONS=22} [2023-11-17 11:27:41,421 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, 11 predicate places. [2023-11-17 11:27:41,421 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 22 transitions, 126 flow [2023-11-17 11:27:41,422 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:27:41,422 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:27:41,422 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:27:41,422 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-17 11:27:41,423 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-17 11:27:41,423 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:27:41,423 INFO L85 PathProgramCache]: Analyzing trace with hash 1745147870, now seen corresponding path program 1 times [2023-11-17 11:27:41,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:27:41,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218949433] [2023-11-17 11:27:41,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:27:41,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:27:41,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:27:41,745 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:27:41,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:27:41,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218949433] [2023-11-17 11:27:41,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218949433] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:27:41,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:27:41,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-17 11:27:41,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758692714] [2023-11-17 11:27:41,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:27:41,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-17 11:27:41,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:27:41,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-17 11:27:41,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-17 11:27:41,746 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 51 [2023-11-17 11:27:41,746 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 22 transitions, 126 flow. Second operand has 6 states, 6 states have (on average 18.166666666666668) internal successors, (109), 6 states have internal predecessors, (109), 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:27:41,746 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:27:41,747 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 51 [2023-11-17 11:27:41,747 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:27:41,849 INFO L124 PetriNetUnfolderBase]: 22/99 cut-off events. [2023-11-17 11:27:41,849 INFO L125 PetriNetUnfolderBase]: For 177/177 co-relation queries the response was YES. [2023-11-17 11:27:41,850 INFO L83 FinitePrefix]: Finished finitePrefix Result has 391 conditions, 99 events. 22/99 cut-off events. For 177/177 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 343 event pairs, 6 based on Foata normal form. 2/101 useless extension candidates. Maximal degree in co-relation 373. Up to 37 conditions per place. [2023-11-17 11:27:41,850 INFO L140 encePairwiseOnDemand]: 45/51 looper letters, 16 selfloop transitions, 4 changer transitions 11/35 dead transitions. [2023-11-17 11:27:41,850 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 35 transitions, 280 flow [2023-11-17 11:27:41,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-17 11:27:41,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-17 11:27:41,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 136 transitions. [2023-11-17 11:27:41,851 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38095238095238093 [2023-11-17 11:27:41,851 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 136 transitions. [2023-11-17 11:27:41,851 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 136 transitions. [2023-11-17 11:27:41,851 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:27:41,851 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 136 transitions. [2023-11-17 11:27:41,852 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 19.428571428571427) internal successors, (136), 7 states have internal predecessors, (136), 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:27:41,852 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 51.0) internal successors, (408), 8 states have internal predecessors, (408), 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:27:41,853 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 51.0) internal successors, (408), 8 states have internal predecessors, (408), 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:27:41,853 INFO L175 Difference]: Start difference. First operand has 36 places, 22 transitions, 126 flow. Second operand 7 states and 136 transitions. [2023-11-17 11:27:41,853 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 35 transitions, 280 flow [2023-11-17 11:27:41,854 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 35 transitions, 216 flow, removed 10 selfloop flow, removed 7 redundant places. [2023-11-17 11:27:41,855 INFO L231 Difference]: Finished difference. Result has 37 places, 22 transitions, 114 flow [2023-11-17 11:27:41,855 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=114, PETRI_PLACES=37, PETRI_TRANSITIONS=22} [2023-11-17 11:27:41,855 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, 12 predicate places. [2023-11-17 11:27:41,856 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 22 transitions, 114 flow [2023-11-17 11:27:41,856 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.166666666666668) internal successors, (109), 6 states have internal predecessors, (109), 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:27:41,856 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:27:41,856 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:27:41,856 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-17 11:27:41,856 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-17 11:27:41,857 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:27:41,857 INFO L85 PathProgramCache]: Analyzing trace with hash -608532206, now seen corresponding path program 2 times [2023-11-17 11:27:41,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:27:41,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850987389] [2023-11-17 11:27:41,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:27:41,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:27:41,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-17 11:27:41,885 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-17 11:27:41,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-17 11:27:41,934 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-17 11:27:41,934 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-17 11:27:41,935 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2023-11-17 11:27:41,936 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2023-11-17 11:27:41,936 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2023-11-17 11:27:41,936 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2023-11-17 11:27:41,936 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2023-11-17 11:27:41,936 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-17 11:27:41,937 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1] [2023-11-17 11:27:41,940 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-17 11:27:41,940 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-17 11:27:41,974 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-17 11:27:41,975 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-17 11:27:41,990 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.11 11:27:41 BasicIcfg [2023-11-17 11:27:41,990 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-17 11:27:41,991 INFO L158 Benchmark]: Toolchain (without parser) took 4260.48ms. Allocated memory was 285.2MB in the beginning and 368.1MB in the end (delta: 82.8MB). Free memory was 232.7MB in the beginning and 257.9MB in the end (delta: -25.1MB). Peak memory consumption was 59.3MB. Max. memory is 8.0GB. [2023-11-17 11:27:41,991 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 181.4MB. Free memory is still 131.1MB. There was no memory consumed. Max. memory is 8.0GB. [2023-11-17 11:27:41,991 INFO L158 Benchmark]: CACSL2BoogieTranslator took 383.78ms. Allocated memory is still 285.2MB. Free memory was 232.7MB in the beginning and 210.2MB in the end (delta: 22.6MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. [2023-11-17 11:27:41,991 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.68ms. Allocated memory is still 285.2MB. Free memory was 210.2MB in the beginning and 207.6MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-11-17 11:27:41,991 INFO L158 Benchmark]: Boogie Preprocessor took 22.78ms. Allocated memory is still 285.2MB. Free memory was 207.6MB in the beginning and 206.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-11-17 11:27:41,992 INFO L158 Benchmark]: RCFGBuilder took 497.36ms. Allocated memory is still 285.2MB. Free memory was 206.0MB in the beginning and 166.2MB in the end (delta: 39.8MB). Peak memory consumption was 39.8MB. Max. memory is 8.0GB. [2023-11-17 11:27:41,992 INFO L158 Benchmark]: TraceAbstraction took 3308.11ms. Allocated memory was 285.2MB in the beginning and 368.1MB in the end (delta: 82.8MB). Free memory was 165.6MB in the beginning and 257.9MB in the end (delta: -92.2MB). There was no memory consumed. Max. memory is 8.0GB. [2023-11-17 11:27:41,999 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.10ms. Allocated memory is still 181.4MB. Free memory is still 131.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 383.78ms. Allocated memory is still 285.2MB. Free memory was 232.7MB in the beginning and 210.2MB in the end (delta: 22.6MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 43.68ms. Allocated memory is still 285.2MB. Free memory was 210.2MB in the beginning and 207.6MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 22.78ms. Allocated memory is still 285.2MB. Free memory was 207.6MB in the beginning and 206.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 497.36ms. Allocated memory is still 285.2MB. Free memory was 206.0MB in the beginning and 166.2MB in the end (delta: 39.8MB). Peak memory consumption was 39.8MB. Max. memory is 8.0GB. * TraceAbstraction took 3308.11ms. Allocated memory was 285.2MB in the beginning and 368.1MB in the end (delta: 82.8MB). Free memory was 165.6MB in the beginning and 257.9MB in the end (delta: -92.2MB). There was no memory consumed. 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.9s, 37 PlacesBefore, 25 PlacesAfterwards, 31 TransitionsBefore, 18 TransitionsAfterwards, 506 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 16 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 1 ChoiceCompositions, 18 TotalNumberOfCompositions, 1056 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 583, independent: 517, independent conditional: 0, independent unconditional: 517, dependent: 66, dependent conditional: 0, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 370, independent: 331, independent conditional: 0, independent unconditional: 331, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 370, independent: 320, independent conditional: 0, independent unconditional: 320, dependent: 50, dependent conditional: 0, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 50, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 136, independent: 20, independent conditional: 0, independent unconditional: 20, dependent: 116, dependent conditional: 0, dependent unconditional: 116, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 583, independent: 186, independent conditional: 0, independent unconditional: 186, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 370, unknown conditional: 0, unknown unconditional: 370] , Statistics on independence cache: Total cache size (in pairs): 61, Positive cache size: 47, Positive conditional cache size: 0, Positive unconditional cache size: 47, Negative cache size: 14, Negative conditional cache size: 0, Negative unconditional cache size: 14, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L715] 0 int __unbuffered_p1_EBX = 0; [L716] 0 _Bool main$tmp_guard0; [L717] 0 _Bool main$tmp_guard1; [L719] 0 int x = 0; [L720] 0 _Bool x$flush_delayed; [L721] 0 int x$mem_tmp; [L722] 0 _Bool x$r_buff0_thd0; [L723] 0 _Bool x$r_buff0_thd1; [L724] 0 _Bool x$r_buff0_thd2; [L725] 0 _Bool x$r_buff1_thd0; [L726] 0 _Bool x$r_buff1_thd1; [L727] 0 _Bool x$r_buff1_thd2; [L728] 0 _Bool x$read_delayed; [L729] 0 int *x$read_delayed_var; [L730] 0 int x$w_buff0; [L731] 0 _Bool x$w_buff0_used; [L732] 0 int x$w_buff1; [L733] 0 _Bool x$w_buff1_used; [L735] 0 int y = 0; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L813] 0 pthread_t t1633; [L814] FCALL, FORK 0 pthread_create(&t1633, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1633={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] [L815] 0 pthread_t t1634; [L816] FCALL, FORK 0 pthread_create(&t1634, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1633={5:0}, t1634={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] [L771] 2 x$w_buff1 = x$w_buff0 [L772] 2 x$w_buff0 = 1 [L773] 2 x$w_buff1_used = x$w_buff0_used [L774] 2 x$w_buff0_used = (_Bool)1 [L775] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L775] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L776] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L777] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L778] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L779] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L782] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L785] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$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] [L788] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, 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] [L741] 1 y = 2 [L746] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L747] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L748] 1 x$flush_delayed = weak$$choice2 [L749] 1 x$mem_tmp = x [L750] 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) [L751] 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)) [L752] 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)) [L753] 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)) [L754] 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)) [L755] 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)) [L756] 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)) [L757] 1 __unbuffered_p0_EAX = x [L758] 1 x = x$flush_delayed ? x$mem_tmp : x [L759] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, 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] [L764] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L766] 1 return 0; [L791] 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) [L792] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L793] 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 [L794] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L795] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0: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=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L798] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L800] 2 return 0; [L818] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1633={5:0}, t1634={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] [L820] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L820] RET 0 assume_abort_if_not(main$tmp_guard0) [L822] 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) [L823] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L824] 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 [L825] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L826] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1633={5:0}, t1634={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] [L829] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 1) [L831] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, 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: 816]: 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: 814]: 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, 53 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: 3.2s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 1.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 93 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 93 mSDsluCounter, 11 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3 mSDsCounter, 16 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 285 IncrementalHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 16 mSolverCounterUnsat, 8 mSDtfsCounter, 285 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=126occurred in iteration=5, InterpolantAutomatonStates: 30, 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.0s InterpolantComputationTime, 92 NumberOfCodeBlocks, 92 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 69 ConstructedInterpolants, 0 QuantifiedInterpolants, 375 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 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:27:42,015 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...