/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe006_power.opt-thin000_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.dk.datarace-free-lbe-02cf818-m [2023-11-17 15:17:48,298 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-17 15:17:48,368 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf [2023-11-17 15:17:48,392 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-17 15:17:48,393 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-17 15:17:48,393 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-17 15:17:48,394 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-17 15:17:48,394 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-17 15:17:48,394 INFO L153 SettingsManager]: * Use SBE=true [2023-11-17 15:17:48,397 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-17 15:17:48,398 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-17 15:17:48,398 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-17 15:17:48,398 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-17 15:17:48,399 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-17 15:17:48,399 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-17 15:17:48,400 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-17 15:17:48,400 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-17 15:17:48,400 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-17 15:17:48,400 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-17 15:17:48,400 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-17 15:17:48,400 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-17 15:17:48,401 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-17 15:17:48,401 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-17 15:17:48,401 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-17 15:17:48,402 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-17 15:17:48,402 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 15:17:48,402 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-17 15:17:48,402 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-17 15:17:48,402 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-17 15:17:48,402 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-17 15:17:48,403 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-17 15:17:48,403 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-17 15:17:48,403 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2023-11-17 15:17:48,601 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-17 15:17:48,615 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-17 15:17:48,617 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-17 15:17:48,618 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-17 15:17:48,618 INFO L274 PluginConnector]: CDTParser initialized [2023-11-17 15:17:48,619 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe006_power.opt-thin000_power.opt.i [2023-11-17 15:17:49,776 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-17 15:17:49,987 INFO L384 CDTParser]: Found 1 translation units. [2023-11-17 15:17:49,988 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe006_power.opt-thin000_power.opt.i [2023-11-17 15:17:50,000 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/242b445bd/f030d7413914496c946365a7f84482c3/FLAG7d5f3c1d3 [2023-11-17 15:17:50,013 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/242b445bd/f030d7413914496c946365a7f84482c3 [2023-11-17 15:17:50,015 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-17 15:17:50,016 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-17 15:17:50,017 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-17 15:17:50,017 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-17 15:17:50,020 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-17 15:17:50,020 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 03:17:50" (1/1) ... [2023-11-17 15:17:50,021 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@129bb131 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:17:50, skipping insertion in model container [2023-11-17 15:17:50,021 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 03:17:50" (1/1) ... [2023-11-17 15:17:50,051 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-17 15:17:50,160 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/safe006_power.opt-thin000_power.opt.i[969,982] [2023-11-17 15:17:50,342 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 15:17:50,352 INFO L202 MainTranslator]: Completed pre-run [2023-11-17 15:17:50,361 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/safe006_power.opt-thin000_power.opt.i[969,982] [2023-11-17 15:17:50,418 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 15:17:50,445 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-17 15:17:50,445 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-17 15:17:50,450 INFO L206 MainTranslator]: Completed translation [2023-11-17 15:17:50,451 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:17:50 WrapperNode [2023-11-17 15:17:50,451 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-17 15:17:50,452 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-17 15:17:50,452 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-17 15:17:50,452 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-17 15:17:50,457 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:17:50" (1/1) ... [2023-11-17 15:17:50,481 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:17:50" (1/1) ... [2023-11-17 15:17:50,511 INFO L138 Inliner]: procedures = 175, calls = 58, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 163 [2023-11-17 15:17:50,511 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-17 15:17:50,512 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-17 15:17:50,512 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-17 15:17:50,512 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-17 15:17:50,518 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:17:50" (1/1) ... [2023-11-17 15:17:50,518 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:17:50" (1/1) ... [2023-11-17 15:17:50,532 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:17:50" (1/1) ... [2023-11-17 15:17:50,533 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:17:50" (1/1) ... [2023-11-17 15:17:50,550 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:17:50" (1/1) ... [2023-11-17 15:17:50,551 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:17:50" (1/1) ... [2023-11-17 15:17:50,556 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:17:50" (1/1) ... [2023-11-17 15:17:50,558 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:17:50" (1/1) ... [2023-11-17 15:17:50,560 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-17 15:17:50,561 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-17 15:17:50,561 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-17 15:17:50,561 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-17 15:17:50,561 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:17:50" (1/1) ... [2023-11-17 15:17:50,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 15:17:50,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 15:17:50,607 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-17 15:17:50,634 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-17 15:17:50,634 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-17 15:17:50,634 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-17 15:17:50,634 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-17 15:17:50,635 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-17 15:17:50,635 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-17 15:17:50,635 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-17 15:17:50,636 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-17 15:17:50,636 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-17 15:17:50,636 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-17 15:17:50,636 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-17 15:17:50,636 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-17 15:17:50,636 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-17 15:17:50,636 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-17 15:17:50,625 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-17 15:17:50,637 WARN L211 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-17 15:17:50,787 INFO L239 CfgBuilder]: Building ICFG [2023-11-17 15:17:50,788 INFO L265 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-17 15:17:51,139 INFO L280 CfgBuilder]: Performing block encoding [2023-11-17 15:17:51,568 INFO L302 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-17 15:17:51,568 INFO L307 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-17 15:17:51,570 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 03:17:51 BoogieIcfgContainer [2023-11-17 15:17:51,570 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-17 15:17:51,572 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-17 15:17:51,572 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-17 15:17:51,575 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-17 15:17:51,575 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 03:17:50" (1/3) ... [2023-11-17 15:17:51,576 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f75a22c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 03:17:51, skipping insertion in model container [2023-11-17 15:17:51,576 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:17:50" (2/3) ... [2023-11-17 15:17:51,576 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f75a22c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 03:17:51, skipping insertion in model container [2023-11-17 15:17:51,576 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 03:17:51" (3/3) ... [2023-11-17 15:17:51,577 INFO L112 eAbstractionObserver]: Analyzing ICFG safe006_power.opt-thin000_power.opt.i [2023-11-17 15:17:51,602 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-17 15:17:51,602 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-17 15:17:51,617 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-17 15:17:51,714 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-17 15:17:51,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 113 places, 109 transitions, 226 flow [2023-11-17 15:17:51,780 INFO L124 PetriNetUnfolderBase]: 3/107 cut-off events. [2023-11-17 15:17:51,780 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 15:17:51,786 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114 conditions, 107 events. 3/107 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 43 event pairs, 0 based on Foata normal form. 0/102 useless extension candidates. Maximal degree in co-relation 70. Up to 2 conditions per place. [2023-11-17 15:17:51,788 INFO L82 GeneralOperation]: Start removeDead. Operand has 113 places, 109 transitions, 226 flow [2023-11-17 15:17:51,792 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 111 places, 107 transitions, 220 flow [2023-11-17 15:17:51,796 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-11-17 15:17:51,819 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 111 places, 107 transitions, 220 flow [2023-11-17 15:17:51,825 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 111 places, 107 transitions, 220 flow [2023-11-17 15:17:51,826 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 111 places, 107 transitions, 220 flow [2023-11-17 15:17:51,851 INFO L124 PetriNetUnfolderBase]: 3/107 cut-off events. [2023-11-17 15:17:51,852 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 15:17:51,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114 conditions, 107 events. 3/107 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 43 event pairs, 0 based on Foata normal form. 0/102 useless extension candidates. Maximal degree in co-relation 70. Up to 2 conditions per place. [2023-11-17 15:17:51,855 INFO L119 LiptonReduction]: Number of co-enabled transitions 1244 [2023-11-17 15:17:58,413 INFO L134 LiptonReduction]: Checked pairs total: 2829 [2023-11-17 15:17:58,414 INFO L136 LiptonReduction]: Total number of compositions: 103 [2023-11-17 15:17:58,428 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-17 15:17:58,432 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;@63b455b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-17 15:17:58,433 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-11-17 15:17:58,435 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-17 15:17:58,435 INFO L124 PetriNetUnfolderBase]: 0/7 cut-off events. [2023-11-17 15:17:58,435 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 15:17:58,435 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:17:58,435 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-11-17 15:17:58,435 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-17 15:17:58,440 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:17:58,440 INFO L85 PathProgramCache]: Analyzing trace with hash 22955914, now seen corresponding path program 1 times [2023-11-17 15:17:58,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:17:58,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917704478] [2023-11-17 15:17:58,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:17:58,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:17:58,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:17:58,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:17:58,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:17:58,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917704478] [2023-11-17 15:17:58,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917704478] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:17:58,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:17:58,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-17 15:17:58,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522190139] [2023-11-17 15:17:58,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:17:58,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 15:17:58,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:17:58,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 15:17:58,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 15:17:58,727 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 212 [2023-11-17 15:17:58,729 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 19 transitions, 44 flow. Second operand has 3 states, 3 states have (on average 96.33333333333333) internal successors, (289), 3 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:17:58,729 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:17:58,729 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 212 [2023-11-17 15:17:58,730 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:17:58,850 INFO L124 PetriNetUnfolderBase]: 144/259 cut-off events. [2023-11-17 15:17:58,850 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-11-17 15:17:58,851 INFO L83 FinitePrefix]: Finished finitePrefix Result has 530 conditions, 259 events. 144/259 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1018 event pairs, 45 based on Foata normal form. 0/237 useless extension candidates. Maximal degree in co-relation 520. Up to 166 conditions per place. [2023-11-17 15:17:58,853 INFO L140 encePairwiseOnDemand]: 207/212 looper letters, 20 selfloop transitions, 2 changer transitions 2/25 dead transitions. [2023-11-17 15:17:58,853 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 25 transitions, 107 flow [2023-11-17 15:17:58,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 15:17:58,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 15:17:58,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 313 transitions. [2023-11-17 15:17:58,873 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4921383647798742 [2023-11-17 15:17:58,873 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 313 transitions. [2023-11-17 15:17:58,874 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 313 transitions. [2023-11-17 15:17:58,876 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:17:58,878 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 313 transitions. [2023-11-17 15:17:58,882 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:17:58,886 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 212.0) internal successors, (848), 4 states have internal predecessors, (848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:17:58,887 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 212.0) internal successors, (848), 4 states have internal predecessors, (848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:17:58,888 INFO L175 Difference]: Start difference. First operand has 24 places, 19 transitions, 44 flow. Second operand 3 states and 313 transitions. [2023-11-17 15:17:58,889 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 25 transitions, 107 flow [2023-11-17 15:17:58,890 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 25 transitions, 104 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-17 15:17:58,891 INFO L231 Difference]: Finished difference. Result has 23 places, 15 transitions, 38 flow [2023-11-17 15:17:58,892 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=36, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=38, PETRI_PLACES=23, PETRI_TRANSITIONS=15} [2023-11-17 15:17:58,898 INFO L281 CegarLoopForPetriNet]: 24 programPoint places, -1 predicate places. [2023-11-17 15:17:58,898 INFO L495 AbstractCegarLoop]: Abstraction has has 23 places, 15 transitions, 38 flow [2023-11-17 15:17:58,898 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 96.33333333333333) internal successors, (289), 3 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:17:58,899 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:17:58,899 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:17:58,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-17 15:17:58,899 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-17 15:17:58,901 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:17:58,901 INFO L85 PathProgramCache]: Analyzing trace with hash 1039114239, now seen corresponding path program 1 times [2023-11-17 15:17:58,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:17:58,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248634600] [2023-11-17 15:17:58,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:17:58,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:17:58,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:17:59,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:17:59,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:17:59,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248634600] [2023-11-17 15:17:59,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248634600] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:17:59,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:17:59,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-17 15:17:59,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508442830] [2023-11-17 15:17:59,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:17:59,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 15:17:59,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:17:59,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 15:17:59,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 15:17:59,171 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 212 [2023-11-17 15:17:59,172 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 15 transitions, 38 flow. Second operand has 3 states, 3 states have (on average 96.33333333333333) internal successors, (289), 3 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:17:59,172 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:17:59,172 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 212 [2023-11-17 15:17:59,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:17:59,274 INFO L124 PetriNetUnfolderBase]: 106/195 cut-off events. [2023-11-17 15:17:59,274 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2023-11-17 15:17:59,278 INFO L83 FinitePrefix]: Finished finitePrefix Result has 422 conditions, 195 events. 106/195 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 657 event pairs, 44 based on Foata normal form. 4/198 useless extension candidates. Maximal degree in co-relation 412. Up to 173 conditions per place. [2023-11-17 15:17:59,280 INFO L140 encePairwiseOnDemand]: 209/212 looper letters, 19 selfloop transitions, 2 changer transitions 0/22 dead transitions. [2023-11-17 15:17:59,280 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 22 transitions, 96 flow [2023-11-17 15:17:59,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 15:17:59,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 15:17:59,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 304 transitions. [2023-11-17 15:17:59,283 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4779874213836478 [2023-11-17 15:17:59,283 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 304 transitions. [2023-11-17 15:17:59,284 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 304 transitions. [2023-11-17 15:17:59,285 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:17:59,285 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 304 transitions. [2023-11-17 15:17:59,286 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:17:59,289 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 212.0) internal successors, (848), 4 states have internal predecessors, (848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:17:59,289 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 212.0) internal successors, (848), 4 states have internal predecessors, (848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:17:59,289 INFO L175 Difference]: Start difference. First operand has 23 places, 15 transitions, 38 flow. Second operand 3 states and 304 transitions. [2023-11-17 15:17:59,289 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 22 transitions, 96 flow [2023-11-17 15:17:59,290 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 22 places, 22 transitions, 92 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-17 15:17:59,290 INFO L231 Difference]: Finished difference. Result has 23 places, 15 transitions, 42 flow [2023-11-17 15:17:59,291 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=34, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=42, PETRI_PLACES=23, PETRI_TRANSITIONS=15} [2023-11-17 15:17:59,291 INFO L281 CegarLoopForPetriNet]: 24 programPoint places, -1 predicate places. [2023-11-17 15:17:59,292 INFO L495 AbstractCegarLoop]: Abstraction has has 23 places, 15 transitions, 42 flow [2023-11-17 15:17:59,292 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 96.33333333333333) internal successors, (289), 3 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:17:59,292 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:17:59,292 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:17:59,293 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-17 15:17:59,293 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-17 15:17:59,296 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:17:59,296 INFO L85 PathProgramCache]: Analyzing trace with hash -2147197961, now seen corresponding path program 1 times [2023-11-17 15:17:59,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:17:59,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642800213] [2023-11-17 15:17:59,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:17:59,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:17:59,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:17:59,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:17:59,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:17:59,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642800213] [2023-11-17 15:17:59,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642800213] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:17:59,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:17:59,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 15:17:59,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305184454] [2023-11-17 15:17:59,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:17:59,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 15:17:59,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:17:59,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 15:17:59,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-17 15:17:59,504 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 212 [2023-11-17 15:17:59,504 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 15 transitions, 42 flow. Second operand has 4 states, 4 states have (on average 94.0) internal successors, (376), 4 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:17:59,505 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:17:59,505 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 212 [2023-11-17 15:17:59,505 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:17:59,602 INFO L124 PetriNetUnfolderBase]: 160/294 cut-off events. [2023-11-17 15:17:59,603 INFO L125 PetriNetUnfolderBase]: For 37/37 co-relation queries the response was YES. [2023-11-17 15:17:59,603 INFO L83 FinitePrefix]: Finished finitePrefix Result has 651 conditions, 294 events. 160/294 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1044 event pairs, 47 based on Foata normal form. 20/314 useless extension candidates. Maximal degree in co-relation 640. Up to 114 conditions per place. [2023-11-17 15:17:59,604 INFO L140 encePairwiseOnDemand]: 208/212 looper letters, 18 selfloop transitions, 3 changer transitions 7/28 dead transitions. [2023-11-17 15:17:59,604 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 28 transitions, 127 flow [2023-11-17 15:17:59,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 15:17:59,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-17 15:17:59,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 398 transitions. [2023-11-17 15:17:59,605 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4693396226415094 [2023-11-17 15:17:59,605 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 398 transitions. [2023-11-17 15:17:59,605 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 398 transitions. [2023-11-17 15:17:59,605 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:17:59,605 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 398 transitions. [2023-11-17 15:17:59,606 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 99.5) internal successors, (398), 4 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:17:59,607 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 212.0) internal successors, (1060), 5 states have internal predecessors, (1060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:17:59,608 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 212.0) internal successors, (1060), 5 states have internal predecessors, (1060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:17:59,608 INFO L175 Difference]: Start difference. First operand has 23 places, 15 transitions, 42 flow. Second operand 4 states and 398 transitions. [2023-11-17 15:17:59,608 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 28 transitions, 127 flow [2023-11-17 15:17:59,608 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 28 transitions, 121 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-17 15:17:59,609 INFO L231 Difference]: Finished difference. Result has 26 places, 15 transitions, 52 flow [2023-11-17 15:17:59,609 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=52, PETRI_PLACES=26, PETRI_TRANSITIONS=15} [2023-11-17 15:17:59,611 INFO L281 CegarLoopForPetriNet]: 24 programPoint places, 2 predicate places. [2023-11-17 15:17:59,611 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 15 transitions, 52 flow [2023-11-17 15:17:59,611 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 94.0) internal successors, (376), 4 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:17:59,611 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:17:59,611 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:17:59,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-17 15:17:59,612 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-17 15:17:59,613 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:17:59,613 INFO L85 PathProgramCache]: Analyzing trace with hash -1911379753, now seen corresponding path program 1 times [2023-11-17 15:17:59,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:17:59,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737002329] [2023-11-17 15:17:59,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:17:59,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:17:59,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:18:00,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:18:00,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:18:00,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737002329] [2023-11-17 15:18:00,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737002329] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:18:00,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:18:00,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-17 15:18:00,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696062651] [2023-11-17 15:18:00,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:18:00,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-17 15:18:00,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:18:00,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-17 15:18:00,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-17 15:18:00,526 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 212 [2023-11-17 15:18:00,527 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 15 transitions, 52 flow. Second operand has 6 states, 6 states have (on average 78.5) internal successors, (471), 6 states have internal predecessors, (471), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:18:00,527 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:18:00,527 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 212 [2023-11-17 15:18:00,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:18:00,645 INFO L124 PetriNetUnfolderBase]: 67/131 cut-off events. [2023-11-17 15:18:00,645 INFO L125 PetriNetUnfolderBase]: For 79/79 co-relation queries the response was YES. [2023-11-17 15:18:00,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 333 conditions, 131 events. 67/131 cut-off events. For 79/79 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 347 event pairs, 20 based on Foata normal form. 2/133 useless extension candidates. Maximal degree in co-relation 320. Up to 108 conditions per place. [2023-11-17 15:18:00,646 INFO L140 encePairwiseOnDemand]: 206/212 looper letters, 19 selfloop transitions, 6 changer transitions 0/26 dead transitions. [2023-11-17 15:18:00,646 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 26 transitions, 128 flow [2023-11-17 15:18:00,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 15:18:00,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 15:18:00,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 412 transitions. [2023-11-17 15:18:00,648 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3886792452830189 [2023-11-17 15:18:00,648 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 412 transitions. [2023-11-17 15:18:00,648 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 412 transitions. [2023-11-17 15:18:00,648 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:18:00,649 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 412 transitions. [2023-11-17 15:18:00,650 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 82.4) internal successors, (412), 5 states have internal predecessors, (412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:18:00,651 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 212.0) internal successors, (1272), 6 states have internal predecessors, (1272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:18:00,652 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 212.0) internal successors, (1272), 6 states have internal predecessors, (1272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:18:00,652 INFO L175 Difference]: Start difference. First operand has 26 places, 15 transitions, 52 flow. Second operand 5 states and 412 transitions. [2023-11-17 15:18:00,652 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 26 transitions, 128 flow [2023-11-17 15:18:00,654 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 26 transitions, 111 flow, removed 2 selfloop flow, removed 5 redundant places. [2023-11-17 15:18:00,654 INFO L231 Difference]: Finished difference. Result has 27 places, 19 transitions, 74 flow [2023-11-17 15:18:00,655 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=10, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=74, PETRI_PLACES=27, PETRI_TRANSITIONS=19} [2023-11-17 15:18:00,656 INFO L281 CegarLoopForPetriNet]: 24 programPoint places, 3 predicate places. [2023-11-17 15:18:00,656 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 19 transitions, 74 flow [2023-11-17 15:18:00,656 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 78.5) internal successors, (471), 6 states have internal predecessors, (471), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:18:00,656 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:18:00,656 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:18:00,657 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-17 15:18:00,657 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-17 15:18:00,657 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:18:00,657 INFO L85 PathProgramCache]: Analyzing trace with hash 2068109680, now seen corresponding path program 1 times [2023-11-17 15:18:00,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:18:00,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444454901] [2023-11-17 15:18:00,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:18:00,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:18:00,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:18:01,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:18:01,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:18:01,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444454901] [2023-11-17 15:18:01,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444454901] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:18:01,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:18:01,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-17 15:18:01,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104475301] [2023-11-17 15:18:01,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:18:01,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-17 15:18:01,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:18:01,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-17 15:18:01,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-17 15:18:01,582 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 212 [2023-11-17 15:18:01,583 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 19 transitions, 74 flow. Second operand has 7 states, 7 states have (on average 76.42857142857143) internal successors, (535), 7 states have internal predecessors, (535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:18:01,583 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:18:01,583 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 212 [2023-11-17 15:18:01,583 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:18:01,735 INFO L124 PetriNetUnfolderBase]: 72/141 cut-off events. [2023-11-17 15:18:01,735 INFO L125 PetriNetUnfolderBase]: For 80/80 co-relation queries the response was YES. [2023-11-17 15:18:01,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 390 conditions, 141 events. 72/141 cut-off events. For 80/80 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 396 event pairs, 10 based on Foata normal form. 4/145 useless extension candidates. Maximal degree in co-relation 378. Up to 82 conditions per place. [2023-11-17 15:18:01,742 INFO L140 encePairwiseOnDemand]: 205/212 looper letters, 21 selfloop transitions, 8 changer transitions 0/30 dead transitions. [2023-11-17 15:18:01,742 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 30 transitions, 162 flow [2023-11-17 15:18:01,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 15:18:01,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 15:18:01,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 402 transitions. [2023-11-17 15:18:01,743 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37924528301886795 [2023-11-17 15:18:01,743 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 402 transitions. [2023-11-17 15:18:01,743 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 402 transitions. [2023-11-17 15:18:01,744 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:18:01,744 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 402 transitions. [2023-11-17 15:18:01,745 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 80.4) internal successors, (402), 5 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:18:01,747 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 212.0) internal successors, (1272), 6 states have internal predecessors, (1272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:18:01,747 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 212.0) internal successors, (1272), 6 states have internal predecessors, (1272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:18:01,747 INFO L175 Difference]: Start difference. First operand has 27 places, 19 transitions, 74 flow. Second operand 5 states and 402 transitions. [2023-11-17 15:18:01,747 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 30 transitions, 162 flow [2023-11-17 15:18:01,748 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 30 transitions, 160 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-17 15:18:01,749 INFO L231 Difference]: Finished difference. Result has 32 places, 23 transitions, 125 flow [2023-11-17 15:18:01,749 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=125, PETRI_PLACES=32, PETRI_TRANSITIONS=23} [2023-11-17 15:18:01,751 INFO L281 CegarLoopForPetriNet]: 24 programPoint places, 8 predicate places. [2023-11-17 15:18:01,751 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 23 transitions, 125 flow [2023-11-17 15:18:01,751 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 76.42857142857143) internal successors, (535), 7 states have internal predecessors, (535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:18:01,751 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:18:01,752 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:18:01,752 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-17 15:18:01,752 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-17 15:18:01,752 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:18:01,752 INFO L85 PathProgramCache]: Analyzing trace with hash -313121181, now seen corresponding path program 1 times [2023-11-17 15:18:01,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:18:01,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927217243] [2023-11-17 15:18:01,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:18:01,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:18:01,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:18:03,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:18:03,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:18:03,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927217243] [2023-11-17 15:18:03,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927217243] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:18:03,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:18:03,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-17 15:18:03,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665348393] [2023-11-17 15:18:03,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:18:03,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-17 15:18:03,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:18:03,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-17 15:18:03,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-17 15:18:03,321 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 212 [2023-11-17 15:18:03,322 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 23 transitions, 125 flow. Second operand has 8 states, 8 states have (on average 75.375) internal successors, (603), 8 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:18:03,323 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:18:03,323 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 212 [2023-11-17 15:18:03,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:18:03,474 INFO L124 PetriNetUnfolderBase]: 73/144 cut-off events. [2023-11-17 15:18:03,474 INFO L125 PetriNetUnfolderBase]: For 190/190 co-relation queries the response was YES. [2023-11-17 15:18:03,474 INFO L83 FinitePrefix]: Finished finitePrefix Result has 495 conditions, 144 events. 73/144 cut-off events. For 190/190 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 419 event pairs, 16 based on Foata normal form. 2/146 useless extension candidates. Maximal degree in co-relation 480. Up to 114 conditions per place. [2023-11-17 15:18:03,475 INFO L140 encePairwiseOnDemand]: 205/212 looper letters, 24 selfloop transitions, 8 changer transitions 0/33 dead transitions. [2023-11-17 15:18:03,475 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 33 transitions, 223 flow [2023-11-17 15:18:03,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 15:18:03,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 15:18:03,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 397 transitions. [2023-11-17 15:18:03,477 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3745283018867924 [2023-11-17 15:18:03,478 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 397 transitions. [2023-11-17 15:18:03,478 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 397 transitions. [2023-11-17 15:18:03,478 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:18:03,478 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 397 transitions. [2023-11-17 15:18:03,479 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 79.4) internal successors, (397), 5 states have internal predecessors, (397), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:18:03,480 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 212.0) internal successors, (1272), 6 states have internal predecessors, (1272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:18:03,480 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 212.0) internal successors, (1272), 6 states have internal predecessors, (1272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:18:03,480 INFO L175 Difference]: Start difference. First operand has 32 places, 23 transitions, 125 flow. Second operand 5 states and 397 transitions. [2023-11-17 15:18:03,480 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 33 transitions, 223 flow [2023-11-17 15:18:03,483 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 33 transitions, 210 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-11-17 15:18:03,484 INFO L231 Difference]: Finished difference. Result has 34 places, 26 transitions, 156 flow [2023-11-17 15:18:03,484 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=113, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=156, PETRI_PLACES=34, PETRI_TRANSITIONS=26} [2023-11-17 15:18:03,486 INFO L281 CegarLoopForPetriNet]: 24 programPoint places, 10 predicate places. [2023-11-17 15:18:03,486 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 26 transitions, 156 flow [2023-11-17 15:18:03,486 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 75.375) internal successors, (603), 8 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:18:03,486 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:18:03,486 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:18:03,486 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-17 15:18:03,487 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-17 15:18:03,487 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:18:03,487 INFO L85 PathProgramCache]: Analyzing trace with hash -313121398, now seen corresponding path program 1 times [2023-11-17 15:18:03,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:18:03,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741433982] [2023-11-17 15:18:03,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:18:03,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:18:03,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:18:03,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:18:03,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:18:03,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741433982] [2023-11-17 15:18:03,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741433982] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:18:03,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:18:03,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 15:18:03,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376051313] [2023-11-17 15:18:03,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:18:03,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 15:18:03,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:18:03,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 15:18:03,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-17 15:18:03,622 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 212 [2023-11-17 15:18:03,623 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 26 transitions, 156 flow. Second operand has 4 states, 4 states have (on average 91.75) internal successors, (367), 4 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:18:03,623 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:18:03,623 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 212 [2023-11-17 15:18:03,623 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:18:03,702 INFO L124 PetriNetUnfolderBase]: 45/106 cut-off events. [2023-11-17 15:18:03,702 INFO L125 PetriNetUnfolderBase]: For 184/184 co-relation queries the response was YES. [2023-11-17 15:18:03,703 INFO L83 FinitePrefix]: Finished finitePrefix Result has 381 conditions, 106 events. 45/106 cut-off events. For 184/184 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 329 event pairs, 4 based on Foata normal form. 18/124 useless extension candidates. Maximal degree in co-relation 365. Up to 54 conditions per place. [2023-11-17 15:18:03,703 INFO L140 encePairwiseOnDemand]: 207/212 looper letters, 26 selfloop transitions, 3 changer transitions 20/50 dead transitions. [2023-11-17 15:18:03,703 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 50 transitions, 377 flow [2023-11-17 15:18:03,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 15:18:03,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 15:18:03,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 481 transitions. [2023-11-17 15:18:03,705 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4537735849056604 [2023-11-17 15:18:03,705 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 481 transitions. [2023-11-17 15:18:03,705 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 481 transitions. [2023-11-17 15:18:03,705 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:18:03,705 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 481 transitions. [2023-11-17 15:18:03,706 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 96.2) internal successors, (481), 5 states have internal predecessors, (481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:18:03,707 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 212.0) internal successors, (1272), 6 states have internal predecessors, (1272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:18:03,708 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 212.0) internal successors, (1272), 6 states have internal predecessors, (1272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:18:03,708 INFO L175 Difference]: Start difference. First operand has 34 places, 26 transitions, 156 flow. Second operand 5 states and 481 transitions. [2023-11-17 15:18:03,708 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 50 transitions, 377 flow [2023-11-17 15:18:03,710 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 50 transitions, 346 flow, removed 6 selfloop flow, removed 3 redundant places. [2023-11-17 15:18:03,711 INFO L231 Difference]: Finished difference. Result has 38 places, 25 transitions, 154 flow [2023-11-17 15:18:03,711 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=119, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=154, PETRI_PLACES=38, PETRI_TRANSITIONS=25} [2023-11-17 15:18:03,712 INFO L281 CegarLoopForPetriNet]: 24 programPoint places, 14 predicate places. [2023-11-17 15:18:03,712 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 25 transitions, 154 flow [2023-11-17 15:18:03,712 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 91.75) internal successors, (367), 4 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:18:03,713 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:18:03,715 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:18:03,716 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-17 15:18:03,716 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-17 15:18:03,716 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:18:03,717 INFO L85 PathProgramCache]: Analyzing trace with hash 786226394, now seen corresponding path program 1 times [2023-11-17 15:18:03,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:18:03,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435643741] [2023-11-17 15:18:03,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:18:03,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:18:03,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:18:04,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:18:04,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:18:04,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435643741] [2023-11-17 15:18:04,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435643741] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:18:04,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:18:04,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-17 15:18:04,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514390557] [2023-11-17 15:18:04,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:18:04,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-17 15:18:04,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:18:04,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-17 15:18:04,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-11-17 15:18:04,401 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 212 [2023-11-17 15:18:04,401 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 25 transitions, 154 flow. Second operand has 8 states, 8 states have (on average 76.5) internal successors, (612), 8 states have internal predecessors, (612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:18:04,401 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:18:04,401 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 212 [2023-11-17 15:18:04,401 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:18:04,499 INFO L124 PetriNetUnfolderBase]: 27/71 cut-off events. [2023-11-17 15:18:04,500 INFO L125 PetriNetUnfolderBase]: For 112/112 co-relation queries the response was YES. [2023-11-17 15:18:04,500 INFO L83 FinitePrefix]: Finished finitePrefix Result has 308 conditions, 71 events. 27/71 cut-off events. For 112/112 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 173 event pairs, 5 based on Foata normal form. 1/72 useless extension candidates. Maximal degree in co-relation 289. Up to 45 conditions per place. [2023-11-17 15:18:04,500 INFO L140 encePairwiseOnDemand]: 206/212 looper letters, 22 selfloop transitions, 8 changer transitions 0/31 dead transitions. [2023-11-17 15:18:04,500 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 31 transitions, 248 flow [2023-11-17 15:18:04,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 15:18:04,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 15:18:04,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 399 transitions. [2023-11-17 15:18:04,502 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37641509433962267 [2023-11-17 15:18:04,502 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 399 transitions. [2023-11-17 15:18:04,502 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 399 transitions. [2023-11-17 15:18:04,502 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:18:04,502 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 399 transitions. [2023-11-17 15:18:04,503 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 79.8) internal successors, (399), 5 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:18:04,504 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 212.0) internal successors, (1272), 6 states have internal predecessors, (1272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:18:04,504 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 212.0) internal successors, (1272), 6 states have internal predecessors, (1272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:18:04,505 INFO L175 Difference]: Start difference. First operand has 38 places, 25 transitions, 154 flow. Second operand 5 states and 399 transitions. [2023-11-17 15:18:04,505 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 31 transitions, 248 flow [2023-11-17 15:18:04,506 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 31 transitions, 231 flow, removed 6 selfloop flow, removed 2 redundant places. [2023-11-17 15:18:04,507 INFO L231 Difference]: Finished difference. Result has 39 places, 26 transitions, 173 flow [2023-11-17 15:18:04,507 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=141, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=173, PETRI_PLACES=39, PETRI_TRANSITIONS=26} [2023-11-17 15:18:04,508 INFO L281 CegarLoopForPetriNet]: 24 programPoint places, 15 predicate places. [2023-11-17 15:18:04,508 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 26 transitions, 173 flow [2023-11-17 15:18:04,509 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 76.5) internal successors, (612), 8 states have internal predecessors, (612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:18:04,509 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:18:04,509 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:18:04,509 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-17 15:18:04,511 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-17 15:18:04,512 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:18:04,512 INFO L85 PathProgramCache]: Analyzing trace with hash -360419804, now seen corresponding path program 1 times [2023-11-17 15:18:04,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:18:04,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505198400] [2023-11-17 15:18:04,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:18:04,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:18:04,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:18:04,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:18:04,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:18:04,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505198400] [2023-11-17 15:18:04,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505198400] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:18:04,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:18:04,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-17 15:18:04,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934986519] [2023-11-17 15:18:04,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:18:04,633 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-17 15:18:04,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:18:04,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-17 15:18:04,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-17 15:18:04,634 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 212 [2023-11-17 15:18:04,634 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 26 transitions, 173 flow. Second operand has 5 states, 5 states have (on average 91.4) internal successors, (457), 5 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:18:04,634 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:18:04,634 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 212 [2023-11-17 15:18:04,634 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:18:04,706 INFO L124 PetriNetUnfolderBase]: 15/48 cut-off events. [2023-11-17 15:18:04,706 INFO L125 PetriNetUnfolderBase]: For 99/99 co-relation queries the response was YES. [2023-11-17 15:18:04,706 INFO L83 FinitePrefix]: Finished finitePrefix Result has 205 conditions, 48 events. 15/48 cut-off events. For 99/99 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 98 event pairs, 1 based on Foata normal form. 8/56 useless extension candidates. Maximal degree in co-relation 185. Up to 20 conditions per place. [2023-11-17 15:18:04,707 INFO L140 encePairwiseOnDemand]: 207/212 looper letters, 21 selfloop transitions, 5 changer transitions 8/35 dead transitions. [2023-11-17 15:18:04,707 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 35 transitions, 292 flow [2023-11-17 15:18:04,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-17 15:18:04,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-17 15:18:04,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 563 transitions. [2023-11-17 15:18:04,708 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44261006289308175 [2023-11-17 15:18:04,709 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 563 transitions. [2023-11-17 15:18:04,709 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 563 transitions. [2023-11-17 15:18:04,709 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:18:04,709 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 563 transitions. [2023-11-17 15:18:04,710 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 93.83333333333333) internal successors, (563), 6 states have internal predecessors, (563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:18:04,711 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 212.0) internal successors, (1484), 7 states have internal predecessors, (1484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:18:04,711 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 212.0) internal successors, (1484), 7 states have internal predecessors, (1484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:18:04,711 INFO L175 Difference]: Start difference. First operand has 39 places, 26 transitions, 173 flow. Second operand 6 states and 563 transitions. [2023-11-17 15:18:04,712 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 35 transitions, 292 flow [2023-11-17 15:18:04,712 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 35 transitions, 223 flow, removed 9 selfloop flow, removed 8 redundant places. [2023-11-17 15:18:04,713 INFO L231 Difference]: Finished difference. Result has 39 places, 22 transitions, 121 flow [2023-11-17 15:18:04,713 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=101, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=121, PETRI_PLACES=39, PETRI_TRANSITIONS=22} [2023-11-17 15:18:04,713 INFO L281 CegarLoopForPetriNet]: 24 programPoint places, 15 predicate places. [2023-11-17 15:18:04,713 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 22 transitions, 121 flow [2023-11-17 15:18:04,714 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 91.4) internal successors, (457), 5 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:18:04,714 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:18:04,714 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:18:04,714 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-17 15:18:04,714 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-17 15:18:04,714 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:18:04,715 INFO L85 PathProgramCache]: Analyzing trace with hash 933506844, now seen corresponding path program 1 times [2023-11-17 15:18:04,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:18:04,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132723703] [2023-11-17 15:18:04,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:18:04,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:18:04,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-17 15:18:04,751 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-17 15:18:04,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-17 15:18:04,805 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-17 15:18:04,805 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-17 15:18:04,806 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2023-11-17 15:18:04,807 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2023-11-17 15:18:04,808 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2023-11-17 15:18:04,808 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2023-11-17 15:18:04,808 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2023-11-17 15:18:04,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-17 15:18:04,808 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:18:04,812 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-17 15:18:04,813 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-17 15:18:04,840 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre25 could not be translated [2023-11-17 15:18:04,843 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre27 could not be translated [2023-11-17 15:18:04,864 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.11 03:18:04 BasicIcfg [2023-11-17 15:18:04,864 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-17 15:18:04,865 INFO L158 Benchmark]: Toolchain (without parser) took 14849.12ms. Allocated memory was 226.5MB in the beginning and 431.0MB in the end (delta: 204.5MB). Free memory was 174.3MB in the beginning and 191.3MB in the end (delta: -17.0MB). Peak memory consumption was 188.0MB. Max. memory is 8.0GB. [2023-11-17 15:18:04,865 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 157.3MB. Free memory is still 107.0MB. There was no memory consumed. Max. memory is 8.0GB. [2023-11-17 15:18:04,865 INFO L158 Benchmark]: CACSL2BoogieTranslator took 434.27ms. Allocated memory is still 226.5MB. Free memory was 173.8MB in the beginning and 150.0MB in the end (delta: 23.7MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. [2023-11-17 15:18:04,865 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.27ms. Allocated memory is still 226.5MB. Free memory was 150.0MB in the beginning and 147.5MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-11-17 15:18:04,865 INFO L158 Benchmark]: Boogie Preprocessor took 48.51ms. Allocated memory is still 226.5MB. Free memory was 147.5MB in the beginning and 145.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-11-17 15:18:04,866 INFO L158 Benchmark]: RCFGBuilder took 1009.42ms. Allocated memory is still 226.5MB. Free memory was 145.4MB in the beginning and 179.9MB in the end (delta: -34.4MB). Peak memory consumption was 71.3MB. Max. memory is 8.0GB. [2023-11-17 15:18:04,866 INFO L158 Benchmark]: TraceAbstraction took 13292.37ms. Allocated memory was 226.5MB in the beginning and 431.0MB in the end (delta: 204.5MB). Free memory was 179.3MB in the beginning and 191.3MB in the end (delta: -11.9MB). Peak memory consumption was 193.6MB. Max. memory is 8.0GB. [2023-11-17 15:18:04,868 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 157.3MB. Free memory is still 107.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 434.27ms. Allocated memory is still 226.5MB. Free memory was 173.8MB in the beginning and 150.0MB in the end (delta: 23.7MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 59.27ms. Allocated memory is still 226.5MB. Free memory was 150.0MB in the beginning and 147.5MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 48.51ms. Allocated memory is still 226.5MB. Free memory was 147.5MB in the beginning and 145.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 1009.42ms. Allocated memory is still 226.5MB. Free memory was 145.4MB in the beginning and 179.9MB in the end (delta: -34.4MB). Peak memory consumption was 71.3MB. Max. memory is 8.0GB. * TraceAbstraction took 13292.37ms. Allocated memory was 226.5MB in the beginning and 431.0MB in the end (delta: 204.5MB). Free memory was 179.3MB in the beginning and 191.3MB in the end (delta: -11.9MB). Peak memory consumption was 193.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre25 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre27 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: 6.6s, 111 PlacesBefore, 24 PlacesAfterwards, 107 TransitionsBefore, 19 TransitionsAfterwards, 1244 CoEnabledTransitionPairs, 6 FixpointIterations, 51 TrivialSequentialCompositions, 37 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 14 ConcurrentYvCompositions, 1 ChoiceCompositions, 103 TotalNumberOfCompositions, 2829 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1514, independent: 1400, independent conditional: 0, independent unconditional: 1400, dependent: 114, dependent conditional: 0, dependent unconditional: 114, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 981, independent: 948, independent conditional: 0, independent unconditional: 948, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 981, independent: 919, independent conditional: 0, independent unconditional: 919, dependent: 62, dependent conditional: 0, dependent unconditional: 62, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 62, independent: 29, independent conditional: 0, independent unconditional: 29, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 490, independent: 49, independent conditional: 0, independent unconditional: 49, dependent: 440, dependent conditional: 0, dependent unconditional: 440, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1514, independent: 452, independent conditional: 0, independent unconditional: 452, dependent: 81, dependent conditional: 0, dependent unconditional: 81, unknown: 981, unknown conditional: 0, unknown unconditional: 981] , Statistics on independence cache: Total cache size (in pairs): 65, Positive cache size: 51, Positive conditional cache size: 0, Positive unconditional cache size: 51, 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: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p0_EAX = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L713] 0 _Bool __unbuffered_p1_EAX$flush_delayed; [L714] 0 int __unbuffered_p1_EAX$mem_tmp; [L715] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd0; [L716] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd1; [L717] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd2; [L718] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd0; [L719] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd1; [L720] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd2; [L721] 0 _Bool __unbuffered_p1_EAX$read_delayed; [L722] 0 int *__unbuffered_p1_EAX$read_delayed_var; [L723] 0 int __unbuffered_p1_EAX$w_buff0; [L724] 0 _Bool __unbuffered_p1_EAX$w_buff0_used; [L725] 0 int __unbuffered_p1_EAX$w_buff1; [L726] 0 _Bool __unbuffered_p1_EAX$w_buff1_used; [L727] 0 _Bool main$tmp_guard0; [L728] 0 _Bool main$tmp_guard1; [L730] 0 int x = 0; [L731] 0 _Bool x$flush_delayed; [L732] 0 int x$mem_tmp; [L733] 0 _Bool x$r_buff0_thd0; [L734] 0 _Bool x$r_buff0_thd1; [L735] 0 _Bool x$r_buff0_thd2; [L736] 0 _Bool x$r_buff1_thd0; [L737] 0 _Bool x$r_buff1_thd1; [L738] 0 _Bool x$r_buff1_thd2; [L739] 0 _Bool x$read_delayed; [L740] 0 int *x$read_delayed_var; [L741] 0 int x$w_buff0; [L742] 0 _Bool x$w_buff0_used; [L743] 0 int x$w_buff1; [L744] 0 _Bool x$w_buff1_used; [L746] 0 int y = 0; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice1; [L749] 0 _Bool weak$$choice2; [L825] 0 pthread_t t1923; [L826] FCALL, FORK 0 pthread_create(&t1923, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1923={7:0}, weak$$choice0=0, weak$$choice1=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={3:0}, y=0] [L827] 0 pthread_t t1924; [L828] FCALL, FORK 0 pthread_create(&t1924, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1923={7:0}, t1924={5:0}, weak$$choice0=0, weak$$choice1=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={3:0}, y=0] [L781] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L782] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L783] 2 x$flush_delayed = weak$$choice2 [L784] EXPR 2 \read(x) [L784] 2 x$mem_tmp = x [L785] 2 weak$$choice1 = __VERIFIER_nondet_bool() [L786] EXPR 2 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L786] EXPR 2 \read(x) [L786] EXPR 2 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L786] 2 x = !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L787] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)))) [L788] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)))) [L789] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 || !weak$$choice1 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 : weak$$choice0)))) [L790] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L791] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L792] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$r_buff1_thd2 : (_Bool)0) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L793] 2 __unbuffered_p1_EAX$read_delayed = (_Bool)1 [L794] 2 __unbuffered_p1_EAX$read_delayed_var = &x [L795] EXPR 2 \read(x) [L795] 2 __unbuffered_p1_EAX = x [L796] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L796] EXPR 2 \read(x) [L796] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L796] 2 x = x$flush_delayed ? x$mem_tmp : x [L797] 2 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, 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={3:0}, y=0] [L800] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, 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={3:0}, y=1] [L753] 1 __unbuffered_p0_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, 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={3:0}, y=1] [L803] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L803] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L803] EXPR 2 \read(x) [L803] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L803] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L803] 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) [L804] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L805] 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 [L806] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L807] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, 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={3:0}, y=1] [L756] 1 x$w_buff1 = x$w_buff0 [L757] 1 x$w_buff0 = 1 [L758] 1 x$w_buff1_used = x$w_buff0_used [L759] 1 x$w_buff0_used = (_Bool)1 [L760] CALL 1 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L760] RET 1 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L761] 1 x$r_buff1_thd0 = x$r_buff0_thd0 [L762] 1 x$r_buff1_thd1 = x$r_buff0_thd1 [L763] 1 x$r_buff1_thd2 = x$r_buff0_thd2 [L764] 1 x$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L767] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L767] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L768] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L769] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L770] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L771] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L810] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L812] 2 return 0; [L774] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L776] 1 return 0; [L830] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L832] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L832] RET 0 assume_abort_if_not(main$tmp_guard0) [L834] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L834] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L834] EXPR 0 \read(x) [L834] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L834] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L834] 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) [L835] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L836] 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 [L837] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L838] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1923={7:0}, t1924={5:0}, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L841] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L842] EXPR 0 __unbuffered_p1_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX) : __unbuffered_p1_EAX [L842] EXPR 0 weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX [L842] EXPR 0 \read(*__unbuffered_p1_EAX$read_delayed_var) [L842] EXPR 0 weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX [L842] EXPR 0 __unbuffered_p1_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX) : __unbuffered_p1_EAX [L842] 0 __unbuffered_p1_EAX = __unbuffered_p1_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX) : __unbuffered_p1_EAX [L843] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p1_EAX == 1) [L845] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] - UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 826]: 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: 828]: 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, 126 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: 13.1s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 103 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 103 mSDsluCounter, 1 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 38 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 438 IncrementalHoareTripleChecker+Invalid, 476 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 38 mSolverCounterUnsat, 1 mSDtfsCounter, 438 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=173occurred in iteration=8, InterpolantAutomatonStates: 41, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.6s InterpolantComputationTime, 105 NumberOfCodeBlocks, 105 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 81 ConstructedInterpolants, 0 QuantifiedInterpolants, 1086 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-11-17 15:18:04,901 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...