/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix008_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.dk.datarace-free-lbe-02cf818-m [2023-11-17 15:12:24,592 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-17 15:12:24,676 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf [2023-11-17 15:12:24,708 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-17 15:12:24,709 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-17 15:12:24,710 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-17 15:12:24,710 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-17 15:12:24,710 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-17 15:12:24,711 INFO L153 SettingsManager]: * Use SBE=true [2023-11-17 15:12:24,714 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-17 15:12:24,715 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-17 15:12:24,715 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-17 15:12:24,715 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-17 15:12:24,717 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-17 15:12:24,717 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-17 15:12:24,717 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-17 15:12:24,717 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-17 15:12:24,717 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-17 15:12:24,718 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-17 15:12:24,718 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-17 15:12:24,718 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-17 15:12:24,719 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-17 15:12:24,719 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-17 15:12:24,719 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-17 15:12:24,719 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-17 15:12:24,720 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 15:12:24,721 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-17 15:12:24,721 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-17 15:12:24,721 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-17 15:12:24,721 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-17 15:12:24,722 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-17 15:12:24,722 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-17 15:12:24,722 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2023-11-17 15:12:24,964 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-17 15:12:24,991 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-17 15:12:24,993 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-17 15:12:24,994 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-17 15:12:24,994 INFO L274 PluginConnector]: CDTParser initialized [2023-11-17 15:12:24,995 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix008_tso.oepc.i [2023-11-17 15:12:26,152 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-17 15:12:26,418 INFO L384 CDTParser]: Found 1 translation units. [2023-11-17 15:12:26,433 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix008_tso.oepc.i [2023-11-17 15:12:26,453 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b1a6b02c/a5069fa251334b21b4644bb94e75fae2/FLAG11c4bac3b [2023-11-17 15:12:26,471 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b1a6b02c/a5069fa251334b21b4644bb94e75fae2 [2023-11-17 15:12:26,474 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-17 15:12:26,475 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-17 15:12:26,477 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-17 15:12:26,477 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-17 15:12:26,481 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-17 15:12:26,482 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 03:12:26" (1/1) ... [2023-11-17 15:12:26,483 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d6724bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:12:26, skipping insertion in model container [2023-11-17 15:12:26,484 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 03:12:26" (1/1) ... [2023-11-17 15:12:26,545 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-17 15:12:26,716 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/mix008_tso.oepc.i[949,962] [2023-11-17 15:12:26,994 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 15:12:27,014 INFO L202 MainTranslator]: Completed pre-run [2023-11-17 15:12:27,029 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/mix008_tso.oepc.i[949,962] [2023-11-17 15:12:27,099 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 15:12:27,136 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-17 15:12:27,136 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-17 15:12:27,143 INFO L206 MainTranslator]: Completed translation [2023-11-17 15:12:27,143 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:12:27 WrapperNode [2023-11-17 15:12:27,143 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-17 15:12:27,144 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-17 15:12:27,144 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-17 15:12:27,144 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-17 15:12:27,151 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:12:27" (1/1) ... [2023-11-17 15:12:27,182 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:12:27" (1/1) ... [2023-11-17 15:12:27,233 INFO L138 Inliner]: procedures = 177, calls = 72, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 281 [2023-11-17 15:12:27,234 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-17 15:12:27,234 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-17 15:12:27,235 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-17 15:12:27,235 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-17 15:12:27,243 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:12:27" (1/1) ... [2023-11-17 15:12:27,243 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:12:27" (1/1) ... [2023-11-17 15:12:27,256 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:12:27" (1/1) ... [2023-11-17 15:12:27,257 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:12:27" (1/1) ... [2023-11-17 15:12:27,282 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:12:27" (1/1) ... [2023-11-17 15:12:27,284 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:12:27" (1/1) ... [2023-11-17 15:12:27,287 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:12:27" (1/1) ... [2023-11-17 15:12:27,288 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:12:27" (1/1) ... [2023-11-17 15:12:27,292 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-17 15:12:27,293 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-17 15:12:27,293 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-17 15:12:27,293 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-17 15:12:27,294 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:12:27" (1/1) ... [2023-11-17 15:12:27,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 15:12:27,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 15:12:27,339 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-17 15:12:27,362 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-17 15:12:27,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-17 15:12:27,369 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-17 15:12:27,369 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-17 15:12:27,370 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-17 15:12:27,370 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-17 15:12:27,370 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-17 15:12:27,371 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-17 15:12:27,371 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-17 15:12:27,371 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-17 15:12:27,371 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-17 15:12:27,371 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-17 15:12:27,371 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-11-17 15:12:27,371 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-11-17 15:12:27,371 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-17 15:12:27,371 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-17 15:12:27,372 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-17 15:12:27,372 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-17 15:12:27,373 WARN L211 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-17 15:12:27,553 INFO L239 CfgBuilder]: Building ICFG [2023-11-17 15:12:27,555 INFO L265 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-17 15:12:28,014 INFO L280 CfgBuilder]: Performing block encoding [2023-11-17 15:12:28,190 INFO L302 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-17 15:12:28,190 INFO L307 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-17 15:12:28,192 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 03:12:28 BoogieIcfgContainer [2023-11-17 15:12:28,192 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-17 15:12:28,194 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-17 15:12:28,195 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-17 15:12:28,197 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-17 15:12:28,197 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 03:12:26" (1/3) ... [2023-11-17 15:12:28,198 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ed376bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 03:12:28, skipping insertion in model container [2023-11-17 15:12:28,198 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:12:27" (2/3) ... [2023-11-17 15:12:28,198 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ed376bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 03:12:28, skipping insertion in model container [2023-11-17 15:12:28,199 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 03:12:28" (3/3) ... [2023-11-17 15:12:28,199 INFO L112 eAbstractionObserver]: Analyzing ICFG mix008_tso.oepc.i [2023-11-17 15:12:28,217 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-17 15:12:28,217 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2023-11-17 15:12:28,217 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-17 15:12:28,285 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-17 15:12:28,326 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 165 places, 154 transitions, 324 flow [2023-11-17 15:12:28,418 INFO L124 PetriNetUnfolderBase]: 2/150 cut-off events. [2023-11-17 15:12:28,418 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 15:12:28,424 INFO L83 FinitePrefix]: Finished finitePrefix Result has 163 conditions, 150 events. 2/150 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 76 event pairs, 0 based on Foata normal form. 0/145 useless extension candidates. Maximal degree in co-relation 94. Up to 2 conditions per place. [2023-11-17 15:12:28,424 INFO L82 GeneralOperation]: Start removeDead. Operand has 165 places, 154 transitions, 324 flow [2023-11-17 15:12:28,433 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 161 places, 150 transitions, 312 flow [2023-11-17 15:12:28,437 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-11-17 15:12:28,450 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 161 places, 150 transitions, 312 flow [2023-11-17 15:12:28,452 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 161 places, 150 transitions, 312 flow [2023-11-17 15:12:28,453 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 161 places, 150 transitions, 312 flow [2023-11-17 15:12:28,485 INFO L124 PetriNetUnfolderBase]: 2/150 cut-off events. [2023-11-17 15:12:28,485 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 15:12:28,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 163 conditions, 150 events. 2/150 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 76 event pairs, 0 based on Foata normal form. 0/145 useless extension candidates. Maximal degree in co-relation 94. Up to 2 conditions per place. [2023-11-17 15:12:28,488 INFO L119 LiptonReduction]: Number of co-enabled transitions 3620 [2023-11-17 15:12:34,710 INFO L134 LiptonReduction]: Checked pairs total: 9450 [2023-11-17 15:12:34,711 INFO L136 LiptonReduction]: Total number of compositions: 131 [2023-11-17 15:12:34,724 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-17 15:12:34,730 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;@220b06c6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-17 15:12:34,730 INFO L358 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2023-11-17 15:12:34,733 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-17 15:12:34,733 INFO L124 PetriNetUnfolderBase]: 0/11 cut-off events. [2023-11-17 15:12:34,733 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 15:12:34,734 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:12:34,734 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:12:34,735 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2023-11-17 15:12:34,739 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:12:34,739 INFO L85 PathProgramCache]: Analyzing trace with hash 1519632901, now seen corresponding path program 1 times [2023-11-17 15:12:34,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:12:34,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74476640] [2023-11-17 15:12:34,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:12:34,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:12:34,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:12:35,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:12:35,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:12:35,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74476640] [2023-11-17 15:12:35,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74476640] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:12:35,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:12:35,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-17 15:12:35,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639170409] [2023-11-17 15:12:35,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:12:35,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 15:12:35,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:12:35,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 15:12:35,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 15:12:35,164 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 285 [2023-11-17 15:12:35,167 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 33 transitions, 78 flow. Second operand has 3 states, 3 states have (on average 136.33333333333334) internal successors, (409), 3 states have internal predecessors, (409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:12:35,167 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:12:35,167 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 285 [2023-11-17 15:12:35,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:12:36,727 INFO L124 PetriNetUnfolderBase]: 7923/10718 cut-off events. [2023-11-17 15:12:36,728 INFO L125 PetriNetUnfolderBase]: For 66/66 co-relation queries the response was YES. [2023-11-17 15:12:36,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21590 conditions, 10718 events. 7923/10718 cut-off events. For 66/66 co-relation queries the response was YES. Maximal size of possible extension queue 484. Compared 57823 event pairs, 973 based on Foata normal form. 0/9838 useless extension candidates. Maximal degree in co-relation 21578. Up to 9231 conditions per place. [2023-11-17 15:12:36,802 INFO L140 encePairwiseOnDemand]: 281/285 looper letters, 43 selfloop transitions, 2 changer transitions 0/48 dead transitions. [2023-11-17 15:12:36,803 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 48 transitions, 201 flow [2023-11-17 15:12:36,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 15:12:36,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 15:12:36,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 450 transitions. [2023-11-17 15:12:36,819 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5263157894736842 [2023-11-17 15:12:36,820 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 450 transitions. [2023-11-17 15:12:36,820 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 450 transitions. [2023-11-17 15:12:36,822 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:12:36,824 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 450 transitions. [2023-11-17 15:12:36,828 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 150.0) internal successors, (450), 3 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:12:36,832 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 285.0) internal successors, (1140), 4 states have internal predecessors, (1140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:12:36,833 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 285.0) internal successors, (1140), 4 states have internal predecessors, (1140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:12:36,834 INFO L175 Difference]: Start difference. First operand has 45 places, 33 transitions, 78 flow. Second operand 3 states and 450 transitions. [2023-11-17 15:12:36,835 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 48 transitions, 201 flow [2023-11-17 15:12:36,839 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 48 transitions, 196 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-17 15:12:36,840 INFO L231 Difference]: Finished difference. Result has 42 places, 31 transitions, 74 flow [2023-11-17 15:12:36,842 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=74, PETRI_PLACES=42, PETRI_TRANSITIONS=31} [2023-11-17 15:12:36,846 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, -3 predicate places. [2023-11-17 15:12:36,846 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 31 transitions, 74 flow [2023-11-17 15:12:36,847 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 136.33333333333334) internal successors, (409), 3 states have internal predecessors, (409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:12:36,847 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:12:36,847 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:12:36,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-17 15:12:36,847 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P3Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2023-11-17 15:12:36,848 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:12:36,848 INFO L85 PathProgramCache]: Analyzing trace with hash 78411056, now seen corresponding path program 1 times [2023-11-17 15:12:36,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:12:36,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434581307] [2023-11-17 15:12:36,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:12:36,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:12:36,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:12:36,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:12:36,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:12:36,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434581307] [2023-11-17 15:12:36,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434581307] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:12:36,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:12:36,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-17 15:12:36,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384122497] [2023-11-17 15:12:36,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:12:36,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 15:12:36,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:12:36,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 15:12:36,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 15:12:36,972 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 285 [2023-11-17 15:12:36,972 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 31 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 137.0) internal successors, (411), 3 states have internal predecessors, (411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:12:36,973 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:12:36,973 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 285 [2023-11-17 15:12:36,973 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:12:38,245 INFO L124 PetriNetUnfolderBase]: 6591/9362 cut-off events. [2023-11-17 15:12:38,245 INFO L125 PetriNetUnfolderBase]: For 375/375 co-relation queries the response was YES. [2023-11-17 15:12:38,256 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18852 conditions, 9362 events. 6591/9362 cut-off events. For 375/375 co-relation queries the response was YES. Maximal size of possible extension queue 429. Compared 52117 event pairs, 1263 based on Foata normal form. 0/8998 useless extension candidates. Maximal degree in co-relation 18842. Up to 7057 conditions per place. [2023-11-17 15:12:38,296 INFO L140 encePairwiseOnDemand]: 282/285 looper letters, 38 selfloop transitions, 2 changer transitions 2/45 dead transitions. [2023-11-17 15:12:38,297 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 45 transitions, 188 flow [2023-11-17 15:12:38,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 15:12:38,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 15:12:38,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 445 transitions. [2023-11-17 15:12:38,299 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.52046783625731 [2023-11-17 15:12:38,299 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 445 transitions. [2023-11-17 15:12:38,299 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 445 transitions. [2023-11-17 15:12:38,299 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:12:38,299 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 445 transitions. [2023-11-17 15:12:38,301 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 148.33333333333334) internal successors, (445), 3 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:12:38,302 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 285.0) internal successors, (1140), 4 states have internal predecessors, (1140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:12:38,303 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 285.0) internal successors, (1140), 4 states have internal predecessors, (1140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:12:38,303 INFO L175 Difference]: Start difference. First operand has 42 places, 31 transitions, 74 flow. Second operand 3 states and 445 transitions. [2023-11-17 15:12:38,303 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 45 transitions, 188 flow [2023-11-17 15:12:38,305 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 45 transitions, 182 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-17 15:12:38,306 INFO L231 Difference]: Finished difference. Result has 41 places, 29 transitions, 70 flow [2023-11-17 15:12:38,306 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=70, PETRI_PLACES=41, PETRI_TRANSITIONS=29} [2023-11-17 15:12:38,307 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, -4 predicate places. [2023-11-17 15:12:38,307 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 29 transitions, 70 flow [2023-11-17 15:12:38,307 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 137.0) internal successors, (411), 3 states have internal predecessors, (411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:12:38,307 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:12:38,308 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:12:38,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-17 15:12:38,308 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2023-11-17 15:12:38,308 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:12:38,308 INFO L85 PathProgramCache]: Analyzing trace with hash -514845168, now seen corresponding path program 1 times [2023-11-17 15:12:38,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:12:38,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396639958] [2023-11-17 15:12:38,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:12:38,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:12:38,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:12:38,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:12:38,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:12:38,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396639958] [2023-11-17 15:12:38,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396639958] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:12:38,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:12:38,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 15:12:38,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020032294] [2023-11-17 15:12:38,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:12:38,615 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 15:12:38,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:12:38,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 15:12:38,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-17 15:12:38,617 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 285 [2023-11-17 15:12:38,618 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 29 transitions, 70 flow. Second operand has 4 states, 4 states have (on average 132.0) internal successors, (528), 4 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:12:38,618 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:12:38,618 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 285 [2023-11-17 15:12:38,618 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:12:40,195 INFO L124 PetriNetUnfolderBase]: 8191/11532 cut-off events. [2023-11-17 15:12:40,196 INFO L125 PetriNetUnfolderBase]: For 548/548 co-relation queries the response was YES. [2023-11-17 15:12:40,209 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23506 conditions, 11532 events. 8191/11532 cut-off events. For 548/548 co-relation queries the response was YES. Maximal size of possible extension queue 463. Compared 62047 event pairs, 2365 based on Foata normal form. 480/11992 useless extension candidates. Maximal degree in co-relation 23496. Up to 9047 conditions per place. [2023-11-17 15:12:40,250 INFO L140 encePairwiseOnDemand]: 280/285 looper letters, 44 selfloop transitions, 3 changer transitions 28/77 dead transitions. [2023-11-17 15:12:40,250 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 77 transitions, 328 flow [2023-11-17 15:12:40,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 15:12:40,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 15:12:40,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 722 transitions. [2023-11-17 15:12:40,253 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5066666666666667 [2023-11-17 15:12:40,253 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 722 transitions. [2023-11-17 15:12:40,253 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 722 transitions. [2023-11-17 15:12:40,254 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:12:40,254 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 722 transitions. [2023-11-17 15:12:40,255 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 144.4) internal successors, (722), 5 states have internal predecessors, (722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:12:40,258 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 285.0) internal successors, (1710), 6 states have internal predecessors, (1710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:12:40,259 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 285.0) internal successors, (1710), 6 states have internal predecessors, (1710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:12:40,259 INFO L175 Difference]: Start difference. First operand has 41 places, 29 transitions, 70 flow. Second operand 5 states and 722 transitions. [2023-11-17 15:12:40,259 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 77 transitions, 328 flow [2023-11-17 15:12:40,261 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 77 transitions, 318 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-17 15:12:40,262 INFO L231 Difference]: Finished difference. Result has 45 places, 31 transitions, 93 flow [2023-11-17 15:12:40,262 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=93, PETRI_PLACES=45, PETRI_TRANSITIONS=31} [2023-11-17 15:12:40,263 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 0 predicate places. [2023-11-17 15:12:40,263 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 31 transitions, 93 flow [2023-11-17 15:12:40,263 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 132.0) internal successors, (528), 4 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:12:40,263 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:12:40,264 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:12:40,264 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-17 15:12:40,264 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2023-11-17 15:12:40,264 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:12:40,264 INFO L85 PathProgramCache]: Analyzing trace with hash 1219608326, now seen corresponding path program 1 times [2023-11-17 15:12:40,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:12:40,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475491210] [2023-11-17 15:12:40,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:12:40,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:12:40,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:12:40,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:12:40,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:12:40,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475491210] [2023-11-17 15:12:40,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475491210] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:12:40,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:12:40,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 15:12:40,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519395580] [2023-11-17 15:12:40,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:12:40,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-17 15:12:40,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:12:40,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-17 15:12:40,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-17 15:12:40,949 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 285 [2023-11-17 15:12:40,950 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 31 transitions, 93 flow. Second operand has 5 states, 5 states have (on average 118.6) internal successors, (593), 5 states have internal predecessors, (593), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:12:40,950 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:12:40,950 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 285 [2023-11-17 15:12:40,951 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:12:43,272 INFO L124 PetriNetUnfolderBase]: 14577/19882 cut-off events. [2023-11-17 15:12:43,272 INFO L125 PetriNetUnfolderBase]: For 6875/6875 co-relation queries the response was YES. [2023-11-17 15:12:43,307 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45789 conditions, 19882 events. 14577/19882 cut-off events. For 6875/6875 co-relation queries the response was YES. Maximal size of possible extension queue 608. Compared 100438 event pairs, 2925 based on Foata normal form. 888/20770 useless extension candidates. Maximal degree in co-relation 45776. Up to 10721 conditions per place. [2023-11-17 15:12:43,369 INFO L140 encePairwiseOnDemand]: 271/285 looper letters, 50 selfloop transitions, 13 changer transitions 44/107 dead transitions. [2023-11-17 15:12:43,369 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 107 transitions, 505 flow [2023-11-17 15:12:43,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-17 15:12:43,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-17 15:12:43,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 918 transitions. [2023-11-17 15:12:43,372 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46015037593984964 [2023-11-17 15:12:43,372 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 918 transitions. [2023-11-17 15:12:43,372 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 918 transitions. [2023-11-17 15:12:43,372 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:12:43,373 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 918 transitions. [2023-11-17 15:12:43,375 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 131.14285714285714) internal successors, (918), 7 states have internal predecessors, (918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:12:43,378 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 285.0) internal successors, (2280), 8 states have internal predecessors, (2280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:12:43,379 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 285.0) internal successors, (2280), 8 states have internal predecessors, (2280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:12:43,379 INFO L175 Difference]: Start difference. First operand has 45 places, 31 transitions, 93 flow. Second operand 7 states and 918 transitions. [2023-11-17 15:12:43,379 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 107 transitions, 505 flow [2023-11-17 15:12:43,455 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 107 transitions, 496 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-11-17 15:12:43,457 INFO L231 Difference]: Finished difference. Result has 53 places, 42 transitions, 222 flow [2023-11-17 15:12:43,457 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=222, PETRI_PLACES=53, PETRI_TRANSITIONS=42} [2023-11-17 15:12:43,459 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 8 predicate places. [2023-11-17 15:12:43,459 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 42 transitions, 222 flow [2023-11-17 15:12:43,460 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 118.6) internal successors, (593), 5 states have internal predecessors, (593), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:12:43,460 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:12:43,460 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:12:43,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-17 15:12:43,460 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2023-11-17 15:12:43,460 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:12:43,461 INFO L85 PathProgramCache]: Analyzing trace with hash 1235230769, now seen corresponding path program 1 times [2023-11-17 15:12:43,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:12:43,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094867141] [2023-11-17 15:12:43,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:12:43,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:12:43,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:12:44,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:12:44,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:12:44,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094867141] [2023-11-17 15:12:44,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094867141] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:12:44,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:12:44,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-17 15:12:44,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499254666] [2023-11-17 15:12:44,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:12:44,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-17 15:12:44,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:12:44,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-17 15:12:44,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-17 15:12:44,739 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 285 [2023-11-17 15:12:44,740 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 42 transitions, 222 flow. Second operand has 6 states, 6 states have (on average 118.5) internal successors, (711), 6 states have internal predecessors, (711), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:12:44,740 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:12:44,740 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 285 [2023-11-17 15:12:44,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:12:47,359 INFO L124 PetriNetUnfolderBase]: 14998/20587 cut-off events. [2023-11-17 15:12:47,359 INFO L125 PetriNetUnfolderBase]: For 29852/29852 co-relation queries the response was YES. [2023-11-17 15:12:47,399 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67999 conditions, 20587 events. 14998/20587 cut-off events. For 29852/29852 co-relation queries the response was YES. Maximal size of possible extension queue 598. Compared 109363 event pairs, 1626 based on Foata normal form. 668/21255 useless extension candidates. Maximal degree in co-relation 67980. Up to 13445 conditions per place. [2023-11-17 15:12:47,477 INFO L140 encePairwiseOnDemand]: 270/285 looper letters, 85 selfloop transitions, 32 changer transitions 61/178 dead transitions. [2023-11-17 15:12:47,477 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 178 transitions, 1280 flow [2023-11-17 15:12:47,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-17 15:12:47,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-17 15:12:47,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1183 transitions. [2023-11-17 15:12:47,481 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4612085769980507 [2023-11-17 15:12:47,481 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1183 transitions. [2023-11-17 15:12:47,481 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1183 transitions. [2023-11-17 15:12:47,482 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:12:47,482 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1183 transitions. [2023-11-17 15:12:47,485 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 131.44444444444446) internal successors, (1183), 9 states have internal predecessors, (1183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:12:47,488 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 285.0) internal successors, (2850), 10 states have internal predecessors, (2850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:12:47,489 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 285.0) internal successors, (2850), 10 states have internal predecessors, (2850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:12:47,489 INFO L175 Difference]: Start difference. First operand has 53 places, 42 transitions, 222 flow. Second operand 9 states and 1183 transitions. [2023-11-17 15:12:47,489 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 178 transitions, 1280 flow [2023-11-17 15:12:47,842 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 178 transitions, 1253 flow, removed 11 selfloop flow, removed 3 redundant places. [2023-11-17 15:12:47,844 INFO L231 Difference]: Finished difference. Result has 63 places, 68 transitions, 571 flow [2023-11-17 15:12:47,844 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=571, PETRI_PLACES=63, PETRI_TRANSITIONS=68} [2023-11-17 15:12:47,845 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 18 predicate places. [2023-11-17 15:12:47,845 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 68 transitions, 571 flow [2023-11-17 15:12:47,845 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 118.5) internal successors, (711), 6 states have internal predecessors, (711), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:12:47,845 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:12:47,846 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:12:47,846 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-17 15:12:47,847 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2023-11-17 15:12:47,847 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:12:47,849 INFO L85 PathProgramCache]: Analyzing trace with hash -423110308, now seen corresponding path program 1 times [2023-11-17 15:12:47,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:12:47,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930581525] [2023-11-17 15:12:47,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:12:47,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:12:47,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:12:48,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:12:48,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:12:48,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930581525] [2023-11-17 15:12:48,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930581525] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:12:48,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:12:48,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 15:12:48,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906561423] [2023-11-17 15:12:48,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:12:48,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-17 15:12:48,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:12:48,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-17 15:12:48,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-17 15:12:48,385 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 285 [2023-11-17 15:12:48,386 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 68 transitions, 571 flow. Second operand has 5 states, 5 states have (on average 119.2) internal successors, (596), 5 states have internal predecessors, (596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:12:48,386 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:12:48,386 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 285 [2023-11-17 15:12:48,386 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:12:50,678 INFO L124 PetriNetUnfolderBase]: 13717/18830 cut-off events. [2023-11-17 15:12:50,678 INFO L125 PetriNetUnfolderBase]: For 70748/70748 co-relation queries the response was YES. [2023-11-17 15:12:50,712 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82882 conditions, 18830 events. 13717/18830 cut-off events. For 70748/70748 co-relation queries the response was YES. Maximal size of possible extension queue 508. Compared 96911 event pairs, 2637 based on Foata normal form. 512/19342 useless extension candidates. Maximal degree in co-relation 82856. Up to 10121 conditions per place. [2023-11-17 15:12:50,798 INFO L140 encePairwiseOnDemand]: 272/285 looper letters, 82 selfloop transitions, 23 changer transitions 41/146 dead transitions. [2023-11-17 15:12:50,798 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 146 transitions, 1435 flow [2023-11-17 15:12:50,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-17 15:12:50,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-17 15:12:50,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 914 transitions. [2023-11-17 15:12:50,807 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4581453634085213 [2023-11-17 15:12:50,807 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 914 transitions. [2023-11-17 15:12:50,807 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 914 transitions. [2023-11-17 15:12:50,809 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:12:50,809 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 914 transitions. [2023-11-17 15:12:50,813 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 130.57142857142858) internal successors, (914), 7 states have internal predecessors, (914), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:12:50,817 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 285.0) internal successors, (2280), 8 states have internal predecessors, (2280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:12:50,818 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 285.0) internal successors, (2280), 8 states have internal predecessors, (2280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:12:50,818 INFO L175 Difference]: Start difference. First operand has 63 places, 68 transitions, 571 flow. Second operand 7 states and 914 transitions. [2023-11-17 15:12:50,818 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 146 transitions, 1435 flow [2023-11-17 15:12:50,917 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 146 transitions, 1413 flow, removed 11 selfloop flow, removed 2 redundant places. [2023-11-17 15:12:50,919 INFO L231 Difference]: Finished difference. Result has 69 places, 79 transitions, 810 flow [2023-11-17 15:12:50,919 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=563, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=810, PETRI_PLACES=69, PETRI_TRANSITIONS=79} [2023-11-17 15:12:50,922 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 24 predicate places. [2023-11-17 15:12:50,922 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 79 transitions, 810 flow [2023-11-17 15:12:50,923 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 119.2) internal successors, (596), 5 states have internal predecessors, (596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:12:50,923 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:12:50,923 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:12:50,923 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-17 15:12:50,923 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2023-11-17 15:12:50,924 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:12:50,924 INFO L85 PathProgramCache]: Analyzing trace with hash 97717004, now seen corresponding path program 1 times [2023-11-17 15:12:50,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:12:50,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736387703] [2023-11-17 15:12:50,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:12:50,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:12:50,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:12:51,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:12:51,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:12:51,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736387703] [2023-11-17 15:12:51,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736387703] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:12:51,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:12:51,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 15:12:51,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93902353] [2023-11-17 15:12:51,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:12:51,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 15:12:51,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:12:51,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 15:12:51,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 15:12:51,174 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 285 [2023-11-17 15:12:51,175 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 79 transitions, 810 flow. Second operand has 3 states, 3 states have (on average 134.66666666666666) internal successors, (404), 3 states have internal predecessors, (404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:12:51,175 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:12:51,175 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 285 [2023-11-17 15:12:51,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:12:52,997 INFO L124 PetriNetUnfolderBase]: 7096/10179 cut-off events. [2023-11-17 15:12:52,997 INFO L125 PetriNetUnfolderBase]: For 60842/62361 co-relation queries the response was YES. [2023-11-17 15:12:53,018 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48900 conditions, 10179 events. 7096/10179 cut-off events. For 60842/62361 co-relation queries the response was YES. Maximal size of possible extension queue 403. Compared 54588 event pairs, 1435 based on Foata normal form. 631/10583 useless extension candidates. Maximal degree in co-relation 48868. Up to 8263 conditions per place. [2023-11-17 15:12:53,077 INFO L140 encePairwiseOnDemand]: 279/285 looper letters, 104 selfloop transitions, 5 changer transitions 0/128 dead transitions. [2023-11-17 15:12:53,078 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 128 transitions, 1495 flow [2023-11-17 15:12:53,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 15:12:53,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 15:12:53,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 434 transitions. [2023-11-17 15:12:53,080 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5076023391812865 [2023-11-17 15:12:53,080 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 434 transitions. [2023-11-17 15:12:53,080 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 434 transitions. [2023-11-17 15:12:53,080 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:12:53,080 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 434 transitions. [2023-11-17 15:12:53,082 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 144.66666666666666) internal successors, (434), 3 states have internal predecessors, (434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:12:53,084 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 285.0) internal successors, (1140), 4 states have internal predecessors, (1140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:12:53,084 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 285.0) internal successors, (1140), 4 states have internal predecessors, (1140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:12:53,084 INFO L175 Difference]: Start difference. First operand has 69 places, 79 transitions, 810 flow. Second operand 3 states and 434 transitions. [2023-11-17 15:12:53,085 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 128 transitions, 1495 flow [2023-11-17 15:12:53,206 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 128 transitions, 1472 flow, removed 6 selfloop flow, removed 3 redundant places. [2023-11-17 15:12:53,213 INFO L231 Difference]: Finished difference. Result has 66 places, 83 transitions, 827 flow [2023-11-17 15:12:53,213 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=794, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=827, PETRI_PLACES=66, PETRI_TRANSITIONS=83} [2023-11-17 15:12:53,214 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 21 predicate places. [2023-11-17 15:12:53,217 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 83 transitions, 827 flow [2023-11-17 15:12:53,218 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 134.66666666666666) internal successors, (404), 3 states have internal predecessors, (404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:12:53,219 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:12:53,219 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:12:53,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-17 15:12:53,219 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2023-11-17 15:12:53,219 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:12:53,219 INFO L85 PathProgramCache]: Analyzing trace with hash -1133281093, now seen corresponding path program 1 times [2023-11-17 15:12:53,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:12:53,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145855945] [2023-11-17 15:12:53,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:12:53,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:12:53,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:12:53,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:12:53,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:12:53,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145855945] [2023-11-17 15:12:53,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145855945] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:12:53,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:12:53,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-17 15:12:53,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093513296] [2023-11-17 15:12:53,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:12:53,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-17 15:12:53,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:12:53,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-17 15:12:53,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-17 15:12:53,725 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 285 [2023-11-17 15:12:53,726 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 83 transitions, 827 flow. Second operand has 5 states, 5 states have (on average 119.8) internal successors, (599), 5 states have internal predecessors, (599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:12:53,726 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:12:53,726 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 285 [2023-11-17 15:12:53,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:12:55,479 INFO L124 PetriNetUnfolderBase]: 10550/15111 cut-off events. [2023-11-17 15:12:55,479 INFO L125 PetriNetUnfolderBase]: For 66872/66872 co-relation queries the response was YES. [2023-11-17 15:12:55,522 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74670 conditions, 15111 events. 10550/15111 cut-off events. For 66872/66872 co-relation queries the response was YES. Maximal size of possible extension queue 428. Compared 81265 event pairs, 3124 based on Foata normal form. 216/15327 useless extension candidates. Maximal degree in co-relation 74638. Up to 7340 conditions per place. [2023-11-17 15:12:55,568 INFO L140 encePairwiseOnDemand]: 278/285 looper letters, 95 selfloop transitions, 16 changer transitions 43/154 dead transitions. [2023-11-17 15:12:55,568 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 154 transitions, 1637 flow [2023-11-17 15:12:55,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-17 15:12:55,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-17 15:12:55,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 783 transitions. [2023-11-17 15:12:55,571 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45789473684210524 [2023-11-17 15:12:55,571 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 783 transitions. [2023-11-17 15:12:55,571 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 783 transitions. [2023-11-17 15:12:55,571 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:12:55,572 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 783 transitions. [2023-11-17 15:12:55,573 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 130.5) internal successors, (783), 6 states have internal predecessors, (783), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:12:55,576 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 285.0) internal successors, (1995), 7 states have internal predecessors, (1995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:12:55,576 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 285.0) internal successors, (1995), 7 states have internal predecessors, (1995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:12:55,576 INFO L175 Difference]: Start difference. First operand has 66 places, 83 transitions, 827 flow. Second operand 6 states and 783 transitions. [2023-11-17 15:12:55,576 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 154 transitions, 1637 flow [2023-11-17 15:12:55,714 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 154 transitions, 1610 flow, removed 9 selfloop flow, removed 2 redundant places. [2023-11-17 15:12:55,717 INFO L231 Difference]: Finished difference. Result has 73 places, 77 transitions, 768 flow [2023-11-17 15:12:55,717 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=806, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=768, PETRI_PLACES=73, PETRI_TRANSITIONS=77} [2023-11-17 15:12:55,719 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 28 predicate places. [2023-11-17 15:12:55,719 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 77 transitions, 768 flow [2023-11-17 15:12:55,720 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 119.8) internal successors, (599), 5 states have internal predecessors, (599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:12:55,720 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:12:55,720 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] [2023-11-17 15:12:55,720 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-17 15:12:55,720 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2023-11-17 15:12:55,724 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:12:55,724 INFO L85 PathProgramCache]: Analyzing trace with hash 2130021805, now seen corresponding path program 1 times [2023-11-17 15:12:55,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:12:55,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646635725] [2023-11-17 15:12:55,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:12:55,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:12:55,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:12:55,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:12:55,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:12:55,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646635725] [2023-11-17 15:12:55,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646635725] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:12:55,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:12:55,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 15:12:55,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199320918] [2023-11-17 15:12:55,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:12:55,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 15:12:55,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:12:55,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 15:12:55,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-17 15:12:55,967 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 285 [2023-11-17 15:12:55,968 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 77 transitions, 768 flow. Second operand has 4 states, 4 states have (on average 133.75) internal successors, (535), 4 states have internal predecessors, (535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:12:55,968 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:12:55,968 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 285 [2023-11-17 15:12:55,968 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:12:56,710 INFO L124 PetriNetUnfolderBase]: 3504/5414 cut-off events. [2023-11-17 15:12:56,710 INFO L125 PetriNetUnfolderBase]: For 27512/28042 co-relation queries the response was YES. [2023-11-17 15:12:56,723 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26868 conditions, 5414 events. 3504/5414 cut-off events. For 27512/28042 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 29422 event pairs, 673 based on Foata normal form. 615/5943 useless extension candidates. Maximal degree in co-relation 26832. Up to 2622 conditions per place. [2023-11-17 15:12:56,740 INFO L140 encePairwiseOnDemand]: 279/285 looper letters, 131 selfloop transitions, 9 changer transitions 0/154 dead transitions. [2023-11-17 15:12:56,740 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 154 transitions, 1803 flow [2023-11-17 15:12:56,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 15:12:56,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-17 15:12:56,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 581 transitions. [2023-11-17 15:12:56,742 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5096491228070176 [2023-11-17 15:12:56,742 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 581 transitions. [2023-11-17 15:12:56,743 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 581 transitions. [2023-11-17 15:12:56,743 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:12:56,743 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 581 transitions. [2023-11-17 15:12:56,745 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 145.25) internal successors, (581), 4 states have internal predecessors, (581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:12:56,746 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 285.0) internal successors, (1425), 5 states have internal predecessors, (1425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:12:56,747 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 285.0) internal successors, (1425), 5 states have internal predecessors, (1425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:12:56,747 INFO L175 Difference]: Start difference. First operand has 73 places, 77 transitions, 768 flow. Second operand 4 states and 581 transitions. [2023-11-17 15:12:56,747 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 154 transitions, 1803 flow [2023-11-17 15:12:56,797 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 154 transitions, 1783 flow, removed 10 selfloop flow, removed 2 redundant places. [2023-11-17 15:12:56,799 INFO L231 Difference]: Finished difference. Result has 73 places, 81 transitions, 804 flow [2023-11-17 15:12:56,800 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=752, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=804, PETRI_PLACES=73, PETRI_TRANSITIONS=81} [2023-11-17 15:12:56,800 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 28 predicate places. [2023-11-17 15:12:56,800 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 81 transitions, 804 flow [2023-11-17 15:12:56,801 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 133.75) internal successors, (535), 4 states have internal predecessors, (535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:12:56,801 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:12:56,801 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, 1] [2023-11-17 15:12:56,801 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-17 15:12:56,801 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2023-11-17 15:12:56,802 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:12:56,802 INFO L85 PathProgramCache]: Analyzing trace with hash 167462312, now seen corresponding path program 1 times [2023-11-17 15:12:56,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:12:56,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227315359] [2023-11-17 15:12:56,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:12:56,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:12:56,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:12:57,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:12:57,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:12:57,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227315359] [2023-11-17 15:12:57,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227315359] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:12:57,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:12:57,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-17 15:12:57,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631194519] [2023-11-17 15:12:57,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:12:57,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-17 15:12:57,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:12:57,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-17 15:12:57,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-17 15:12:57,077 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 285 [2023-11-17 15:12:57,078 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 81 transitions, 804 flow. Second operand has 5 states, 5 states have (on average 133.2) internal successors, (666), 5 states have internal predecessors, (666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:12:57,078 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:12:57,078 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 285 [2023-11-17 15:12:57,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:12:57,612 INFO L124 PetriNetUnfolderBase]: 2557/3955 cut-off events. [2023-11-17 15:12:57,612 INFO L125 PetriNetUnfolderBase]: For 19930/20357 co-relation queries the response was YES. [2023-11-17 15:12:57,622 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20800 conditions, 3955 events. 2557/3955 cut-off events. For 19930/20357 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 20745 event pairs, 497 based on Foata normal form. 363/4262 useless extension candidates. Maximal degree in co-relation 20763. Up to 1886 conditions per place. [2023-11-17 15:12:57,634 INFO L140 encePairwiseOnDemand]: 279/285 looper letters, 140 selfloop transitions, 13 changer transitions 4/171 dead transitions. [2023-11-17 15:12:57,634 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 171 transitions, 1997 flow [2023-11-17 15:12:57,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 15:12:57,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 15:12:57,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 726 transitions. [2023-11-17 15:12:57,636 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5094736842105263 [2023-11-17 15:12:57,637 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 726 transitions. [2023-11-17 15:12:57,637 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 726 transitions. [2023-11-17 15:12:57,637 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:12:57,637 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 726 transitions. [2023-11-17 15:12:57,639 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 145.2) internal successors, (726), 5 states have internal predecessors, (726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:12:57,641 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 285.0) internal successors, (1710), 6 states have internal predecessors, (1710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:12:57,641 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 285.0) internal successors, (1710), 6 states have internal predecessors, (1710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:12:57,641 INFO L175 Difference]: Start difference. First operand has 73 places, 81 transitions, 804 flow. Second operand 5 states and 726 transitions. [2023-11-17 15:12:57,641 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 171 transitions, 1997 flow [2023-11-17 15:12:57,670 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 171 transitions, 1979 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-11-17 15:12:57,672 INFO L231 Difference]: Finished difference. Result has 76 places, 81 transitions, 812 flow [2023-11-17 15:12:57,672 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=744, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=812, PETRI_PLACES=76, PETRI_TRANSITIONS=81} [2023-11-17 15:12:57,673 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 31 predicate places. [2023-11-17 15:12:57,673 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 81 transitions, 812 flow [2023-11-17 15:12:57,674 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 133.2) internal successors, (666), 5 states have internal predecessors, (666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:12:57,674 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:12:57,674 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, 1, 1, 1, 1] [2023-11-17 15:12:57,674 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-17 15:12:57,674 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2023-11-17 15:12:57,674 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:12:57,674 INFO L85 PathProgramCache]: Analyzing trace with hash -1357831154, now seen corresponding path program 1 times [2023-11-17 15:12:57,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:12:57,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870257228] [2023-11-17 15:12:57,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:12:57,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:12:57,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:12:58,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:12:58,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:12:58,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870257228] [2023-11-17 15:12:58,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870257228] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:12:58,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:12:58,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-17 15:12:58,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282108938] [2023-11-17 15:12:58,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:12:58,110 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-17 15:12:58,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:12:58,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-17 15:12:58,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-17 15:12:58,111 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 285 [2023-11-17 15:12:58,112 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 81 transitions, 812 flow. Second operand has 6 states, 6 states have (on average 133.0) internal successors, (798), 6 states have internal predecessors, (798), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:12:58,112 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:12:58,112 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 285 [2023-11-17 15:12:58,112 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:12:58,654 INFO L124 PetriNetUnfolderBase]: 2463/3767 cut-off events. [2023-11-17 15:12:58,655 INFO L125 PetriNetUnfolderBase]: For 19669/20079 co-relation queries the response was YES. [2023-11-17 15:12:58,664 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20082 conditions, 3767 events. 2463/3767 cut-off events. For 19669/20079 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 19637 event pairs, 484 based on Foata normal form. 212/3924 useless extension candidates. Maximal degree in co-relation 20044. Up to 1793 conditions per place. [2023-11-17 15:12:58,672 INFO L140 encePairwiseOnDemand]: 279/285 looper letters, 127 selfloop transitions, 17 changer transitions 14/171 dead transitions. [2023-11-17 15:12:58,672 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 171 transitions, 2023 flow [2023-11-17 15:12:58,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-17 15:12:58,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-17 15:12:58,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 855 transitions. [2023-11-17 15:12:58,675 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2023-11-17 15:12:58,675 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 855 transitions. [2023-11-17 15:12:58,675 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 855 transitions. [2023-11-17 15:12:58,675 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:12:58,675 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 855 transitions. [2023-11-17 15:12:58,677 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 142.5) internal successors, (855), 6 states have internal predecessors, (855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:12:58,679 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 285.0) internal successors, (1995), 7 states have internal predecessors, (1995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:12:58,679 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 285.0) internal successors, (1995), 7 states have internal predecessors, (1995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:12:58,680 INFO L175 Difference]: Start difference. First operand has 76 places, 81 transitions, 812 flow. Second operand 6 states and 855 transitions. [2023-11-17 15:12:58,680 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 171 transitions, 2023 flow [2023-11-17 15:12:58,754 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 171 transitions, 1897 flow, removed 40 selfloop flow, removed 6 redundant places. [2023-11-17 15:12:58,756 INFO L231 Difference]: Finished difference. Result has 76 places, 76 transitions, 709 flow [2023-11-17 15:12:58,756 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=725, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=709, PETRI_PLACES=76, PETRI_TRANSITIONS=76} [2023-11-17 15:12:58,757 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 31 predicate places. [2023-11-17 15:12:58,757 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 76 transitions, 709 flow [2023-11-17 15:12:58,757 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 133.0) internal successors, (798), 6 states have internal predecessors, (798), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:12:58,758 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:12:58,758 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, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:12:58,758 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-17 15:12:58,758 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2023-11-17 15:12:58,758 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:12:58,758 INFO L85 PathProgramCache]: Analyzing trace with hash 875642766, now seen corresponding path program 1 times [2023-11-17 15:12:58,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:12:58,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111997038] [2023-11-17 15:12:58,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:12:58,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:12:58,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:12:59,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:12:59,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:12:59,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111997038] [2023-11-17 15:12:59,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111997038] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:12:59,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:12:59,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-17 15:12:59,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642666977] [2023-11-17 15:12:59,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:12:59,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-17 15:12:59,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:12:59,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-17 15:12:59,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-17 15:12:59,081 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 285 [2023-11-17 15:12:59,082 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 76 transitions, 709 flow. Second operand has 5 states, 5 states have (on average 133.4) internal successors, (667), 5 states have internal predecessors, (667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:12:59,082 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:12:59,082 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 285 [2023-11-17 15:12:59,082 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:12:59,489 INFO L124 PetriNetUnfolderBase]: 1714/2688 cut-off events. [2023-11-17 15:12:59,489 INFO L125 PetriNetUnfolderBase]: For 13915/13955 co-relation queries the response was YES. [2023-11-17 15:12:59,497 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14731 conditions, 2688 events. 1714/2688 cut-off events. For 13915/13955 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 12987 event pairs, 348 based on Foata normal form. 33/2717 useless extension candidates. Maximal degree in co-relation 14695. Up to 1716 conditions per place. [2023-11-17 15:12:59,502 INFO L140 encePairwiseOnDemand]: 281/285 looper letters, 69 selfloop transitions, 1 changer transitions 66/142 dead transitions. [2023-11-17 15:12:59,502 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 142 transitions, 1567 flow [2023-11-17 15:12:59,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 15:12:59,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 15:12:59,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 698 transitions. [2023-11-17 15:12:59,504 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4898245614035088 [2023-11-17 15:12:59,504 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 698 transitions. [2023-11-17 15:12:59,504 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 698 transitions. [2023-11-17 15:12:59,504 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:12:59,505 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 698 transitions. [2023-11-17 15:12:59,506 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 139.6) internal successors, (698), 5 states have internal predecessors, (698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:12:59,508 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 285.0) internal successors, (1710), 6 states have internal predecessors, (1710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:12:59,508 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 285.0) internal successors, (1710), 6 states have internal predecessors, (1710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:12:59,508 INFO L175 Difference]: Start difference. First operand has 76 places, 76 transitions, 709 flow. Second operand 5 states and 698 transitions. [2023-11-17 15:12:59,508 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 142 transitions, 1567 flow [2023-11-17 15:12:59,553 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 142 transitions, 1340 flow, removed 70 selfloop flow, removed 10 redundant places. [2023-11-17 15:12:59,555 INFO L231 Difference]: Finished difference. Result has 73 places, 65 transitions, 488 flow [2023-11-17 15:12:59,555 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=596, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=488, PETRI_PLACES=73, PETRI_TRANSITIONS=65} [2023-11-17 15:12:59,555 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 28 predicate places. [2023-11-17 15:12:59,556 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 65 transitions, 488 flow [2023-11-17 15:12:59,556 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 133.4) internal successors, (667), 5 states have internal predecessors, (667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:12:59,556 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:12:59,556 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, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:12:59,556 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-17 15:12:59,557 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2023-11-17 15:12:59,557 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:12:59,557 INFO L85 PathProgramCache]: Analyzing trace with hash -1941128390, now seen corresponding path program 2 times [2023-11-17 15:12:59,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:12:59,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296412832] [2023-11-17 15:12:59,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:12:59,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:12:59,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:13:00,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:13:00,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:13:00,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296412832] [2023-11-17 15:13:00,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296412832] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:13:00,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:13:00,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-17 15:13:00,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480389873] [2023-11-17 15:13:00,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:13:00,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-17 15:13:00,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:13:00,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-17 15:13:00,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-11-17 15:13:00,782 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 285 [2023-11-17 15:13:00,782 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 65 transitions, 488 flow. Second operand has 8 states, 8 states have (on average 120.625) internal successors, (965), 8 states have internal predecessors, (965), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:13:00,782 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:13:00,783 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 285 [2023-11-17 15:13:00,783 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:13:01,206 INFO L124 PetriNetUnfolderBase]: 833/1373 cut-off events. [2023-11-17 15:13:01,206 INFO L125 PetriNetUnfolderBase]: For 3980/3980 co-relation queries the response was YES. [2023-11-17 15:13:01,210 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6259 conditions, 1373 events. 833/1373 cut-off events. For 3980/3980 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 6095 event pairs, 91 based on Foata normal form. 1/1374 useless extension candidates. Maximal degree in co-relation 6236. Up to 852 conditions per place. [2023-11-17 15:13:01,214 INFO L140 encePairwiseOnDemand]: 273/285 looper letters, 96 selfloop transitions, 35 changer transitions 10/141 dead transitions. [2023-11-17 15:13:01,214 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 141 transitions, 1265 flow [2023-11-17 15:13:01,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-17 15:13:01,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-17 15:13:01,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1017 transitions. [2023-11-17 15:13:01,217 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44605263157894737 [2023-11-17 15:13:01,217 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1017 transitions. [2023-11-17 15:13:01,217 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1017 transitions. [2023-11-17 15:13:01,218 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:13:01,218 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1017 transitions. [2023-11-17 15:13:01,220 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 127.125) internal successors, (1017), 8 states have internal predecessors, (1017), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:13:01,222 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 285.0) internal successors, (2565), 9 states have internal predecessors, (2565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:13:01,223 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 285.0) internal successors, (2565), 9 states have internal predecessors, (2565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:13:01,223 INFO L175 Difference]: Start difference. First operand has 73 places, 65 transitions, 488 flow. Second operand 8 states and 1017 transitions. [2023-11-17 15:13:01,223 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 141 transitions, 1265 flow [2023-11-17 15:13:01,237 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 141 transitions, 1213 flow, removed 6 selfloop flow, removed 5 redundant places. [2023-11-17 15:13:01,239 INFO L231 Difference]: Finished difference. Result has 78 places, 79 transitions, 729 flow [2023-11-17 15:13:01,239 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=459, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=729, PETRI_PLACES=78, PETRI_TRANSITIONS=79} [2023-11-17 15:13:01,240 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 33 predicate places. [2023-11-17 15:13:01,240 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 79 transitions, 729 flow [2023-11-17 15:13:01,240 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 120.625) internal successors, (965), 8 states have internal predecessors, (965), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:13:01,240 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:13:01,241 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, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:13:01,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-17 15:13:01,241 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2023-11-17 15:13:01,241 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:13:01,241 INFO L85 PathProgramCache]: Analyzing trace with hash -508658182, now seen corresponding path program 3 times [2023-11-17 15:13:01,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:13:01,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473022965] [2023-11-17 15:13:01,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:13:01,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:13:01,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:13:02,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:13:02,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:13:02,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473022965] [2023-11-17 15:13:02,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473022965] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:13:02,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:13:02,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-17 15:13:02,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715376574] [2023-11-17 15:13:02,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:13:02,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-17 15:13:02,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:13:02,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-17 15:13:02,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-11-17 15:13:02,912 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 285 [2023-11-17 15:13:02,913 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 79 transitions, 729 flow. Second operand has 9 states, 9 states have (on average 115.22222222222223) internal successors, (1037), 9 states have internal predecessors, (1037), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:13:02,913 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:13:02,913 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 285 [2023-11-17 15:13:02,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:13:03,360 INFO L124 PetriNetUnfolderBase]: 929/1535 cut-off events. [2023-11-17 15:13:03,361 INFO L125 PetriNetUnfolderBase]: For 6043/6043 co-relation queries the response was YES. [2023-11-17 15:13:03,366 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7756 conditions, 1535 events. 929/1535 cut-off events. For 6043/6043 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 6995 event pairs, 138 based on Foata normal form. 1/1536 useless extension candidates. Maximal degree in co-relation 7730. Up to 728 conditions per place. [2023-11-17 15:13:03,369 INFO L140 encePairwiseOnDemand]: 275/285 looper letters, 100 selfloop transitions, 25 changer transitions 17/142 dead transitions. [2023-11-17 15:13:03,370 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 142 transitions, 1398 flow [2023-11-17 15:13:03,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-17 15:13:03,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-17 15:13:03,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 855 transitions. [2023-11-17 15:13:03,373 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2023-11-17 15:13:03,373 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 855 transitions. [2023-11-17 15:13:03,373 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 855 transitions. [2023-11-17 15:13:03,374 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:13:03,374 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 855 transitions. [2023-11-17 15:13:03,376 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 122.14285714285714) internal successors, (855), 7 states have internal predecessors, (855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:13:03,378 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 285.0) internal successors, (2280), 8 states have internal predecessors, (2280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:13:03,379 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 285.0) internal successors, (2280), 8 states have internal predecessors, (2280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:13:03,379 INFO L175 Difference]: Start difference. First operand has 78 places, 79 transitions, 729 flow. Second operand 7 states and 855 transitions. [2023-11-17 15:13:03,379 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 142 transitions, 1398 flow [2023-11-17 15:13:03,396 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 142 transitions, 1380 flow, removed 5 selfloop flow, removed 3 redundant places. [2023-11-17 15:13:03,398 INFO L231 Difference]: Finished difference. Result has 84 places, 82 transitions, 829 flow [2023-11-17 15:13:03,399 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=713, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=829, PETRI_PLACES=84, PETRI_TRANSITIONS=82} [2023-11-17 15:13:03,399 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 39 predicate places. [2023-11-17 15:13:03,400 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 82 transitions, 829 flow [2023-11-17 15:13:03,400 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 115.22222222222223) internal successors, (1037), 9 states have internal predecessors, (1037), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:13:03,400 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:13:03,400 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, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:13:03,400 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-17 15:13:03,401 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2023-11-17 15:13:03,401 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:13:03,401 INFO L85 PathProgramCache]: Analyzing trace with hash 759925018, now seen corresponding path program 4 times [2023-11-17 15:13:03,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:13:03,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697695389] [2023-11-17 15:13:03,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:13:03,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:13:03,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-17 15:13:03,497 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-17 15:13:03,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-17 15:13:03,665 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-17 15:13:03,665 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-17 15:13:03,666 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (8 of 9 remaining) [2023-11-17 15:13:03,667 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (7 of 9 remaining) [2023-11-17 15:13:03,668 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (6 of 9 remaining) [2023-11-17 15:13:03,670 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 9 remaining) [2023-11-17 15:13:03,670 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 9 remaining) [2023-11-17 15:13:03,671 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 9 remaining) [2023-11-17 15:13:03,671 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 9 remaining) [2023-11-17 15:13:03,671 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 9 remaining) [2023-11-17 15:13:03,671 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 9 remaining) [2023-11-17 15:13:03,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-17 15:13:03,671 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:13:03,678 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-17 15:13:03,678 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-17 15:13:03,750 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-17 15:13:03,753 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated [2023-11-17 15:13:03,759 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre13 could not be translated [2023-11-17 15:13:03,760 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre15 could not be translated [2023-11-17 15:13:03,795 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.11 03:13:03 BasicIcfg [2023-11-17 15:13:03,795 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-17 15:13:03,796 INFO L158 Benchmark]: Toolchain (without parser) took 37321.13ms. Allocated memory was 272.6MB in the beginning and 3.4GB in the end (delta: 3.1GB). Free memory was 221.1MB in the beginning and 2.1GB in the end (delta: -1.8GB). Peak memory consumption was 1.3GB. Max. memory is 8.0GB. [2023-11-17 15:13:03,796 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 183.5MB. Free memory is still 135.1MB. There was no memory consumed. Max. memory is 8.0GB. [2023-11-17 15:13:03,796 INFO L158 Benchmark]: CACSL2BoogieTranslator took 666.11ms. Allocated memory is still 272.6MB. Free memory was 221.1MB in the beginning and 192.6MB in the end (delta: 28.5MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. [2023-11-17 15:13:03,797 INFO L158 Benchmark]: Boogie Procedure Inliner took 89.63ms. Allocated memory is still 272.6MB. Free memory was 192.6MB in the beginning and 188.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-11-17 15:13:03,797 INFO L158 Benchmark]: Boogie Preprocessor took 57.99ms. Allocated memory is still 272.6MB. Free memory was 188.4MB in the beginning and 185.4MB in the end (delta: 2.9MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-11-17 15:13:03,797 INFO L158 Benchmark]: RCFGBuilder took 898.76ms. Allocated memory is still 272.6MB. Free memory was 185.4MB in the beginning and 182.7MB in the end (delta: 2.7MB). Peak memory consumption was 22.9MB. Max. memory is 8.0GB. [2023-11-17 15:13:03,797 INFO L158 Benchmark]: TraceAbstraction took 35601.35ms. Allocated memory was 272.6MB in the beginning and 3.4GB in the end (delta: 3.1GB). Free memory was 181.7MB in the beginning and 2.1GB in the end (delta: -1.9GB). Peak memory consumption was 1.2GB. Max. memory is 8.0GB. [2023-11-17 15:13:03,798 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 183.5MB. Free memory is still 135.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 666.11ms. Allocated memory is still 272.6MB. Free memory was 221.1MB in the beginning and 192.6MB in the end (delta: 28.5MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 89.63ms. Allocated memory is still 272.6MB. Free memory was 192.6MB in the beginning and 188.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 57.99ms. Allocated memory is still 272.6MB. Free memory was 188.4MB in the beginning and 185.4MB in the end (delta: 2.9MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 898.76ms. Allocated memory is still 272.6MB. Free memory was 185.4MB in the beginning and 182.7MB in the end (delta: 2.7MB). Peak memory consumption was 22.9MB. Max. memory is 8.0GB. * TraceAbstraction took 35601.35ms. Allocated memory was 272.6MB in the beginning and 3.4GB in the end (delta: 3.1GB). Free memory was 181.7MB in the beginning and 2.1GB in the end (delta: -1.9GB). Peak memory consumption was 1.2GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre13 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre15 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.3s, 161 PlacesBefore, 45 PlacesAfterwards, 150 TransitionsBefore, 33 TransitionsAfterwards, 3620 CoEnabledTransitionPairs, 7 FixpointIterations, 60 TrivialSequentialCompositions, 63 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 131 TotalNumberOfCompositions, 9450 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4213, independent: 3982, independent conditional: 0, independent unconditional: 3982, dependent: 231, dependent conditional: 0, dependent unconditional: 231, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2433, independent: 2366, independent conditional: 0, independent unconditional: 2366, dependent: 67, dependent conditional: 0, dependent unconditional: 67, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2433, independent: 2330, independent conditional: 0, independent unconditional: 2330, dependent: 103, dependent conditional: 0, dependent unconditional: 103, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 103, independent: 36, independent conditional: 0, independent unconditional: 36, dependent: 67, dependent conditional: 0, dependent unconditional: 67, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 673, independent: 41, independent conditional: 0, independent unconditional: 41, dependent: 632, dependent conditional: 0, dependent unconditional: 632, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4213, independent: 1616, independent conditional: 0, independent unconditional: 1616, dependent: 164, dependent conditional: 0, dependent unconditional: 164, unknown: 2433, unknown conditional: 0, unknown unconditional: 2433] , Statistics on independence cache: Total cache size (in pairs): 234, Positive cache size: 207, Positive conditional cache size: 0, Positive unconditional cache size: 207, Negative cache size: 27, Negative conditional cache size: 0, Negative unconditional cache size: 27, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p2_EAX = 0; [L714] 0 int __unbuffered_p2_EBX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_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_buff0_thd4; [L734] 0 _Bool y$r_buff1_thd0; [L735] 0 _Bool y$r_buff1_thd1; [L736] 0 _Bool y$r_buff1_thd2; [L737] 0 _Bool y$r_buff1_thd3; [L738] 0 _Bool y$r_buff1_thd4; [L739] 0 _Bool y$read_delayed; [L740] 0 int *y$read_delayed_var; [L741] 0 int y$w_buff0; [L742] 0 _Bool y$w_buff0_used; [L743] 0 int y$w_buff1; [L744] 0 _Bool y$w_buff1_used; [L746] 0 int z = 0; [L747] 0 _Bool z$flush_delayed; [L748] 0 int z$mem_tmp; [L749] 0 _Bool z$r_buff0_thd0; [L750] 0 _Bool z$r_buff0_thd1; [L751] 0 _Bool z$r_buff0_thd2; [L752] 0 _Bool z$r_buff0_thd3; [L753] 0 _Bool z$r_buff0_thd4; [L754] 0 _Bool z$r_buff1_thd0; [L755] 0 _Bool z$r_buff1_thd1; [L756] 0 _Bool z$r_buff1_thd2; [L757] 0 _Bool z$r_buff1_thd3; [L758] 0 _Bool z$r_buff1_thd4; [L759] 0 _Bool z$read_delayed; [L760] 0 int *z$read_delayed_var; [L761] 0 int z$w_buff0; [L762] 0 _Bool z$w_buff0_used; [L763] 0 int z$w_buff1; [L764] 0 _Bool z$w_buff1_used; [L765] 0 _Bool weak$$choice0; [L766] 0 _Bool weak$$choice2; [L923] 0 pthread_t t233; [L924] FCALL, FORK 0 pthread_create(&t233, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t233={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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L925] 0 pthread_t t234; [L926] FCALL, FORK 0 pthread_create(&t234, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t233={5:0}, t234={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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L927] 0 pthread_t t235; [L928] FCALL, FORK 0 pthread_create(&t235, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t233={5:0}, t234={6:0}, t235={7: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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L929] 0 pthread_t t236; [L930] FCALL, FORK 0 pthread_create(&t236, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t233={5:0}, t234={6:0}, t235={7:0}, t236={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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L864] 4 z$w_buff1 = z$w_buff0 [L865] 4 z$w_buff0 = 1 [L866] 4 z$w_buff1_used = z$w_buff0_used [L867] 4 z$w_buff0_used = (_Bool)1 [L868] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L868] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L869] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L870] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L871] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L872] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L873] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L874] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_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=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L877] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L878] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L879] 4 z$flush_delayed = weak$$choice2 [L880] 4 z$mem_tmp = z [L881] 4 z = !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L882] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L883] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L884] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L885] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L886] 4 z$r_buff0_thd4 = weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4)) [L887] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L888] 4 __unbuffered_p3_EAX = z [L889] 4 z = z$flush_delayed ? z$mem_tmp : z [L890] 4 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_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$$choice2=1, 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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L893] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_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$$choice2=1, 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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L770] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, 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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L773] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, 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=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L785] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_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=2, 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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L805] 3 y$w_buff1 = y$w_buff0 [L806] 3 y$w_buff0 = 2 [L807] 3 y$w_buff1_used = y$w_buff0_used [L808] 3 y$w_buff0_used = (_Bool)1 [L809] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L809] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L810] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L811] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L812] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L813] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L814] 3 y$r_buff1_thd4 = y$r_buff0_thd4 [L815] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_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=2, 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=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L818] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L819] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L820] 3 y$flush_delayed = weak$$choice2 [L821] 3 y$mem_tmp = y [L822] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L823] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L824] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L825] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L826] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L827] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L828] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L829] 3 __unbuffered_p2_EAX = y [L830] 3 y = y$flush_delayed ? y$mem_tmp : y [L831] 3 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_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=2, 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=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L834] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L835] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L836] 3 z$flush_delayed = weak$$choice2 [L837] 3 z$mem_tmp = z [L838] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L839] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L840] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L841] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L842] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L843] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L844] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L845] 3 __unbuffered_p2_EBX = z [L846] 3 z = z$flush_delayed ? z$mem_tmp : z [L847] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_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=0, x=2, 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=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L896] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L897] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L898] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L899] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L900] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 [L901] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L902] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L903] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L904] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L905] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_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=0, x=2, 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=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L788] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_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=0, x=2, 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=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L791] 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) [L792] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L793] 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 [L794] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L795] 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_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_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=0, x=2, 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=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L850] 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) [L851] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L852] 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 [L853] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L854] 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_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_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=0, x=2, 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=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L857] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L859] 3 return 0; [L778] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L780] 1 return 0; [L908] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L910] 4 return 0; [L798] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L800] 2 return 0; [L932] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L934] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L934] RET 0 assume_abort_if_not(main$tmp_guard0) [L936] 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) [L937] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L938] 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 [L939] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L940] 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 [L941] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L942] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L943] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L944] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L945] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t233={5:0}, t234={6:0}, t235={7:0}, t236={3:0}, weak$$choice2=0, x=2, 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=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L948] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L949] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L950] 0 y$flush_delayed = weak$$choice2 [L951] 0 y$mem_tmp = y [L952] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L953] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L954] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L955] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L956] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L957] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L958] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L959] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L960] 0 y = y$flush_delayed ? y$mem_tmp : y [L961] 0 y$flush_delayed = (_Bool)0 [L963] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_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=0, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] - UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 926]: 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: 930]: 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: 928]: 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: 924]: 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 9 procedures, 193 locations, 9 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: 35.4s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 20.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 627 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 627 mSDsluCounter, 112 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 69 mSDsCounter, 91 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1675 IncrementalHoareTripleChecker+Invalid, 1766 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 91 mSolverCounterUnsat, 43 mSDtfsCounter, 1675 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 68 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=829occurred in iteration=14, InterpolantAutomatonStates: 78, 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.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 7.2s InterpolantComputationTime, 293 NumberOfCodeBlocks, 293 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 250 ConstructedInterpolants, 0 QuantifiedInterpolants, 2331 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-11-17 15:13:03,819 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...