/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf --rcfgbuilder.only.consider.context.switches.at.boundaries.of.atomic.blocks true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix024_power.opt_pso.opt_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.dk.datarace-free-lbe-02cf818-m [2023-11-17 11:25:10,993 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-17 11:25:11,084 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf [2023-11-17 11:25:11,115 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-17 11:25:11,116 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-17 11:25:11,117 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-17 11:25:11,117 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-17 11:25:11,118 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-17 11:25:11,118 INFO L153 SettingsManager]: * Use SBE=true [2023-11-17 11:25:11,122 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-17 11:25:11,122 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-17 11:25:11,123 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-17 11:25:11,123 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-17 11:25:11,124 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-17 11:25:11,124 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-17 11:25:11,124 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-17 11:25:11,125 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-17 11:25:11,125 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-17 11:25:11,125 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-17 11:25:11,125 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-17 11:25:11,125 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-17 11:25:11,126 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-17 11:25:11,126 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-17 11:25:11,127 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-17 11:25:11,127 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-17 11:25:11,127 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 11:25:11,127 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-17 11:25:11,127 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-17 11:25:11,128 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-17 11:25:11,128 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-17 11:25:11,129 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-17 11:25:11,129 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-17 11:25:11,129 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Only consider context switches at boundaries of atomic blocks -> true [2023-11-17 11:25:11,388 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-17 11:25:11,414 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-17 11:25:11,417 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-17 11:25:11,418 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-17 11:25:11,418 INFO L274 PluginConnector]: CDTParser initialized [2023-11-17 11:25:11,420 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix024_power.opt_pso.opt_rmo.opt.i [2023-11-17 11:25:12,646 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-17 11:25:12,932 INFO L384 CDTParser]: Found 1 translation units. [2023-11-17 11:25:12,933 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix024_power.opt_pso.opt_rmo.opt.i [2023-11-17 11:25:12,949 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d951962d5/784c566dfbc94a4da4cb45bc0e41fef1/FLAG38837c1a2 [2023-11-17 11:25:12,964 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d951962d5/784c566dfbc94a4da4cb45bc0e41fef1 [2023-11-17 11:25:12,966 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-17 11:25:12,967 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-17 11:25:12,968 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-17 11:25:12,968 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-17 11:25:12,972 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-17 11:25:12,973 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 11:25:12" (1/1) ... [2023-11-17 11:25:12,974 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e5714d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:25:12, skipping insertion in model container [2023-11-17 11:25:12,974 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 11:25:12" (1/1) ... [2023-11-17 11:25:13,029 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-17 11:25:13,181 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/mix024_power.opt_pso.opt_rmo.opt.i[1009,1022] [2023-11-17 11:25:13,343 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 11:25:13,352 INFO L202 MainTranslator]: Completed pre-run [2023-11-17 11:25:13,363 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/mix024_power.opt_pso.opt_rmo.opt.i[1009,1022] [2023-11-17 11:25:13,419 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 11:25:13,463 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-17 11:25:13,463 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-17 11:25:13,470 INFO L206 MainTranslator]: Completed translation [2023-11-17 11:25:13,470 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:25:13 WrapperNode [2023-11-17 11:25:13,470 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-17 11:25:13,472 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-17 11:25:13,472 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-17 11:25:13,472 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-17 11:25:13,479 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:25:13" (1/1) ... [2023-11-17 11:25:13,499 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:25:13" (1/1) ... [2023-11-17 11:25:13,521 INFO L138 Inliner]: procedures = 176, calls = 60, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 130 [2023-11-17 11:25:13,521 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-17 11:25:13,522 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-17 11:25:13,522 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-17 11:25:13,522 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-17 11:25:13,535 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:25:13" (1/1) ... [2023-11-17 11:25:13,535 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:25:13" (1/1) ... [2023-11-17 11:25:13,538 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:25:13" (1/1) ... [2023-11-17 11:25:13,538 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:25:13" (1/1) ... [2023-11-17 11:25:13,546 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:25:13" (1/1) ... [2023-11-17 11:25:13,548 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:25:13" (1/1) ... [2023-11-17 11:25:13,550 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:25:13" (1/1) ... [2023-11-17 11:25:13,551 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:25:13" (1/1) ... [2023-11-17 11:25:13,555 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-17 11:25:13,555 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-17 11:25:13,556 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-17 11:25:13,556 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-17 11:25:13,556 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:25:13" (1/1) ... [2023-11-17 11:25:13,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 11:25:13,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 11:25:13,586 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-17 11:25:13,590 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-17 11:25:13,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-17 11:25:13,609 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-17 11:25:13,609 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-17 11:25:13,609 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-17 11:25:13,610 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-17 11:25:13,610 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-17 11:25:13,610 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-17 11:25:13,610 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-17 11:25:13,610 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-17 11:25:13,610 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-17 11:25:13,610 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-17 11:25:13,610 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-17 11:25:13,610 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-17 11:25:13,610 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-17 11:25:13,611 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-17 11:25:13,612 WARN L211 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-17 11:25:13,741 INFO L239 CfgBuilder]: Building ICFG [2023-11-17 11:25:13,743 INFO L265 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-17 11:25:14,015 INFO L280 CfgBuilder]: Performing block encoding [2023-11-17 11:25:14,220 INFO L302 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-17 11:25:14,220 INFO L307 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-17 11:25:14,221 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 11:25:14 BoogieIcfgContainer [2023-11-17 11:25:14,222 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-17 11:25:14,225 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-17 11:25:14,225 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-17 11:25:14,228 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-17 11:25:14,228 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 11:25:12" (1/3) ... [2023-11-17 11:25:14,229 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37286c4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 11:25:14, skipping insertion in model container [2023-11-17 11:25:14,229 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:25:13" (2/3) ... [2023-11-17 11:25:14,230 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37286c4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 11:25:14, skipping insertion in model container [2023-11-17 11:25:14,230 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 11:25:14" (3/3) ... [2023-11-17 11:25:14,231 INFO L112 eAbstractionObserver]: Analyzing ICFG mix024_power.opt_pso.opt_rmo.opt.i [2023-11-17 11:25:14,248 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-17 11:25:14,248 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-17 11:25:14,248 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-17 11:25:14,300 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-17 11:25:14,334 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 42 transitions, 96 flow [2023-11-17 11:25:14,369 INFO L124 PetriNetUnfolderBase]: 1/39 cut-off events. [2023-11-17 11:25:14,371 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 11:25:14,377 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49 conditions, 39 events. 1/39 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 75 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 41. Up to 2 conditions per place. [2023-11-17 11:25:14,377 INFO L82 GeneralOperation]: Start removeDead. Operand has 51 places, 42 transitions, 96 flow [2023-11-17 11:25:14,380 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 48 places, 39 transitions, 87 flow [2023-11-17 11:25:14,386 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-11-17 11:25:14,396 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 39 transitions, 87 flow [2023-11-17 11:25:14,399 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 39 transitions, 87 flow [2023-11-17 11:25:14,399 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 39 transitions, 87 flow [2023-11-17 11:25:14,410 INFO L124 PetriNetUnfolderBase]: 1/39 cut-off events. [2023-11-17 11:25:14,410 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 11:25:14,411 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49 conditions, 39 events. 1/39 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 75 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 41. Up to 2 conditions per place. [2023-11-17 11:25:14,412 INFO L119 LiptonReduction]: Number of co-enabled transitions 898 [2023-11-17 11:25:15,622 INFO L134 LiptonReduction]: Checked pairs total: 3165 [2023-11-17 11:25:15,623 INFO L136 LiptonReduction]: Total number of compositions: 21 [2023-11-17 11:25:15,642 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-17 11:25:15,650 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;@2b9e94e0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-17 11:25:15,650 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-11-17 11:25:15,655 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-17 11:25:15,655 INFO L124 PetriNetUnfolderBase]: 0/8 cut-off events. [2023-11-17 11:25:15,655 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 11:25:15,656 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:25:15,656 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-17 11:25:15,657 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 11:25:15,662 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:25:15,662 INFO L85 PathProgramCache]: Analyzing trace with hash 349191107, now seen corresponding path program 1 times [2023-11-17 11:25:15,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:25:15,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121068794] [2023-11-17 11:25:15,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:25:15,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:25:15,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:25:16,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:25:16,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:25:16,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121068794] [2023-11-17 11:25:16,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121068794] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:25:16,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:25:16,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-17 11:25:16,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518256295] [2023-11-17 11:25:16,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:25:16,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 11:25:16,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:25:16,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 11:25:16,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 11:25:16,089 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 63 [2023-11-17 11:25:16,091 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 25 transitions, 59 flow. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:25:16,091 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:25:16,091 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 63 [2023-11-17 11:25:16,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:25:16,425 INFO L124 PetriNetUnfolderBase]: 711/1169 cut-off events. [2023-11-17 11:25:16,425 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2023-11-17 11:25:16,429 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2288 conditions, 1169 events. 711/1169 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 6050 event pairs, 117 based on Foata normal form. 0/1092 useless extension candidates. Maximal degree in co-relation 2277. Up to 859 conditions per place. [2023-11-17 11:25:16,436 INFO L140 encePairwiseOnDemand]: 59/63 looper letters, 27 selfloop transitions, 2 changer transitions 2/35 dead transitions. [2023-11-17 11:25:16,436 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 35 transitions, 144 flow [2023-11-17 11:25:16,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 11:25:16,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 11:25:16,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 100 transitions. [2023-11-17 11:25:16,450 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5291005291005291 [2023-11-17 11:25:16,450 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 100 transitions. [2023-11-17 11:25:16,451 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 100 transitions. [2023-11-17 11:25:16,452 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:25:16,454 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 100 transitions. [2023-11-17 11:25:16,457 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:25:16,461 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 63.0) internal successors, (252), 4 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:25:16,461 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 63.0) internal successors, (252), 4 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:25:16,463 INFO L175 Difference]: Start difference. First operand has 34 places, 25 transitions, 59 flow. Second operand 3 states and 100 transitions. [2023-11-17 11:25:16,463 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 35 transitions, 144 flow [2023-11-17 11:25:16,466 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 35 transitions, 140 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-17 11:25:16,467 INFO L231 Difference]: Finished difference. Result has 32 places, 22 transitions, 54 flow [2023-11-17 11:25:16,469 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=54, PETRI_PLACES=32, PETRI_TRANSITIONS=22} [2023-11-17 11:25:16,472 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, -2 predicate places. [2023-11-17 11:25:16,473 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 22 transitions, 54 flow [2023-11-17 11:25:16,473 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:25:16,473 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:25:16,473 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:25:16,474 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-17 11:25:16,474 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 11:25:16,475 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:25:16,475 INFO L85 PathProgramCache]: Analyzing trace with hash 1966422569, now seen corresponding path program 1 times [2023-11-17 11:25:16,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:25:16,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117880160] [2023-11-17 11:25:16,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:25:16,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:25:16,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:25:16,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:25:16,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:25:16,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117880160] [2023-11-17 11:25:16,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117880160] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:25:16,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:25:16,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-17 11:25:16,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427977320] [2023-11-17 11:25:16,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:25:16,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 11:25:16,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:25:16,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 11:25:16,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 11:25:16,735 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 63 [2023-11-17 11:25:16,736 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 22 transitions, 54 flow. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:25:16,736 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:25:16,736 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 63 [2023-11-17 11:25:16,736 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:25:17,140 INFO L124 PetriNetUnfolderBase]: 1991/2996 cut-off events. [2023-11-17 11:25:17,141 INFO L125 PetriNetUnfolderBase]: For 126/126 co-relation queries the response was YES. [2023-11-17 11:25:17,146 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6204 conditions, 2996 events. 1991/2996 cut-off events. For 126/126 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 14294 event pairs, 629 based on Foata normal form. 94/3090 useless extension candidates. Maximal degree in co-relation 6194. Up to 2086 conditions per place. [2023-11-17 11:25:17,159 INFO L140 encePairwiseOnDemand]: 55/63 looper letters, 34 selfloop transitions, 7 changer transitions 0/41 dead transitions. [2023-11-17 11:25:17,159 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 41 transitions, 180 flow [2023-11-17 11:25:17,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 11:25:17,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 11:25:17,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 90 transitions. [2023-11-17 11:25:17,163 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47619047619047616 [2023-11-17 11:25:17,163 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 90 transitions. [2023-11-17 11:25:17,163 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 90 transitions. [2023-11-17 11:25:17,165 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:25:17,165 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 90 transitions. [2023-11-17 11:25:17,166 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:25:17,167 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 63.0) internal successors, (252), 4 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:25:17,167 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 63.0) internal successors, (252), 4 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:25:17,167 INFO L175 Difference]: Start difference. First operand has 32 places, 22 transitions, 54 flow. Second operand 3 states and 90 transitions. [2023-11-17 11:25:17,167 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 41 transitions, 180 flow [2023-11-17 11:25:17,169 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 41 transitions, 174 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-17 11:25:17,171 INFO L231 Difference]: Finished difference. Result has 33 places, 28 transitions, 104 flow [2023-11-17 11:25:17,171 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=104, PETRI_PLACES=33, PETRI_TRANSITIONS=28} [2023-11-17 11:25:17,172 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, -1 predicate places. [2023-11-17 11:25:17,172 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 28 transitions, 104 flow [2023-11-17 11:25:17,173 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:25:17,173 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:25:17,173 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:25:17,173 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-17 11:25:17,174 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 11:25:17,175 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:25:17,175 INFO L85 PathProgramCache]: Analyzing trace with hash 829557413, now seen corresponding path program 1 times [2023-11-17 11:25:17,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:25:17,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234911788] [2023-11-17 11:25:17,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:25:17,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:25:17,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:25:17,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:25:17,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:25:17,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234911788] [2023-11-17 11:25:17,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234911788] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:25:17,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:25:17,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 11:25:17,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766971020] [2023-11-17 11:25:17,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:25:17,337 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 11:25:17,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:25:17,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 11:25:17,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-17 11:25:17,339 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 63 [2023-11-17 11:25:17,339 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 28 transitions, 104 flow. Second operand has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:25:17,339 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:25:17,339 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 63 [2023-11-17 11:25:17,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:25:17,717 INFO L124 PetriNetUnfolderBase]: 1817/2742 cut-off events. [2023-11-17 11:25:17,717 INFO L125 PetriNetUnfolderBase]: For 1059/1059 co-relation queries the response was YES. [2023-11-17 11:25:17,723 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6981 conditions, 2742 events. 1817/2742 cut-off events. For 1059/1059 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 12701 event pairs, 749 based on Foata normal form. 50/2792 useless extension candidates. Maximal degree in co-relation 6969. Up to 1438 conditions per place. [2023-11-17 11:25:17,739 INFO L140 encePairwiseOnDemand]: 55/63 looper letters, 46 selfloop transitions, 8 changer transitions 0/54 dead transitions. [2023-11-17 11:25:17,739 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 54 transitions, 290 flow [2023-11-17 11:25:17,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 11:25:17,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-17 11:25:17,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 115 transitions. [2023-11-17 11:25:17,744 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45634920634920634 [2023-11-17 11:25:17,744 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 115 transitions. [2023-11-17 11:25:17,744 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 115 transitions. [2023-11-17 11:25:17,744 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:25:17,744 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 115 transitions. [2023-11-17 11:25:17,746 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:25:17,747 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 63.0) internal successors, (315), 5 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:25:17,747 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 63.0) internal successors, (315), 5 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:25:17,747 INFO L175 Difference]: Start difference. First operand has 33 places, 28 transitions, 104 flow. Second operand 4 states and 115 transitions. [2023-11-17 11:25:17,747 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 54 transitions, 290 flow [2023-11-17 11:25:17,754 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 54 transitions, 268 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-17 11:25:17,756 INFO L231 Difference]: Finished difference. Result has 37 places, 32 transitions, 148 flow [2023-11-17 11:25:17,756 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=148, PETRI_PLACES=37, PETRI_TRANSITIONS=32} [2023-11-17 11:25:17,757 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 3 predicate places. [2023-11-17 11:25:17,757 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 32 transitions, 148 flow [2023-11-17 11:25:17,758 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:25:17,758 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:25:17,758 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:25:17,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-17 11:25:17,759 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 11:25:17,759 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:25:17,760 INFO L85 PathProgramCache]: Analyzing trace with hash -190085762, now seen corresponding path program 1 times [2023-11-17 11:25:17,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:25:17,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315815622] [2023-11-17 11:25:17,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:25:17,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:25:17,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:25:17,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:25:17,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:25:17,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315815622] [2023-11-17 11:25:17,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315815622] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:25:17,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:25:17,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 11:25:17,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138438632] [2023-11-17 11:25:17,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:25:17,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 11:25:17,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:25:17,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 11:25:17,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-17 11:25:17,943 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 63 [2023-11-17 11:25:17,944 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 32 transitions, 148 flow. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:25:17,944 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:25:17,944 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 63 [2023-11-17 11:25:17,944 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:25:18,273 INFO L124 PetriNetUnfolderBase]: 1719/2596 cut-off events. [2023-11-17 11:25:18,274 INFO L125 PetriNetUnfolderBase]: For 2146/2146 co-relation queries the response was YES. [2023-11-17 11:25:18,278 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7078 conditions, 2596 events. 1719/2596 cut-off events. For 2146/2146 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 11659 event pairs, 453 based on Foata normal form. 30/2626 useless extension candidates. Maximal degree in co-relation 7063. Up to 1285 conditions per place. [2023-11-17 11:25:18,291 INFO L140 encePairwiseOnDemand]: 56/63 looper letters, 43 selfloop transitions, 10 changer transitions 0/53 dead transitions. [2023-11-17 11:25:18,291 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 53 transitions, 326 flow [2023-11-17 11:25:18,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 11:25:18,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-17 11:25:18,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 108 transitions. [2023-11-17 11:25:18,294 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2023-11-17 11:25:18,294 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 108 transitions. [2023-11-17 11:25:18,294 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 108 transitions. [2023-11-17 11:25:18,294 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:25:18,294 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 108 transitions. [2023-11-17 11:25:18,295 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:25:18,297 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 63.0) internal successors, (315), 5 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:25:18,297 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 63.0) internal successors, (315), 5 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:25:18,297 INFO L175 Difference]: Start difference. First operand has 37 places, 32 transitions, 148 flow. Second operand 4 states and 108 transitions. [2023-11-17 11:25:18,297 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 53 transitions, 326 flow [2023-11-17 11:25:18,302 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 53 transitions, 321 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-17 11:25:18,303 INFO L231 Difference]: Finished difference. Result has 42 places, 36 transitions, 224 flow [2023-11-17 11:25:18,303 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=145, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=224, PETRI_PLACES=42, PETRI_TRANSITIONS=36} [2023-11-17 11:25:18,305 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 8 predicate places. [2023-11-17 11:25:18,305 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 36 transitions, 224 flow [2023-11-17 11:25:18,305 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:25:18,305 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:25:18,305 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:25:18,305 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-17 11:25:18,306 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 11:25:18,306 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:25:18,306 INFO L85 PathProgramCache]: Analyzing trace with hash -2084796257, now seen corresponding path program 1 times [2023-11-17 11:25:18,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:25:18,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792741220] [2023-11-17 11:25:18,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:25:18,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:25:18,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:25:18,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:25:18,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:25:18,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792741220] [2023-11-17 11:25:18,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792741220] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:25:18,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:25:18,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 11:25:18,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141894630] [2023-11-17 11:25:18,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:25:18,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 11:25:18,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:25:18,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 11:25:18,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-17 11:25:18,444 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 63 [2023-11-17 11:25:18,445 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 36 transitions, 224 flow. Second operand has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:25:18,445 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:25:18,445 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 63 [2023-11-17 11:25:18,445 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:25:18,714 INFO L124 PetriNetUnfolderBase]: 886/1583 cut-off events. [2023-11-17 11:25:18,715 INFO L125 PetriNetUnfolderBase]: For 1427/1477 co-relation queries the response was YES. [2023-11-17 11:25:18,724 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4222 conditions, 1583 events. 886/1583 cut-off events. For 1427/1477 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 9142 event pairs, 210 based on Foata normal form. 164/1707 useless extension candidates. Maximal degree in co-relation 4203. Up to 570 conditions per place. [2023-11-17 11:25:18,729 INFO L140 encePairwiseOnDemand]: 57/63 looper letters, 48 selfloop transitions, 5 changer transitions 0/67 dead transitions. [2023-11-17 11:25:18,730 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 67 transitions, 460 flow [2023-11-17 11:25:18,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 11:25:18,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-17 11:25:18,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 115 transitions. [2023-11-17 11:25:18,731 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45634920634920634 [2023-11-17 11:25:18,731 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 115 transitions. [2023-11-17 11:25:18,731 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 115 transitions. [2023-11-17 11:25:18,731 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:25:18,731 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 115 transitions. [2023-11-17 11:25:18,732 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:25:18,733 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 63.0) internal successors, (315), 5 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:25:18,734 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 63.0) internal successors, (315), 5 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:25:18,734 INFO L175 Difference]: Start difference. First operand has 42 places, 36 transitions, 224 flow. Second operand 4 states and 115 transitions. [2023-11-17 11:25:18,734 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 67 transitions, 460 flow [2023-11-17 11:25:18,739 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 67 transitions, 456 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-17 11:25:18,740 INFO L231 Difference]: Finished difference. Result has 46 places, 40 transitions, 258 flow [2023-11-17 11:25:18,741 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=258, PETRI_PLACES=46, PETRI_TRANSITIONS=40} [2023-11-17 11:25:18,742 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 12 predicate places. [2023-11-17 11:25:18,743 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 40 transitions, 258 flow [2023-11-17 11:25:18,743 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:25:18,743 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:25:18,743 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:25:18,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-17 11:25:18,743 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 11:25:18,744 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:25:18,744 INFO L85 PathProgramCache]: Analyzing trace with hash -1957360719, now seen corresponding path program 1 times [2023-11-17 11:25:18,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:25:18,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138966084] [2023-11-17 11:25:18,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:25:18,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:25:18,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:25:18,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:25:18,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:25:18,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138966084] [2023-11-17 11:25:18,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138966084] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:25:18,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:25:18,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-17 11:25:18,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075227512] [2023-11-17 11:25:18,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:25:18,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-17 11:25:18,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:25:18,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-17 11:25:18,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-17 11:25:18,908 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 63 [2023-11-17 11:25:18,908 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 40 transitions, 258 flow. Second operand has 5 states, 5 states have (on average 20.6) internal successors, (103), 5 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:25:18,908 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:25:18,908 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 63 [2023-11-17 11:25:18,908 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:25:19,168 INFO L124 PetriNetUnfolderBase]: 684/1275 cut-off events. [2023-11-17 11:25:19,169 INFO L125 PetriNetUnfolderBase]: For 1501/1543 co-relation queries the response was YES. [2023-11-17 11:25:19,172 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4124 conditions, 1275 events. 684/1275 cut-off events. For 1501/1543 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 7341 event pairs, 202 based on Foata normal form. 102/1323 useless extension candidates. Maximal degree in co-relation 4102. Up to 487 conditions per place. [2023-11-17 11:25:19,177 INFO L140 encePairwiseOnDemand]: 57/63 looper letters, 57 selfloop transitions, 8 changer transitions 0/79 dead transitions. [2023-11-17 11:25:19,177 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 79 transitions, 559 flow [2023-11-17 11:25:19,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 11:25:19,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 11:25:19,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 145 transitions. [2023-11-17 11:25:19,178 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4603174603174603 [2023-11-17 11:25:19,179 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 145 transitions. [2023-11-17 11:25:19,179 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 145 transitions. [2023-11-17 11:25:19,179 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:25:19,179 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 145 transitions. [2023-11-17 11:25:19,180 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 29.0) internal successors, (145), 5 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:25:19,180 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 63.0) internal successors, (378), 6 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:25:19,181 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 63.0) internal successors, (378), 6 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:25:19,181 INFO L175 Difference]: Start difference. First operand has 46 places, 40 transitions, 258 flow. Second operand 5 states and 145 transitions. [2023-11-17 11:25:19,181 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 79 transitions, 559 flow [2023-11-17 11:25:19,184 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 79 transitions, 556 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-17 11:25:19,185 INFO L231 Difference]: Finished difference. Result has 51 places, 44 transitions, 310 flow [2023-11-17 11:25:19,186 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=256, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=310, PETRI_PLACES=51, PETRI_TRANSITIONS=44} [2023-11-17 11:25:19,188 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 17 predicate places. [2023-11-17 11:25:19,188 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 44 transitions, 310 flow [2023-11-17 11:25:19,188 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.6) internal successors, (103), 5 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:25:19,188 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:25:19,188 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:25:19,188 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-17 11:25:19,189 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 11:25:19,189 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:25:19,189 INFO L85 PathProgramCache]: Analyzing trace with hash 814960777, now seen corresponding path program 1 times [2023-11-17 11:25:19,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:25:19,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220899957] [2023-11-17 11:25:19,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:25:19,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:25:19,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:25:19,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:25:19,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:25:19,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220899957] [2023-11-17 11:25:19,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220899957] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:25:19,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:25:19,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 11:25:19,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129274219] [2023-11-17 11:25:19,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:25:19,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 11:25:19,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:25:19,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 11:25:19,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-17 11:25:19,384 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 63 [2023-11-17 11:25:19,384 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 44 transitions, 310 flow. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:25:19,384 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:25:19,384 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 63 [2023-11-17 11:25:19,385 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:25:19,728 INFO L124 PetriNetUnfolderBase]: 1349/2258 cut-off events. [2023-11-17 11:25:19,728 INFO L125 PetriNetUnfolderBase]: For 6454/6454 co-relation queries the response was YES. [2023-11-17 11:25:19,734 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8976 conditions, 2258 events. 1349/2258 cut-off events. For 6454/6454 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 12069 event pairs, 138 based on Foata normal form. 9/2267 useless extension candidates. Maximal degree in co-relation 8951. Up to 1109 conditions per place. [2023-11-17 11:25:19,742 INFO L140 encePairwiseOnDemand]: 54/63 looper letters, 71 selfloop transitions, 23 changer transitions 9/103 dead transitions. [2023-11-17 11:25:19,742 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 103 transitions, 869 flow [2023-11-17 11:25:19,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 11:25:19,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 11:25:19,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 142 transitions. [2023-11-17 11:25:19,744 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4507936507936508 [2023-11-17 11:25:19,744 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 142 transitions. [2023-11-17 11:25:19,744 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 142 transitions. [2023-11-17 11:25:19,744 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:25:19,744 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 142 transitions. [2023-11-17 11:25:19,744 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 28.4) internal successors, (142), 5 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:25:19,745 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 63.0) internal successors, (378), 6 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:25:19,745 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 63.0) internal successors, (378), 6 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:25:19,745 INFO L175 Difference]: Start difference. First operand has 51 places, 44 transitions, 310 flow. Second operand 5 states and 142 transitions. [2023-11-17 11:25:19,745 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 103 transitions, 869 flow [2023-11-17 11:25:19,756 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 103 transitions, 833 flow, removed 10 selfloop flow, removed 2 redundant places. [2023-11-17 11:25:19,759 INFO L231 Difference]: Finished difference. Result has 56 places, 53 transitions, 469 flow [2023-11-17 11:25:19,759 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=298, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=469, PETRI_PLACES=56, PETRI_TRANSITIONS=53} [2023-11-17 11:25:19,760 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 22 predicate places. [2023-11-17 11:25:19,760 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 53 transitions, 469 flow [2023-11-17 11:25:19,762 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:25:19,762 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:25:19,763 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:25:19,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-17 11:25:19,763 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 11:25:19,764 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:25:19,764 INFO L85 PathProgramCache]: Analyzing trace with hash -1244884609, now seen corresponding path program 2 times [2023-11-17 11:25:19,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:25:19,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366954625] [2023-11-17 11:25:19,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:25:19,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:25:19,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:25:19,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:25:19,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:25:19,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366954625] [2023-11-17 11:25:19,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366954625] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:25:19,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:25:19,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-17 11:25:19,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862989192] [2023-11-17 11:25:19,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:25:19,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-17 11:25:19,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:25:19,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-17 11:25:19,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-17 11:25:19,987 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 63 [2023-11-17 11:25:19,987 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 53 transitions, 469 flow. Second operand has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:25:19,987 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:25:19,987 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 63 [2023-11-17 11:25:19,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:25:20,294 INFO L124 PetriNetUnfolderBase]: 701/1277 cut-off events. [2023-11-17 11:25:20,294 INFO L125 PetriNetUnfolderBase]: For 4642/4642 co-relation queries the response was YES. [2023-11-17 11:25:20,298 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5734 conditions, 1277 events. 701/1277 cut-off events. For 4642/4642 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 6456 event pairs, 101 based on Foata normal form. 9/1286 useless extension candidates. Maximal degree in co-relation 5706. Up to 487 conditions per place. [2023-11-17 11:25:20,303 INFO L140 encePairwiseOnDemand]: 54/63 looper letters, 68 selfloop transitions, 21 changer transitions 24/113 dead transitions. [2023-11-17 11:25:20,303 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 113 transitions, 1047 flow [2023-11-17 11:25:20,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-17 11:25:20,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-17 11:25:20,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 168 transitions. [2023-11-17 11:25:20,305 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2023-11-17 11:25:20,305 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 168 transitions. [2023-11-17 11:25:20,305 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 168 transitions. [2023-11-17 11:25:20,305 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:25:20,305 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 168 transitions. [2023-11-17 11:25:20,306 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 28.0) internal successors, (168), 6 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:25:20,306 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 63.0) internal successors, (441), 7 states have internal predecessors, (441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:25:20,307 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 63.0) internal successors, (441), 7 states have internal predecessors, (441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:25:20,307 INFO L175 Difference]: Start difference. First operand has 56 places, 53 transitions, 469 flow. Second operand 6 states and 168 transitions. [2023-11-17 11:25:20,307 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 113 transitions, 1047 flow [2023-11-17 11:25:20,321 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 113 transitions, 967 flow, removed 13 selfloop flow, removed 3 redundant places. [2023-11-17 11:25:20,323 INFO L231 Difference]: Finished difference. Result has 59 places, 47 transitions, 423 flow [2023-11-17 11:25:20,323 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=447, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=423, PETRI_PLACES=59, PETRI_TRANSITIONS=47} [2023-11-17 11:25:20,324 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 25 predicate places. [2023-11-17 11:25:20,324 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 47 transitions, 423 flow [2023-11-17 11:25:20,324 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:25:20,324 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:25:20,324 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:25:20,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-17 11:25:20,324 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 11:25:20,325 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:25:20,325 INFO L85 PathProgramCache]: Analyzing trace with hash 2063220863, now seen corresponding path program 3 times [2023-11-17 11:25:20,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:25:20,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182859816] [2023-11-17 11:25:20,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:25:20,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:25:20,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:25:20,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:25:20,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:25:20,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182859816] [2023-11-17 11:25:20,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182859816] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:25:20,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:25:20,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-17 11:25:20,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905003642] [2023-11-17 11:25:20,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:25:20,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-17 11:25:20,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:25:20,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-17 11:25:20,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-17 11:25:20,471 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 63 [2023-11-17 11:25:20,472 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 47 transitions, 423 flow. Second operand has 6 states, 6 states have (on average 20.5) internal successors, (123), 6 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:25:20,472 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:25:20,472 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 63 [2023-11-17 11:25:20,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:25:20,651 INFO L124 PetriNetUnfolderBase]: 340/690 cut-off events. [2023-11-17 11:25:20,652 INFO L125 PetriNetUnfolderBase]: For 2017/2089 co-relation queries the response was YES. [2023-11-17 11:25:20,654 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2657 conditions, 690 events. 340/690 cut-off events. For 2017/2089 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 3627 event pairs, 87 based on Foata normal form. 37/709 useless extension candidates. Maximal degree in co-relation 2628. Up to 239 conditions per place. [2023-11-17 11:25:20,656 INFO L140 encePairwiseOnDemand]: 57/63 looper letters, 31 selfloop transitions, 11 changer transitions 22/75 dead transitions. [2023-11-17 11:25:20,656 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 75 transitions, 723 flow [2023-11-17 11:25:20,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-17 11:25:20,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-17 11:25:20,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 153 transitions. [2023-11-17 11:25:20,657 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40476190476190477 [2023-11-17 11:25:20,657 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 153 transitions. [2023-11-17 11:25:20,657 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 153 transitions. [2023-11-17 11:25:20,658 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:25:20,658 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 153 transitions. [2023-11-17 11:25:20,658 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 25.5) internal successors, (153), 6 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:25:20,659 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 63.0) internal successors, (441), 7 states have internal predecessors, (441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:25:20,659 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 63.0) internal successors, (441), 7 states have internal predecessors, (441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:25:20,659 INFO L175 Difference]: Start difference. First operand has 59 places, 47 transitions, 423 flow. Second operand 6 states and 153 transitions. [2023-11-17 11:25:20,659 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 75 transitions, 723 flow [2023-11-17 11:25:20,663 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 75 transitions, 633 flow, removed 3 selfloop flow, removed 8 redundant places. [2023-11-17 11:25:20,664 INFO L231 Difference]: Finished difference. Result has 58 places, 37 transitions, 282 flow [2023-11-17 11:25:20,664 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=358, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=282, PETRI_PLACES=58, PETRI_TRANSITIONS=37} [2023-11-17 11:25:20,665 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 24 predicate places. [2023-11-17 11:25:20,665 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 37 transitions, 282 flow [2023-11-17 11:25:20,665 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.5) internal successors, (123), 6 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:25:20,665 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:25:20,666 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:25:20,666 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-17 11:25:20,666 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 11:25:20,666 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:25:20,666 INFO L85 PathProgramCache]: Analyzing trace with hash 1511391520, now seen corresponding path program 1 times [2023-11-17 11:25:20,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:25:20,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28210311] [2023-11-17 11:25:20,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:25:20,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:25:20,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:25:20,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:25:20,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:25:20,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28210311] [2023-11-17 11:25:20,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28210311] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:25:20,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:25:20,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 11:25:20,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374011177] [2023-11-17 11:25:20,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:25:20,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 11:25:20,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:25:20,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 11:25:20,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 11:25:20,829 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 63 [2023-11-17 11:25:20,829 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 37 transitions, 282 flow. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:25:20,829 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:25:20,829 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 63 [2023-11-17 11:25:20,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:25:20,929 INFO L124 PetriNetUnfolderBase]: 264/544 cut-off events. [2023-11-17 11:25:20,929 INFO L125 PetriNetUnfolderBase]: For 1657/1699 co-relation queries the response was YES. [2023-11-17 11:25:20,931 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2165 conditions, 544 events. 264/544 cut-off events. For 1657/1699 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2585 event pairs, 115 based on Foata normal form. 1/540 useless extension candidates. Maximal degree in co-relation 2138. Up to 275 conditions per place. [2023-11-17 11:25:20,933 INFO L140 encePairwiseOnDemand]: 60/63 looper letters, 28 selfloop transitions, 2 changer transitions 24/56 dead transitions. [2023-11-17 11:25:20,933 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 56 transitions, 512 flow [2023-11-17 11:25:20,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 11:25:20,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 11:25:20,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 88 transitions. [2023-11-17 11:25:20,934 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4656084656084656 [2023-11-17 11:25:20,934 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 88 transitions. [2023-11-17 11:25:20,934 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 88 transitions. [2023-11-17 11:25:20,934 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:25:20,934 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 88 transitions. [2023-11-17 11:25:20,934 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:25:20,935 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 63.0) internal successors, (252), 4 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:25:20,935 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 63.0) internal successors, (252), 4 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:25:20,935 INFO L175 Difference]: Start difference. First operand has 58 places, 37 transitions, 282 flow. Second operand 3 states and 88 transitions. [2023-11-17 11:25:20,935 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 56 transitions, 512 flow [2023-11-17 11:25:20,940 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 56 transitions, 377 flow, removed 24 selfloop flow, removed 12 redundant places. [2023-11-17 11:25:20,941 INFO L231 Difference]: Finished difference. Result has 48 places, 28 transitions, 121 flow [2023-11-17 11:25:20,941 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=205, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=121, PETRI_PLACES=48, PETRI_TRANSITIONS=28} [2023-11-17 11:25:20,941 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 14 predicate places. [2023-11-17 11:25:20,942 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 28 transitions, 121 flow [2023-11-17 11:25:20,942 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:25:20,942 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:25:20,942 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:25:20,942 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-17 11:25:20,942 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 11:25:20,942 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:25:20,943 INFO L85 PathProgramCache]: Analyzing trace with hash -147124430, now seen corresponding path program 2 times [2023-11-17 11:25:20,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:25:20,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885012226] [2023-11-17 11:25:20,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:25:20,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:25:20,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:25:21,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:25:21,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:25:21,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885012226] [2023-11-17 11:25:21,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885012226] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:25:21,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:25:21,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-17 11:25:21,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722037230] [2023-11-17 11:25:21,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:25:21,395 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-17 11:25:21,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:25:21,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-17 11:25:21,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-17 11:25:21,396 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 63 [2023-11-17 11:25:21,396 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 28 transitions, 121 flow. Second operand has 6 states, 6 states have (on average 24.0) internal successors, (144), 6 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:25:21,396 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:25:21,396 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 63 [2023-11-17 11:25:21,396 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:25:21,506 INFO L124 PetriNetUnfolderBase]: 69/168 cut-off events. [2023-11-17 11:25:21,507 INFO L125 PetriNetUnfolderBase]: For 95/104 co-relation queries the response was YES. [2023-11-17 11:25:21,507 INFO L83 FinitePrefix]: Finished finitePrefix Result has 481 conditions, 168 events. 69/168 cut-off events. For 95/104 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 587 event pairs, 10 based on Foata normal form. 1/166 useless extension candidates. Maximal degree in co-relation 461. Up to 86 conditions per place. [2023-11-17 11:25:21,508 INFO L140 encePairwiseOnDemand]: 57/63 looper letters, 30 selfloop transitions, 6 changer transitions 17/57 dead transitions. [2023-11-17 11:25:21,508 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 57 transitions, 332 flow [2023-11-17 11:25:21,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-17 11:25:21,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-17 11:25:21,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 187 transitions. [2023-11-17 11:25:21,509 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42403628117913833 [2023-11-17 11:25:21,509 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 187 transitions. [2023-11-17 11:25:21,509 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 187 transitions. [2023-11-17 11:25:21,510 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:25:21,510 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 187 transitions. [2023-11-17 11:25:21,510 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 26.714285714285715) internal successors, (187), 7 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:25:21,512 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 63.0) internal successors, (504), 8 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:25:21,513 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 63.0) internal successors, (504), 8 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:25:21,513 INFO L175 Difference]: Start difference. First operand has 48 places, 28 transitions, 121 flow. Second operand 7 states and 187 transitions. [2023-11-17 11:25:21,513 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 57 transitions, 332 flow [2023-11-17 11:25:21,514 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 57 transitions, 306 flow, removed 3 selfloop flow, removed 8 redundant places. [2023-11-17 11:25:21,514 INFO L231 Difference]: Finished difference. Result has 46 places, 32 transitions, 137 flow [2023-11-17 11:25:21,515 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=99, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=137, PETRI_PLACES=46, PETRI_TRANSITIONS=32} [2023-11-17 11:25:21,515 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 12 predicate places. [2023-11-17 11:25:21,515 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 32 transitions, 137 flow [2023-11-17 11:25:21,515 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.0) internal successors, (144), 6 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:25:21,515 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:25:21,515 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:25:21,516 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-17 11:25:21,516 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 11:25:21,516 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:25:21,516 INFO L85 PathProgramCache]: Analyzing trace with hash -669452768, now seen corresponding path program 3 times [2023-11-17 11:25:21,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:25:21,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427856542] [2023-11-17 11:25:21,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:25:21,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:25:21,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:25:22,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:25:22,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:25:22,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427856542] [2023-11-17 11:25:22,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427856542] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:25:22,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:25:22,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-17 11:25:22,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208388795] [2023-11-17 11:25:22,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:25:22,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-17 11:25:22,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:25:22,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-17 11:25:22,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-17 11:25:22,198 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 63 [2023-11-17 11:25:22,198 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 32 transitions, 137 flow. Second operand has 7 states, 7 states have (on average 23.571428571428573) internal successors, (165), 7 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:25:22,198 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:25:22,198 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 63 [2023-11-17 11:25:22,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:25:22,374 INFO L124 PetriNetUnfolderBase]: 58/145 cut-off events. [2023-11-17 11:25:22,374 INFO L125 PetriNetUnfolderBase]: For 144/164 co-relation queries the response was YES. [2023-11-17 11:25:22,375 INFO L83 FinitePrefix]: Finished finitePrefix Result has 462 conditions, 145 events. 58/145 cut-off events. For 144/164 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 458 event pairs, 7 based on Foata normal form. 12/155 useless extension candidates. Maximal degree in co-relation 450. Up to 81 conditions per place. [2023-11-17 11:25:22,375 INFO L140 encePairwiseOnDemand]: 57/63 looper letters, 29 selfloop transitions, 4 changer transitions 18/55 dead transitions. [2023-11-17 11:25:22,375 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 55 transitions, 327 flow [2023-11-17 11:25:22,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-17 11:25:22,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-17 11:25:22,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 181 transitions. [2023-11-17 11:25:22,377 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41043083900226757 [2023-11-17 11:25:22,377 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 181 transitions. [2023-11-17 11:25:22,377 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 181 transitions. [2023-11-17 11:25:22,377 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:25:22,377 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 181 transitions. [2023-11-17 11:25:22,378 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 25.857142857142858) internal successors, (181), 7 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:25:22,378 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 63.0) internal successors, (504), 8 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:25:22,379 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 63.0) internal successors, (504), 8 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:25:22,379 INFO L175 Difference]: Start difference. First operand has 46 places, 32 transitions, 137 flow. Second operand 7 states and 181 transitions. [2023-11-17 11:25:22,379 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 55 transitions, 327 flow [2023-11-17 11:25:22,379 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 55 transitions, 323 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-11-17 11:25:22,380 INFO L231 Difference]: Finished difference. Result has 50 places, 30 transitions, 136 flow [2023-11-17 11:25:22,380 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=133, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=136, PETRI_PLACES=50, PETRI_TRANSITIONS=30} [2023-11-17 11:25:22,381 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 16 predicate places. [2023-11-17 11:25:22,381 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 30 transitions, 136 flow [2023-11-17 11:25:22,381 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.571428571428573) internal successors, (165), 7 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:25:22,381 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:25:22,381 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:25:22,381 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-17 11:25:22,382 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 11:25:22,382 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:25:22,382 INFO L85 PathProgramCache]: Analyzing trace with hash 1710050860, now seen corresponding path program 4 times [2023-11-17 11:25:22,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:25:22,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112253983] [2023-11-17 11:25:22,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:25:22,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:25:22,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-17 11:25:22,411 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-17 11:25:22,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-17 11:25:22,472 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-17 11:25:22,472 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-17 11:25:22,477 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2023-11-17 11:25:22,479 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-11-17 11:25:22,479 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2023-11-17 11:25:22,479 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2023-11-17 11:25:22,479 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2023-11-17 11:25:22,480 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-11-17 11:25:22,480 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-17 11:25:22,480 INFO L445 BasicCegarLoop]: Path program histogram: [4, 3, 1, 1, 1, 1, 1, 1] [2023-11-17 11:25:22,485 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-17 11:25:22,485 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-17 11:25:22,528 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-17 11:25:22,530 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-17 11:25:22,531 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-17 11:25:22,548 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.11 11:25:22 BasicIcfg [2023-11-17 11:25:22,548 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-17 11:25:22,549 INFO L158 Benchmark]: Toolchain (without parser) took 9581.24ms. Allocated memory was 297.8MB in the beginning and 386.9MB in the end (delta: 89.1MB). Free memory was 243.9MB in the beginning and 288.6MB in the end (delta: -44.7MB). Peak memory consumption was 45.0MB. Max. memory is 8.0GB. [2023-11-17 11:25:22,549 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 212.9MB. Free memory is still 164.6MB. There was no memory consumed. Max. memory is 8.0GB. [2023-11-17 11:25:22,549 INFO L158 Benchmark]: CACSL2BoogieTranslator took 502.44ms. Allocated memory is still 297.8MB. Free memory was 243.9MB in the beginning and 220.3MB in the end (delta: 23.6MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. [2023-11-17 11:25:22,549 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.60ms. Allocated memory is still 297.8MB. Free memory was 220.3MB in the beginning and 218.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-11-17 11:25:22,549 INFO L158 Benchmark]: Boogie Preprocessor took 33.01ms. Allocated memory is still 297.8MB. Free memory was 218.2MB in the beginning and 216.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-11-17 11:25:22,550 INFO L158 Benchmark]: RCFGBuilder took 666.24ms. Allocated memory is still 297.8MB. Free memory was 216.1MB in the beginning and 168.9MB in the end (delta: 47.2MB). Peak memory consumption was 47.2MB. Max. memory is 8.0GB. [2023-11-17 11:25:22,550 INFO L158 Benchmark]: TraceAbstraction took 8323.55ms. Allocated memory was 297.8MB in the beginning and 386.9MB in the end (delta: 89.1MB). Free memory was 168.4MB in the beginning and 288.6MB in the end (delta: -120.2MB). There was no memory consumed. Max. memory is 8.0GB. [2023-11-17 11:25:22,551 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.14ms. Allocated memory is still 212.9MB. Free memory is still 164.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 502.44ms. Allocated memory is still 297.8MB. Free memory was 243.9MB in the beginning and 220.3MB in the end (delta: 23.6MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 49.60ms. Allocated memory is still 297.8MB. Free memory was 220.3MB in the beginning and 218.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 33.01ms. Allocated memory is still 297.8MB. Free memory was 218.2MB in the beginning and 216.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 666.24ms. Allocated memory is still 297.8MB. Free memory was 216.1MB in the beginning and 168.9MB in the end (delta: 47.2MB). Peak memory consumption was 47.2MB. Max. memory is 8.0GB. * TraceAbstraction took 8323.55ms. Allocated memory was 297.8MB in the beginning and 386.9MB in the end (delta: 89.1MB). Free memory was 168.4MB in the beginning and 288.6MB in the end (delta: -120.2MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre9 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: 1.2s, 48 PlacesBefore, 34 PlacesAfterwards, 39 TransitionsBefore, 25 TransitionsAfterwards, 898 CoEnabledTransitionPairs, 5 FixpointIterations, 0 TrivialSequentialCompositions, 20 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 21 TotalNumberOfCompositions, 3165 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1316, independent: 1169, independent conditional: 0, independent unconditional: 1169, dependent: 147, dependent conditional: 0, dependent unconditional: 147, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 622, independent: 579, independent conditional: 0, independent unconditional: 579, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 622, independent: 561, independent conditional: 0, independent unconditional: 561, dependent: 61, dependent conditional: 0, dependent unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 61, independent: 18, independent conditional: 0, independent unconditional: 18, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 284, independent: 25, independent conditional: 0, independent unconditional: 25, dependent: 258, dependent conditional: 0, dependent unconditional: 258, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1316, independent: 590, independent conditional: 0, independent unconditional: 590, dependent: 104, dependent conditional: 0, dependent unconditional: 104, unknown: 622, unknown conditional: 0, unknown unconditional: 622] , Statistics on independence cache: Total cache size (in pairs): 144, Positive cache size: 121, Positive conditional cache size: 0, Positive unconditional cache size: 121, Negative cache size: 23, Negative conditional cache size: 0, Negative unconditional cache size: 23, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p0_EBX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L718] 0 int __unbuffered_p2_EBX = 0; [L720] 0 int a = 0; [L721] 0 _Bool main$tmp_guard0; [L722] 0 _Bool main$tmp_guard1; [L724] 0 int x = 0; [L726] 0 int y = 0; [L727] 0 _Bool y$flush_delayed; [L728] 0 int y$mem_tmp; [L729] 0 _Bool y$r_buff0_thd0; [L730] 0 _Bool y$r_buff0_thd1; [L731] 0 _Bool y$r_buff0_thd2; [L732] 0 _Bool y$r_buff0_thd3; [L733] 0 _Bool y$r_buff1_thd0; [L734] 0 _Bool y$r_buff1_thd1; [L735] 0 _Bool y$r_buff1_thd2; [L736] 0 _Bool y$r_buff1_thd3; [L737] 0 _Bool y$read_delayed; [L738] 0 int *y$read_delayed_var; [L739] 0 int y$w_buff0; [L740] 0 _Bool y$w_buff0_used; [L741] 0 int y$w_buff1; [L742] 0 _Bool y$w_buff1_used; [L744] 0 int z = 0; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L844] 0 pthread_t t636; [L845] FCALL, FORK 0 pthread_create(&t636, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t636={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L846] 0 pthread_t t637; [L847] FCALL, FORK 0 pthread_create(&t637, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t636={5:0}, t637={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L848] 0 pthread_t t638; [L849] FCALL, FORK 0 pthread_create(&t638, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t636={5:0}, t637={6:0}, t638={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L784] 2 y$w_buff1 = y$w_buff0 [L785] 2 y$w_buff0 = 1 [L786] 2 y$w_buff1_used = y$w_buff0_used [L787] 2 y$w_buff0_used = (_Bool)1 [L788] CALL 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L788] RET 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L789] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L790] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L791] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L792] 2 y$r_buff1_thd3 = y$r_buff0_thd3 [L793] 2 y$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L796] 2 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L813] 3 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L816] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L819] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L750] 1 a = 1 [L753] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L756] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L759] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L760] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L761] 1 y$flush_delayed = weak$$choice2 [L762] 1 y$mem_tmp = y [L763] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L764] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L765] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L766] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L767] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L768] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L769] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L770] 1 __unbuffered_p0_EBX = y [L771] 1 y = y$flush_delayed ? y$mem_tmp : y [L772] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L822] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L823] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L824] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L825] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L826] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L799] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L800] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L801] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L802] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L803] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L806] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L808] 2 return 0; [L829] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L831] 3 return 0; [L777] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L779] 1 return 0; [L851] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t636={5:0}, t637={6:0}, t638={3:0}, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L853] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L853] RET 0 assume_abort_if_not(main$tmp_guard0) [L855] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L856] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L857] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L858] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L859] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t636={5:0}, t637={6:0}, t638={3:0}, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L862] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0) [L864] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 845]: 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: 849]: 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: 847]: 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 7 procedures, 70 locations, 6 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: 8.1s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 3.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 1.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 349 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 349 mSDsluCounter, 40 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8 mSDsCounter, 35 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 802 IncrementalHoareTripleChecker+Invalid, 837 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 35 mSolverCounterUnsat, 32 mSDtfsCounter, 802 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 51 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=469occurred in iteration=7, InterpolantAutomatonStates: 57, 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, 2.6s InterpolantComputationTime, 205 NumberOfCodeBlocks, 205 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 171 ConstructedInterpolants, 0 QuantifiedInterpolants, 1223 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-11-17 11:25:22,571 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...