/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_power.oepc_pso.oepc_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.dk.datarace-free-lbe-02cf818-m [2023-11-17 15:12:23,427 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-17 15:12:23,511 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:23,551 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-17 15:12:23,552 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-17 15:12:23,553 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-17 15:12:23,553 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-17 15:12:23,554 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-17 15:12:23,554 INFO L153 SettingsManager]: * Use SBE=true [2023-11-17 15:12:23,558 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-17 15:12:23,559 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-17 15:12:23,559 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-17 15:12:23,559 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-17 15:12:23,561 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-17 15:12:23,561 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-17 15:12:23,561 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-17 15:12:23,561 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-17 15:12:23,561 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-17 15:12:23,562 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-17 15:12:23,562 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-17 15:12:23,562 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-17 15:12:23,563 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-17 15:12:23,563 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-17 15:12:23,563 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-17 15:12:23,564 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-17 15:12:23,565 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 15:12:23,565 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-17 15:12:23,565 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-17 15:12:23,566 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-17 15:12:23,566 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-17 15:12:23,567 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-17 15:12:23,567 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-17 15:12:23,567 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:23,828 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-17 15:12:23,861 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-17 15:12:23,864 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-17 15:12:23,865 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-17 15:12:23,866 INFO L274 PluginConnector]: CDTParser initialized [2023-11-17 15:12:23,867 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix008_power.oepc_pso.oepc_rmo.oepc.i [2023-11-17 15:12:25,018 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-17 15:12:25,304 INFO L384 CDTParser]: Found 1 translation units. [2023-11-17 15:12:25,305 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix008_power.oepc_pso.oepc_rmo.oepc.i [2023-11-17 15:12:25,333 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b235a1af/844ad920614a4c9eb2cea5cda5a1dc09/FLAGa8d9f5135 [2023-11-17 15:12:25,350 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b235a1af/844ad920614a4c9eb2cea5cda5a1dc09 [2023-11-17 15:12:25,353 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-17 15:12:25,355 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-17 15:12:25,358 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-17 15:12:25,359 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-17 15:12:25,363 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-17 15:12:25,364 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 03:12:25" (1/1) ... [2023-11-17 15:12:25,365 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c59eaa1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:12:25, skipping insertion in model container [2023-11-17 15:12:25,365 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 03:12:25" (1/1) ... [2023-11-17 15:12:25,427 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-17 15:12:25,579 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_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2023-11-17 15:12:25,832 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 15:12:25,843 INFO L202 MainTranslator]: Completed pre-run [2023-11-17 15:12:25,855 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_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2023-11-17 15:12:25,899 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 15:12:25,925 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-17 15:12:25,925 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-17 15:12:25,933 INFO L206 MainTranslator]: Completed translation [2023-11-17 15:12:25,933 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:12:25 WrapperNode [2023-11-17 15:12:25,933 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-17 15:12:25,935 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-17 15:12:25,935 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-17 15:12:25,935 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-17 15:12:25,942 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:25" (1/1) ... [2023-11-17 15:12:25,980 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:25" (1/1) ... [2023-11-17 15:12:26,019 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 144 [2023-11-17 15:12:26,020 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-17 15:12:26,020 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-17 15:12:26,020 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-17 15:12:26,021 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-17 15:12:26,032 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:25" (1/1) ... [2023-11-17 15:12:26,032 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:25" (1/1) ... [2023-11-17 15:12:26,047 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:25" (1/1) ... [2023-11-17 15:12:26,048 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:25" (1/1) ... [2023-11-17 15:12:26,055 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:25" (1/1) ... [2023-11-17 15:12:26,073 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:25" (1/1) ... [2023-11-17 15:12:26,075 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:25" (1/1) ... [2023-11-17 15:12:26,077 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:25" (1/1) ... [2023-11-17 15:12:26,080 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-17 15:12:26,081 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-17 15:12:26,081 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-17 15:12:26,081 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-17 15:12:26,082 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:12:25" (1/1) ... [2023-11-17 15:12:26,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 15:12:26,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 15:12:26,124 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:26,145 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:26,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-17 15:12:26,160 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-17 15:12:26,160 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-17 15:12:26,160 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-17 15:12:26,160 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-17 15:12:26,160 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-17 15:12:26,161 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-17 15:12:26,161 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-17 15:12:26,161 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-17 15:12:26,161 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-17 15:12:26,161 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-17 15:12:26,161 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-11-17 15:12:26,162 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-11-17 15:12:26,162 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-17 15:12:26,162 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-17 15:12:26,162 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-17 15:12:26,162 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-17 15:12:26,163 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:26,337 INFO L239 CfgBuilder]: Building ICFG [2023-11-17 15:12:26,339 INFO L265 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-17 15:12:26,699 INFO L280 CfgBuilder]: Performing block encoding [2023-11-17 15:12:26,823 INFO L302 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-17 15:12:26,824 INFO L307 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-17 15:12:26,825 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 03:12:26 BoogieIcfgContainer [2023-11-17 15:12:26,825 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-17 15:12:26,827 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-17 15:12:26,828 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-17 15:12:26,831 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-17 15:12:26,831 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 03:12:25" (1/3) ... [2023-11-17 15:12:26,832 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e220f17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 03:12:26, skipping insertion in model container [2023-11-17 15:12:26,832 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:12:25" (2/3) ... [2023-11-17 15:12:26,832 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e220f17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 03:12:26, skipping insertion in model container [2023-11-17 15:12:26,832 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 03:12:26" (3/3) ... [2023-11-17 15:12:26,833 INFO L112 eAbstractionObserver]: Analyzing ICFG mix008_power.oepc_pso.oepc_rmo.oepc.i [2023-11-17 15:12:26,851 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-17 15:12:26,851 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-17 15:12:26,851 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-17 15:12:26,919 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-17 15:12:26,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 146 places, 136 transitions, 288 flow [2023-11-17 15:12:27,035 INFO L124 PetriNetUnfolderBase]: 3/132 cut-off events. [2023-11-17 15:12:27,035 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 15:12:27,042 INFO L83 FinitePrefix]: Finished finitePrefix Result has 145 conditions, 132 events. 3/132 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 77 event pairs, 0 based on Foata normal form. 0/127 useless extension candidates. Maximal degree in co-relation 94. Up to 2 conditions per place. [2023-11-17 15:12:27,042 INFO L82 GeneralOperation]: Start removeDead. Operand has 146 places, 136 transitions, 288 flow [2023-11-17 15:12:27,046 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 142 places, 132 transitions, 276 flow [2023-11-17 15:12:27,052 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-11-17 15:12:27,063 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 142 places, 132 transitions, 276 flow [2023-11-17 15:12:27,065 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 142 places, 132 transitions, 276 flow [2023-11-17 15:12:27,066 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 142 places, 132 transitions, 276 flow [2023-11-17 15:12:27,098 INFO L124 PetriNetUnfolderBase]: 3/132 cut-off events. [2023-11-17 15:12:27,099 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 15:12:27,100 INFO L83 FinitePrefix]: Finished finitePrefix Result has 145 conditions, 132 events. 3/132 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 77 event pairs, 0 based on Foata normal form. 0/127 useless extension candidates. Maximal degree in co-relation 94. Up to 2 conditions per place. [2023-11-17 15:12:27,103 INFO L119 LiptonReduction]: Number of co-enabled transitions 3692 [2023-11-17 15:12:31,694 INFO L134 LiptonReduction]: Checked pairs total: 9279 [2023-11-17 15:12:31,695 INFO L136 LiptonReduction]: Total number of compositions: 116 [2023-11-17 15:12:31,717 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-17 15:12:31,725 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;@4cbb942f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-17 15:12:31,725 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-11-17 15:12:31,729 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-17 15:12:31,729 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-11-17 15:12:31,729 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 15:12:31,730 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:12:31,730 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-11-17 15:12:31,731 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 15:12:31,736 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:12:31,736 INFO L85 PathProgramCache]: Analyzing trace with hash 568235, now seen corresponding path program 1 times [2023-11-17 15:12:31,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:12:31,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096418385] [2023-11-17 15:12:31,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:12:31,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:12:31,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:12:32,169 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:32,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:12:32,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096418385] [2023-11-17 15:12:32,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096418385] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:12:32,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:12:32,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-17 15:12:32,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229250928] [2023-11-17 15:12:32,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:12:32,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 15:12:32,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:12:32,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 15:12:32,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 15:12:32,214 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 252 [2023-11-17 15:12:32,219 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 32 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 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:32,219 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:12:32,219 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 252 [2023-11-17 15:12:32,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:12:33,217 INFO L124 PetriNetUnfolderBase]: 4903/7152 cut-off events. [2023-11-17 15:12:33,217 INFO L125 PetriNetUnfolderBase]: For 79/79 co-relation queries the response was YES. [2023-11-17 15:12:33,236 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14000 conditions, 7152 events. 4903/7152 cut-off events. For 79/79 co-relation queries the response was YES. Maximal size of possible extension queue 374. Compared 42990 event pairs, 895 based on Foata normal form. 0/6802 useless extension candidates. Maximal degree in co-relation 13988. Up to 5335 conditions per place. [2023-11-17 15:12:33,270 INFO L140 encePairwiseOnDemand]: 248/252 looper letters, 41 selfloop transitions, 2 changer transitions 2/50 dead transitions. [2023-11-17 15:12:33,271 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 50 transitions, 211 flow [2023-11-17 15:12:33,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 15:12:33,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 15:12:33,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 405 transitions. [2023-11-17 15:12:33,284 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5357142857142857 [2023-11-17 15:12:33,285 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 405 transitions. [2023-11-17 15:12:33,285 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 405 transitions. [2023-11-17 15:12:33,287 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:12:33,289 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 405 transitions. [2023-11-17 15:12:33,294 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 135.0) internal successors, (405), 3 states have internal predecessors, (405), 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:33,300 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 252.0) internal successors, (1008), 4 states have internal predecessors, (1008), 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:33,301 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 252.0) internal successors, (1008), 4 states have internal predecessors, (1008), 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:33,302 INFO L175 Difference]: Start difference. First operand has 44 places, 32 transitions, 76 flow. Second operand 3 states and 405 transitions. [2023-11-17 15:12:33,303 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 50 transitions, 211 flow [2023-11-17 15:12:33,306 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 50 transitions, 204 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-17 15:12:33,307 INFO L231 Difference]: Finished difference. Result has 41 places, 29 transitions, 70 flow [2023-11-17 15:12:33,309 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=252, 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:33,314 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, -3 predicate places. [2023-11-17 15:12:33,314 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 29 transitions, 70 flow [2023-11-17 15:12:33,315 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 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:33,315 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:12:33,315 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:12:33,316 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-17 15:12:33,316 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 15:12:33,316 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:12:33,316 INFO L85 PathProgramCache]: Analyzing trace with hash 1599434594, now seen corresponding path program 1 times [2023-11-17 15:12:33,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:12:33,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286673062] [2023-11-17 15:12:33,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:12:33,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:12:33,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:12:33,647 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:33,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:12:33,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286673062] [2023-11-17 15:12:33,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286673062] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:12:33,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:12:33,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-17 15:12:33,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725743998] [2023-11-17 15:12:33,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:12:33,650 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 15:12:33,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:12:33,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 15:12:33,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 15:12:33,654 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 252 [2023-11-17 15:12:33,655 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 29 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 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:33,655 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:12:33,655 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 252 [2023-11-17 15:12:33,655 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:12:36,363 INFO L124 PetriNetUnfolderBase]: 19829/26882 cut-off events. [2023-11-17 15:12:36,364 INFO L125 PetriNetUnfolderBase]: For 1227/1227 co-relation queries the response was YES. [2023-11-17 15:12:36,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55580 conditions, 26882 events. 19829/26882 cut-off events. For 1227/1227 co-relation queries the response was YES. Maximal size of possible extension queue 830. Compared 145146 event pairs, 6979 based on Foata normal form. 760/27642 useless extension candidates. Maximal degree in co-relation 55570. Up to 16304 conditions per place. [2023-11-17 15:12:36,561 INFO L140 encePairwiseOnDemand]: 242/252 looper letters, 44 selfloop transitions, 9 changer transitions 0/53 dead transitions. [2023-11-17 15:12:36,562 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 53 transitions, 230 flow [2023-11-17 15:12:36,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 15:12:36,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 15:12:36,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 372 transitions. [2023-11-17 15:12:36,568 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49206349206349204 [2023-11-17 15:12:36,568 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 372 transitions. [2023-11-17 15:12:36,568 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 372 transitions. [2023-11-17 15:12:36,568 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:12:36,569 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 372 transitions. [2023-11-17 15:12:36,570 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 124.0) internal successors, (372), 3 states have internal predecessors, (372), 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,572 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 252.0) internal successors, (1008), 4 states have internal predecessors, (1008), 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,573 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 252.0) internal successors, (1008), 4 states have internal predecessors, (1008), 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,573 INFO L175 Difference]: Start difference. First operand has 41 places, 29 transitions, 70 flow. Second operand 3 states and 372 transitions. [2023-11-17 15:12:36,573 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 53 transitions, 230 flow [2023-11-17 15:12:36,576 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 53 transitions, 224 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-17 15:12:36,577 INFO L231 Difference]: Finished difference. Result has 42 places, 37 transitions, 136 flow [2023-11-17 15:12:36,577 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=252, 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=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=136, PETRI_PLACES=42, PETRI_TRANSITIONS=37} [2023-11-17 15:12:36,579 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, -2 predicate places. [2023-11-17 15:12:36,580 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 37 transitions, 136 flow [2023-11-17 15:12:36,581 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 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,581 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:12:36,583 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:12:36,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-17 15:12:36,586 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 15:12:36,591 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:12:36,592 INFO L85 PathProgramCache]: Analyzing trace with hash -1957137276, now seen corresponding path program 1 times [2023-11-17 15:12:36,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:12:36,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546862071] [2023-11-17 15:12:36,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:12:36,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:12:36,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:12:36,774 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,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:12:36,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546862071] [2023-11-17 15:12:36,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546862071] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:12:36,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:12:36,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 15:12:36,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117669137] [2023-11-17 15:12:36,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:12:36,776 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 15:12:36,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:12:36,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 15:12:36,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-17 15:12:36,777 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 252 [2023-11-17 15:12:36,778 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 37 transitions, 136 flow. Second operand has 4 states, 4 states have (on average 109.0) internal successors, (436), 4 states have internal predecessors, (436), 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,778 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:12:36,778 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 252 [2023-11-17 15:12:36,778 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:12:39,317 INFO L124 PetriNetUnfolderBase]: 19443/26362 cut-off events. [2023-11-17 15:12:39,317 INFO L125 PetriNetUnfolderBase]: For 10561/10561 co-relation queries the response was YES. [2023-11-17 15:12:39,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67589 conditions, 26362 events. 19443/26362 cut-off events. For 10561/10561 co-relation queries the response was YES. Maximal size of possible extension queue 807. Compared 144517 event pairs, 1402 based on Foata normal form. 50/26412 useless extension candidates. Maximal degree in co-relation 67577. Up to 15458 conditions per place. [2023-11-17 15:12:39,484 INFO L140 encePairwiseOnDemand]: 242/252 looper letters, 62 selfloop transitions, 13 changer transitions 0/75 dead transitions. [2023-11-17 15:12:39,484 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 75 transitions, 404 flow [2023-11-17 15:12:39,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 15:12:39,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-17 15:12:39,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 494 transitions. [2023-11-17 15:12:39,486 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49007936507936506 [2023-11-17 15:12:39,486 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 494 transitions. [2023-11-17 15:12:39,487 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 494 transitions. [2023-11-17 15:12:39,487 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:12:39,487 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 494 transitions. [2023-11-17 15:12:39,488 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 123.5) internal successors, (494), 4 states have internal predecessors, (494), 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:39,491 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 252.0) internal successors, (1260), 5 states have internal predecessors, (1260), 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:39,491 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 252.0) internal successors, (1260), 5 states have internal predecessors, (1260), 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:39,492 INFO L175 Difference]: Start difference. First operand has 42 places, 37 transitions, 136 flow. Second operand 4 states and 494 transitions. [2023-11-17 15:12:39,492 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 75 transitions, 404 flow [2023-11-17 15:12:39,634 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 75 transitions, 374 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-17 15:12:39,636 INFO L231 Difference]: Finished difference. Result has 46 places, 45 transitions, 216 flow [2023-11-17 15:12:39,636 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=216, PETRI_PLACES=46, PETRI_TRANSITIONS=45} [2023-11-17 15:12:39,638 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 2 predicate places. [2023-11-17 15:12:39,638 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 45 transitions, 216 flow [2023-11-17 15:12:39,638 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 109.0) internal successors, (436), 4 states have internal predecessors, (436), 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:39,639 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:12:39,639 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:12:39,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-17 15:12:39,639 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 15:12:39,640 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:12:39,640 INFO L85 PathProgramCache]: Analyzing trace with hash -1957136346, now seen corresponding path program 1 times [2023-11-17 15:12:39,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:12:39,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935346046] [2023-11-17 15:12:39,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:12:39,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:12:39,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:12:39,806 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:39,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:12:39,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935346046] [2023-11-17 15:12:39,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935346046] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:12:39,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:12:39,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 15:12:39,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049357776] [2023-11-17 15:12:39,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:12:39,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 15:12:39,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:12:39,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 15:12:39,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-17 15:12:39,810 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 252 [2023-11-17 15:12:39,811 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 45 transitions, 216 flow. Second operand has 4 states, 4 states have (on average 109.0) internal successors, (436), 4 states have internal predecessors, (436), 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:39,811 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:12:39,811 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 252 [2023-11-17 15:12:39,811 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:12:42,026 INFO L124 PetriNetUnfolderBase]: 18363/24910 cut-off events. [2023-11-17 15:12:42,027 INFO L125 PetriNetUnfolderBase]: For 23258/23258 co-relation queries the response was YES. [2023-11-17 15:12:42,078 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69183 conditions, 24910 events. 18363/24910 cut-off events. For 23258/23258 co-relation queries the response was YES. Maximal size of possible extension queue 753. Compared 132818 event pairs, 3733 based on Foata normal form. 210/25120 useless extension candidates. Maximal degree in co-relation 69168. Up to 11521 conditions per place. [2023-11-17 15:12:42,179 INFO L140 encePairwiseOnDemand]: 243/252 looper letters, 72 selfloop transitions, 9 changer transitions 0/81 dead transitions. [2023-11-17 15:12:42,179 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 81 transitions, 496 flow [2023-11-17 15:12:42,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 15:12:42,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-17 15:12:42,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 491 transitions. [2023-11-17 15:12:42,182 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4871031746031746 [2023-11-17 15:12:42,182 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 491 transitions. [2023-11-17 15:12:42,182 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 491 transitions. [2023-11-17 15:12:42,183 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:12:42,183 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 491 transitions. [2023-11-17 15:12:42,184 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 122.75) internal successors, (491), 4 states have internal predecessors, (491), 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:42,189 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 252.0) internal successors, (1260), 5 states have internal predecessors, (1260), 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:42,189 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 252.0) internal successors, (1260), 5 states have internal predecessors, (1260), 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:42,190 INFO L175 Difference]: Start difference. First operand has 46 places, 45 transitions, 216 flow. Second operand 4 states and 491 transitions. [2023-11-17 15:12:42,190 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 81 transitions, 496 flow [2023-11-17 15:12:42,271 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 81 transitions, 496 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-17 15:12:42,273 INFO L231 Difference]: Finished difference. Result has 52 places, 50 transitions, 304 flow [2023-11-17 15:12:42,274 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=304, PETRI_PLACES=52, PETRI_TRANSITIONS=50} [2023-11-17 15:12:42,275 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 8 predicate places. [2023-11-17 15:12:42,276 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 50 transitions, 304 flow [2023-11-17 15:12:42,277 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 109.0) internal successors, (436), 4 states have internal predecessors, (436), 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:42,277 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:12:42,277 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:12:42,277 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-17 15:12:42,277 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 15:12:42,277 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:12:42,277 INFO L85 PathProgramCache]: Analyzing trace with hash 594617939, now seen corresponding path program 1 times [2023-11-17 15:12:42,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:12:42,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657787442] [2023-11-17 15:12:42,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:12:42,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:12:42,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:12:42,432 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:42,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:12:42,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657787442] [2023-11-17 15:12:42,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657787442] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:12:42,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:12:42,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 15:12:42,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558085926] [2023-11-17 15:12:42,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:12:42,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 15:12:42,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:12:42,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 15:12:42,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-17 15:12:42,434 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 252 [2023-11-17 15:12:42,435 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 50 transitions, 304 flow. Second operand has 4 states, 4 states have (on average 109.25) internal successors, (437), 4 states have internal predecessors, (437), 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:42,436 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:12:42,438 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 252 [2023-11-17 15:12:42,439 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:12:44,795 INFO L124 PetriNetUnfolderBase]: 18029/24456 cut-off events. [2023-11-17 15:12:44,796 INFO L125 PetriNetUnfolderBase]: For 44705/44705 co-relation queries the response was YES. [2023-11-17 15:12:44,899 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75462 conditions, 24456 events. 18029/24456 cut-off events. For 44705/44705 co-relation queries the response was YES. Maximal size of possible extension queue 731. Compared 130372 event pairs, 3390 based on Foata normal form. 48/24504 useless extension candidates. Maximal degree in co-relation 75442. Up to 13959 conditions per place. [2023-11-17 15:12:45,010 INFO L140 encePairwiseOnDemand]: 242/252 looper letters, 67 selfloop transitions, 26 changer transitions 0/93 dead transitions. [2023-11-17 15:12:45,010 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 93 transitions, 644 flow [2023-11-17 15:12:45,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 15:12:45,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-17 15:12:45,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 499 transitions. [2023-11-17 15:12:45,015 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49503968253968256 [2023-11-17 15:12:45,015 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 499 transitions. [2023-11-17 15:12:45,016 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 499 transitions. [2023-11-17 15:12:45,016 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:12:45,016 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 499 transitions. [2023-11-17 15:12:45,021 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 124.75) internal successors, (499), 4 states have internal predecessors, (499), 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:45,023 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 252.0) internal successors, (1260), 5 states have internal predecessors, (1260), 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:45,024 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 252.0) internal successors, (1260), 5 states have internal predecessors, (1260), 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:45,024 INFO L175 Difference]: Start difference. First operand has 52 places, 50 transitions, 304 flow. Second operand 4 states and 499 transitions. [2023-11-17 15:12:45,024 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 93 transitions, 644 flow [2023-11-17 15:12:45,214 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 93 transitions, 640 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-17 15:12:45,216 INFO L231 Difference]: Finished difference. Result has 56 places, 58 transitions, 449 flow [2023-11-17 15:12:45,216 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=301, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=449, PETRI_PLACES=56, PETRI_TRANSITIONS=58} [2023-11-17 15:12:45,217 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 12 predicate places. [2023-11-17 15:12:45,217 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 58 transitions, 449 flow [2023-11-17 15:12:45,217 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 109.25) internal successors, (437), 4 states have internal predecessors, (437), 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:45,217 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:12:45,218 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:12:45,218 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-17 15:12:45,218 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 15:12:45,218 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:12:45,218 INFO L85 PathProgramCache]: Analyzing trace with hash 386712865, now seen corresponding path program 1 times [2023-11-17 15:12:45,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:12:45,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444926377] [2023-11-17 15:12:45,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:12:45,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:12:45,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:12:45,374 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:45,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:12:45,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444926377] [2023-11-17 15:12:45,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444926377] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:12:45,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:12:45,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-17 15:12:45,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005636717] [2023-11-17 15:12:45,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:12:45,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 15:12:45,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:12:45,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 15:12:45,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 15:12:45,381 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 252 [2023-11-17 15:12:45,381 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 58 transitions, 449 flow. Second operand has 3 states, 3 states have (on average 121.33333333333333) internal successors, (364), 3 states have internal predecessors, (364), 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:45,381 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:12:45,381 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 252 [2023-11-17 15:12:45,381 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:12:47,571 INFO L124 PetriNetUnfolderBase]: 12541/17886 cut-off events. [2023-11-17 15:12:47,571 INFO L125 PetriNetUnfolderBase]: For 41793/44055 co-relation queries the response was YES. [2023-11-17 15:12:47,634 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55594 conditions, 17886 events. 12541/17886 cut-off events. For 41793/44055 co-relation queries the response was YES. Maximal size of possible extension queue 735. Compared 104514 event pairs, 4052 based on Foata normal form. 774/18184 useless extension candidates. Maximal degree in co-relation 55571. Up to 11847 conditions per place. [2023-11-17 15:12:47,758 INFO L140 encePairwiseOnDemand]: 249/252 looper letters, 52 selfloop transitions, 6 changer transitions 0/75 dead transitions. [2023-11-17 15:12:47,758 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 75 transitions, 663 flow [2023-11-17 15:12:47,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 15:12:47,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 15:12:47,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 388 transitions. [2023-11-17 15:12:47,760 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5132275132275133 [2023-11-17 15:12:47,760 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 388 transitions. [2023-11-17 15:12:47,760 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 388 transitions. [2023-11-17 15:12:47,761 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:12:47,761 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 388 transitions. [2023-11-17 15:12:47,763 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 129.33333333333334) internal successors, (388), 3 states have internal predecessors, (388), 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,764 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 252.0) internal successors, (1008), 4 states have internal predecessors, (1008), 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,765 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 252.0) internal successors, (1008), 4 states have internal predecessors, (1008), 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,765 INFO L175 Difference]: Start difference. First operand has 56 places, 58 transitions, 449 flow. Second operand 3 states and 388 transitions. [2023-11-17 15:12:47,765 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 75 transitions, 663 flow [2023-11-17 15:12:47,825 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 75 transitions, 663 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-17 15:12:47,826 INFO L231 Difference]: Finished difference. Result has 59 places, 58 transitions, 469 flow [2023-11-17 15:12:47,826 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=449, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=469, PETRI_PLACES=59, PETRI_TRANSITIONS=58} [2023-11-17 15:12:47,829 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 15 predicate places. [2023-11-17 15:12:47,829 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 58 transitions, 469 flow [2023-11-17 15:12:47,830 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 121.33333333333333) internal successors, (364), 3 states have internal predecessors, (364), 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,830 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:12:47,830 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,830 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-17 15:12:47,830 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 15:12:47,831 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:12:47,831 INFO L85 PathProgramCache]: Analyzing trace with hash 860921594, now seen corresponding path program 1 times [2023-11-17 15:12:47,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:12:47,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507818254] [2023-11-17 15:12:47,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:12:47,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:12:47,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:12:48,002 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,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:12:48,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507818254] [2023-11-17 15:12:48,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507818254] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:12:48,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:12:48,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 15:12:48,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946712201] [2023-11-17 15:12:48,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:12:48,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 15:12:48,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:12:48,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 15:12:48,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-17 15:12:48,005 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 252 [2023-11-17 15:12:48,005 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 58 transitions, 469 flow. Second operand has 4 states, 4 states have (on average 114.5) internal successors, (458), 4 states have internal predecessors, (458), 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,005 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:12:48,005 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 252 [2023-11-17 15:12:48,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:12:49,046 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([405] L786-->L793: Formula: (let ((.cse1 (not (= 0 (mod v_~a$r_buff1_thd2~0_16 256)))) (.cse5 (not (= (mod v_~a$r_buff0_thd2~0_18 256) 0))) (.cse0 (not (= (mod v_~a$w_buff0_used~0_111 256) 0)))) (let ((.cse3 (and .cse5 .cse0)) (.cse2 (and (not (= (mod v_~a$w_buff0_used~0_112 256) 0)) .cse5)) (.cse4 (and .cse1 (not (= (mod v_~a$w_buff1_used~0_103 256) 0))))) (and (= v_~a$r_buff1_thd2~0_15 (ite (or (and (not (= (mod v_~a$r_buff0_thd2~0_17 256) 0)) .cse0) (and (not (= (mod v_~a$w_buff1_used~0_102 256) 0)) .cse1)) 0 v_~a$r_buff1_thd2~0_16)) (= (ite .cse2 0 v_~a$w_buff0_used~0_112) v_~a$w_buff0_used~0_111) (= (ite (or .cse3 .cse4) 0 v_~a$w_buff1_used~0_103) v_~a$w_buff1_used~0_102) (= v_~a$r_buff0_thd2~0_17 (ite .cse3 0 v_~a$r_buff0_thd2~0_18)) (= v_~a~0_50 (ite .cse2 v_~a$w_buff0~0_34 (ite .cse4 v_~a$w_buff1~0_31 v_~a~0_51)))))) InVars {~a~0=v_~a~0_51, ~a$w_buff1~0=v_~a$w_buff1~0_31, ~a$w_buff0~0=v_~a$w_buff0~0_34, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_16, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_18, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_112, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_103} OutVars{~a~0=v_~a~0_50, ~a$w_buff1~0=v_~a$w_buff1~0_31, ~a$w_buff0~0=v_~a$w_buff0~0_34, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_15, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_17, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_111, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_102} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd2~0, ~a$r_buff0_thd2~0, ~a$w_buff0_used~0, ~a$w_buff1_used~0][110], [75#L809true, 114#L793true, 170#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 161#(<= ~y~0 0), 83#L826true, 162#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 32#L880true, Black: 159#true, 190#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 107#P0EXITtrue, P3Thread1of1ForFork2InUse, Black: 169#(<= ~__unbuffered_p2_EAX~0 0), Black: 167#true, P1Thread1of1ForFork3InUse, P0Thread1of1ForFork1InUse, P2Thread1of1ForFork0InUse, Black: 177#(= ~x~0 0), 184#(= ~__unbuffered_p3_EAX~0 0), Black: 153#true, 178#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))]) [2023-11-17 15:12:49,047 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2023-11-17 15:12:49,047 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-17 15:12:49,047 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-17 15:12:49,047 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-17 15:12:49,665 INFO L124 PetriNetUnfolderBase]: 10244/15357 cut-off events. [2023-11-17 15:12:49,665 INFO L125 PetriNetUnfolderBase]: For 30768/32234 co-relation queries the response was YES. [2023-11-17 15:12:49,739 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45578 conditions, 15357 events. 10244/15357 cut-off events. For 30768/32234 co-relation queries the response was YES. Maximal size of possible extension queue 765. Compared 99942 event pairs, 1629 based on Foata normal form. 1876/16878 useless extension candidates. Maximal degree in co-relation 45552. Up to 8985 conditions per place. [2023-11-17 15:12:49,807 INFO L140 encePairwiseOnDemand]: 245/252 looper letters, 104 selfloop transitions, 10 changer transitions 0/136 dead transitions. [2023-11-17 15:12:49,807 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 136 transitions, 1177 flow [2023-11-17 15:12:49,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 15:12:49,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 15:12:49,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 627 transitions. [2023-11-17 15:12:49,810 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4976190476190476 [2023-11-17 15:12:49,810 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 627 transitions. [2023-11-17 15:12:49,810 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 627 transitions. [2023-11-17 15:12:49,810 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:12:49,811 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 627 transitions. [2023-11-17 15:12:49,812 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 125.4) internal successors, (627), 5 states have internal predecessors, (627), 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:49,816 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 252.0) internal successors, (1512), 6 states have internal predecessors, (1512), 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:49,816 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 252.0) internal successors, (1512), 6 states have internal predecessors, (1512), 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:49,817 INFO L175 Difference]: Start difference. First operand has 59 places, 58 transitions, 469 flow. Second operand 5 states and 627 transitions. [2023-11-17 15:12:49,817 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 136 transitions, 1177 flow [2023-11-17 15:12:49,852 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 136 transitions, 1165 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-17 15:12:49,856 INFO L231 Difference]: Finished difference. Result has 64 places, 67 transitions, 532 flow [2023-11-17 15:12:49,856 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=457, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=532, PETRI_PLACES=64, PETRI_TRANSITIONS=67} [2023-11-17 15:12:49,857 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 20 predicate places. [2023-11-17 15:12:49,857 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 67 transitions, 532 flow [2023-11-17 15:12:49,857 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 114.5) internal successors, (458), 4 states have internal predecessors, (458), 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:49,857 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:12:49,857 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:49,858 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-17 15:12:49,859 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 15:12:49,859 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:12:49,859 INFO L85 PathProgramCache]: Analyzing trace with hash -336304771, now seen corresponding path program 1 times [2023-11-17 15:12:49,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:12:49,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036725539] [2023-11-17 15:12:49,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:12:49,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:12:49,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:12:50,068 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:50,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:12:50,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036725539] [2023-11-17 15:12:50,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036725539] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:12:50,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:12:50,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 15:12:50,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233436613] [2023-11-17 15:12:50,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:12:50,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 15:12:50,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:12:50,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 15:12:50,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-17 15:12:50,071 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 252 [2023-11-17 15:12:50,071 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 67 transitions, 532 flow. Second operand has 4 states, 4 states have (on average 111.0) internal successors, (444), 4 states have internal predecessors, (444), 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,072 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:12:50,072 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 252 [2023-11-17 15:12:50,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:12:52,871 INFO L124 PetriNetUnfolderBase]: 21516/30462 cut-off events. [2023-11-17 15:12:52,872 INFO L125 PetriNetUnfolderBase]: For 105693/105693 co-relation queries the response was YES. [2023-11-17 15:12:53,005 INFO L83 FinitePrefix]: Finished finitePrefix Result has 123643 conditions, 30462 events. 21516/30462 cut-off events. For 105693/105693 co-relation queries the response was YES. Maximal size of possible extension queue 1015. Compared 184189 event pairs, 5051 based on Foata normal form. 168/30630 useless extension candidates. Maximal degree in co-relation 123614. Up to 13678 conditions per place. [2023-11-17 15:12:53,098 INFO L140 encePairwiseOnDemand]: 242/252 looper letters, 87 selfloop transitions, 24 changer transitions 23/134 dead transitions. [2023-11-17 15:12:53,098 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 134 transitions, 1191 flow [2023-11-17 15:12:53,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 15:12:53,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-17 15:12:53,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 501 transitions. [2023-11-17 15:12:53,103 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49702380952380953 [2023-11-17 15:12:53,103 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 501 transitions. [2023-11-17 15:12:53,103 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 501 transitions. [2023-11-17 15:12:53,104 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:12:53,104 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 501 transitions. [2023-11-17 15:12:53,105 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 125.25) internal successors, (501), 4 states have internal predecessors, (501), 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,107 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 252.0) internal successors, (1260), 5 states have internal predecessors, (1260), 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,107 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 252.0) internal successors, (1260), 5 states have internal predecessors, (1260), 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,107 INFO L175 Difference]: Start difference. First operand has 64 places, 67 transitions, 532 flow. Second operand 4 states and 501 transitions. [2023-11-17 15:12:53,107 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 134 transitions, 1191 flow [2023-11-17 15:12:53,423 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 134 transitions, 1178 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-17 15:12:53,425 INFO L231 Difference]: Finished difference. Result has 69 places, 66 transitions, 681 flow [2023-11-17 15:12:53,425 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=527, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=681, PETRI_PLACES=69, PETRI_TRANSITIONS=66} [2023-11-17 15:12:53,426 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 25 predicate places. [2023-11-17 15:12:53,426 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 66 transitions, 681 flow [2023-11-17 15:12:53,426 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 111.0) internal successors, (444), 4 states have internal predecessors, (444), 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,426 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:12:53,426 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,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-17 15:12:53,427 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 15:12:53,427 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:12:53,427 INFO L85 PathProgramCache]: Analyzing trace with hash 526578967, now seen corresponding path program 1 times [2023-11-17 15:12:53,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:12:53,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476583288] [2023-11-17 15:12:53,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:12:53,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:12:53,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:12:53,630 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,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:12:53,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476583288] [2023-11-17 15:12:53,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476583288] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:12:53,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:12:53,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-17 15:12:53,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592342425] [2023-11-17 15:12:53,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:12:53,633 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-17 15:12:53,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:12:53,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-17 15:12:53,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-17 15:12:53,634 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 252 [2023-11-17 15:12:53,635 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 66 transitions, 681 flow. Second operand has 5 states, 5 states have (on average 114.2) internal successors, (571), 5 states have internal predecessors, (571), 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,635 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:12:53,635 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 252 [2023-11-17 15:12:53,635 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:12:55,183 INFO L124 PetriNetUnfolderBase]: 7836/12402 cut-off events. [2023-11-17 15:12:55,183 INFO L125 PetriNetUnfolderBase]: For 39242/40860 co-relation queries the response was YES. [2023-11-17 15:12:55,224 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45163 conditions, 12402 events. 7836/12402 cut-off events. For 39242/40860 co-relation queries the response was YES. Maximal size of possible extension queue 604. Compared 84934 event pairs, 1157 based on Foata normal form. 1617/13735 useless extension candidates. Maximal degree in co-relation 45130. Up to 4446 conditions per place. [2023-11-17 15:12:55,262 INFO L140 encePairwiseOnDemand]: 245/252 looper letters, 130 selfloop transitions, 14 changer transitions 3/171 dead transitions. [2023-11-17 15:12:55,263 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 171 transitions, 1859 flow [2023-11-17 15:12:55,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-17 15:12:55,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-17 15:12:55,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 755 transitions. [2023-11-17 15:12:55,266 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49933862433862436 [2023-11-17 15:12:55,266 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 755 transitions. [2023-11-17 15:12:55,266 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 755 transitions. [2023-11-17 15:12:55,266 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:12:55,266 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 755 transitions. [2023-11-17 15:12:55,268 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 125.83333333333333) internal successors, (755), 6 states have internal predecessors, (755), 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,270 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 252.0) internal successors, (1764), 7 states have internal predecessors, (1764), 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,270 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 252.0) internal successors, (1764), 7 states have internal predecessors, (1764), 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,270 INFO L175 Difference]: Start difference. First operand has 69 places, 66 transitions, 681 flow. Second operand 6 states and 755 transitions. [2023-11-17 15:12:55,270 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 171 transitions, 1859 flow [2023-11-17 15:12:55,376 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 171 transitions, 1843 flow, removed 8 selfloop flow, removed 1 redundant places. [2023-11-17 15:12:55,381 INFO L231 Difference]: Finished difference. Result has 74 places, 75 transitions, 793 flow [2023-11-17 15:12:55,381 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=673, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=793, PETRI_PLACES=74, PETRI_TRANSITIONS=75} [2023-11-17 15:12:55,382 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 30 predicate places. [2023-11-17 15:12:55,382 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 75 transitions, 793 flow [2023-11-17 15:12:55,384 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 114.2) internal successors, (571), 5 states have internal predecessors, (571), 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,384 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:12:55,384 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:55,385 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-17 15:12:55,385 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 15:12:55,385 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:12:55,385 INFO L85 PathProgramCache]: Analyzing trace with hash 172927235, now seen corresponding path program 1 times [2023-11-17 15:12:55,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:12:55,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137648177] [2023-11-17 15:12:55,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:12:55,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:12:55,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:12:55,584 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,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:12:55,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137648177] [2023-11-17 15:12:55,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137648177] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:12:55,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:12:55,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 15:12:55,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649732616] [2023-11-17 15:12:55,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:12:55,585 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 15:12:55,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:12:55,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 15:12:55,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-17 15:12:55,586 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 252 [2023-11-17 15:12:55,587 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 75 transitions, 793 flow. Second operand has 4 states, 4 states have (on average 119.25) internal successors, (477), 4 states have internal predecessors, (477), 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,587 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:12:55,587 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 252 [2023-11-17 15:12:55,587 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:12:57,524 INFO L124 PetriNetUnfolderBase]: 12932/19878 cut-off events. [2023-11-17 15:12:57,524 INFO L125 PetriNetUnfolderBase]: For 100085/101914 co-relation queries the response was YES. [2023-11-17 15:12:57,610 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90166 conditions, 19878 events. 12932/19878 cut-off events. For 100085/101914 co-relation queries the response was YES. Maximal size of possible extension queue 899. Compared 137459 event pairs, 2395 based on Foata normal form. 834/20560 useless extension candidates. Maximal degree in co-relation 90129. Up to 9918 conditions per place. [2023-11-17 15:12:57,649 INFO L140 encePairwiseOnDemand]: 249/252 looper letters, 99 selfloop transitions, 4 changer transitions 23/140 dead transitions. [2023-11-17 15:12:57,650 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 140 transitions, 1641 flow [2023-11-17 15:12:57,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 15:12:57,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-17 15:12:57,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 509 transitions. [2023-11-17 15:12:57,652 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5049603174603174 [2023-11-17 15:12:57,652 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 509 transitions. [2023-11-17 15:12:57,652 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 509 transitions. [2023-11-17 15:12:57,652 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:12:57,652 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 509 transitions. [2023-11-17 15:12:57,653 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 127.25) internal successors, (509), 4 states have internal predecessors, (509), 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,657 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 252.0) internal successors, (1260), 5 states have internal predecessors, (1260), 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,658 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 252.0) internal successors, (1260), 5 states have internal predecessors, (1260), 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,658 INFO L175 Difference]: Start difference. First operand has 74 places, 75 transitions, 793 flow. Second operand 4 states and 509 transitions. [2023-11-17 15:12:57,658 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 140 transitions, 1641 flow [2023-11-17 15:12:58,602 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 140 transitions, 1523 flow, removed 47 selfloop flow, removed 2 redundant places. [2023-11-17 15:12:58,603 INFO L231 Difference]: Finished difference. Result has 77 places, 78 transitions, 812 flow [2023-11-17 15:12:58,604 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=749, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=812, PETRI_PLACES=77, PETRI_TRANSITIONS=78} [2023-11-17 15:12:58,604 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 33 predicate places. [2023-11-17 15:12:58,604 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 78 transitions, 812 flow [2023-11-17 15:12:58,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 119.25) internal successors, (477), 4 states have internal predecessors, (477), 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,605 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:12:58,605 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:12:58,605 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-17 15:12:58,605 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 15:12:58,605 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:12:58,606 INFO L85 PathProgramCache]: Analyzing trace with hash -738241371, now seen corresponding path program 1 times [2023-11-17 15:12:58,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:12:58,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894843881] [2023-11-17 15:12:58,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:12:58,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:12:58,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:12:58,799 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,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:12:58,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894843881] [2023-11-17 15:12:58,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894843881] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:12:58,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:12:58,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-17 15:12:58,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246575769] [2023-11-17 15:12:58,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:12:58,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-17 15:12:58,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:12:58,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-17 15:12:58,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-17 15:12:58,802 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 252 [2023-11-17 15:12:58,802 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 78 transitions, 812 flow. Second operand has 6 states, 6 states have (on average 114.0) internal successors, (684), 6 states have internal predecessors, (684), 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,802 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:12:58,802 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 252 [2023-11-17 15:12:58,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:13:00,723 INFO L124 PetriNetUnfolderBase]: 9990/15895 cut-off events. [2023-11-17 15:13:00,723 INFO L125 PetriNetUnfolderBase]: For 56253/58436 co-relation queries the response was YES. [2023-11-17 15:13:00,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61300 conditions, 15895 events. 9990/15895 cut-off events. For 56253/58436 co-relation queries the response was YES. Maximal size of possible extension queue 860. Compared 115251 event pairs, 1185 based on Foata normal form. 1382/16990 useless extension candidates. Maximal degree in co-relation 61262. Up to 4029 conditions per place. [2023-11-17 15:13:00,791 INFO L140 encePairwiseOnDemand]: 245/252 looper letters, 142 selfloop transitions, 23 changer transitions 19/211 dead transitions. [2023-11-17 15:13:00,791 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 211 transitions, 2330 flow [2023-11-17 15:13:00,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-17 15:13:00,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-17 15:13:00,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1006 transitions. [2023-11-17 15:13:00,794 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4990079365079365 [2023-11-17 15:13:00,794 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1006 transitions. [2023-11-17 15:13:00,794 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1006 transitions. [2023-11-17 15:13:00,795 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:13:00,795 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1006 transitions. [2023-11-17 15:13:00,797 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 125.75) internal successors, (1006), 8 states have internal predecessors, (1006), 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,802 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 252.0) internal successors, (2268), 9 states have internal predecessors, (2268), 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,802 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 252.0) internal successors, (2268), 9 states have internal predecessors, (2268), 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,802 INFO L175 Difference]: Start difference. First operand has 77 places, 78 transitions, 812 flow. Second operand 8 states and 1006 transitions. [2023-11-17 15:13:00,802 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 211 transitions, 2330 flow [2023-11-17 15:13:01,370 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 211 transitions, 2289 flow, removed 17 selfloop flow, removed 2 redundant places. [2023-11-17 15:13:01,373 INFO L231 Difference]: Finished difference. Result has 85 places, 87 transitions, 953 flow [2023-11-17 15:13:01,373 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=801, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=953, PETRI_PLACES=85, PETRI_TRANSITIONS=87} [2023-11-17 15:13:01,374 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 41 predicate places. [2023-11-17 15:13:01,374 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 87 transitions, 953 flow [2023-11-17 15:13:01,374 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 114.0) internal successors, (684), 6 states have internal predecessors, (684), 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,374 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:13:01,374 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] [2023-11-17 15:13:01,374 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-17 15:13:01,375 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 15:13:01,375 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:13:01,375 INFO L85 PathProgramCache]: Analyzing trace with hash 1493572509, now seen corresponding path program 1 times [2023-11-17 15:13:01,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:13:01,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383633610] [2023-11-17 15:13:01,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:13:01,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:13:01,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:13:01,640 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:01,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:13:01,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383633610] [2023-11-17 15:13:01,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383633610] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:13:01,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:13:01,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-17 15:13:01,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591033741] [2023-11-17 15:13:01,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:13:01,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-17 15:13:01,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:13:01,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-17 15:13:01,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-17 15:13:01,643 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 252 [2023-11-17 15:13:01,644 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 87 transitions, 953 flow. Second operand has 7 states, 7 states have (on average 114.0) internal successors, (798), 7 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:13:01,644 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:13:01,644 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 252 [2023-11-17 15:13:01,644 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:13:03,460 INFO L124 PetriNetUnfolderBase]: 9835/15602 cut-off events. [2023-11-17 15:13:03,460 INFO L125 PetriNetUnfolderBase]: For 59931/62107 co-relation queries the response was YES. [2023-11-17 15:13:03,540 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66455 conditions, 15602 events. 9835/15602 cut-off events. For 59931/62107 co-relation queries the response was YES. Maximal size of possible extension queue 860. Compared 113056 event pairs, 1168 based on Foata normal form. 859/16174 useless extension candidates. Maximal degree in co-relation 66414. Up to 3926 conditions per place. [2023-11-17 15:13:03,561 INFO L140 encePairwiseOnDemand]: 245/252 looper letters, 88 selfloop transitions, 26 changer transitions 75/212 dead transitions. [2023-11-17 15:13:03,562 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 212 transitions, 2389 flow [2023-11-17 15:13:03,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-17 15:13:03,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-17 15:13:03,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1229 transitions. [2023-11-17 15:13:03,565 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4876984126984127 [2023-11-17 15:13:03,565 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1229 transitions. [2023-11-17 15:13:03,565 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1229 transitions. [2023-11-17 15:13:03,566 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:13:03,566 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1229 transitions. [2023-11-17 15:13:03,568 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 122.9) internal successors, (1229), 10 states have internal predecessors, (1229), 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,571 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 252.0) internal successors, (2772), 11 states have internal predecessors, (2772), 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,572 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 252.0) internal successors, (2772), 11 states have internal predecessors, (2772), 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,572 INFO L175 Difference]: Start difference. First operand has 85 places, 87 transitions, 953 flow. Second operand 10 states and 1229 transitions. [2023-11-17 15:13:03,572 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 212 transitions, 2389 flow [2023-11-17 15:13:05,162 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 212 transitions, 2298 flow, removed 30 selfloop flow, removed 5 redundant places. [2023-11-17 15:13:05,165 INFO L231 Difference]: Finished difference. Result has 92 places, 75 transitions, 793 flow [2023-11-17 15:13:05,165 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=862, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=793, PETRI_PLACES=92, PETRI_TRANSITIONS=75} [2023-11-17 15:13:05,165 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 48 predicate places. [2023-11-17 15:13:05,165 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 75 transitions, 793 flow [2023-11-17 15:13:05,166 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 114.0) internal successors, (798), 7 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:13:05,166 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:13:05,166 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:05,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-17 15:13:05,166 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 15:13:05,167 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:13:05,167 INFO L85 PathProgramCache]: Analyzing trace with hash 972637956, now seen corresponding path program 1 times [2023-11-17 15:13:05,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:13:05,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929458307] [2023-11-17 15:13:05,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:13:05,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:13:05,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:13:07,014 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:07,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:13:07,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929458307] [2023-11-17 15:13:07,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929458307] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:13:07,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:13:07,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-17 15:13:07,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234269549] [2023-11-17 15:13:07,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:13:07,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-17 15:13:07,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:13:07,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-17 15:13:07,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-11-17 15:13:07,018 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 252 [2023-11-17 15:13:07,018 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 75 transitions, 793 flow. Second operand has 8 states, 8 states have (on average 110.0) internal successors, (880), 8 states have internal predecessors, (880), 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:07,019 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:13:07,019 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 252 [2023-11-17 15:13:07,019 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:13:07,761 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([413] L809-->L816: Formula: (let ((.cse2 (not (= 0 (mod v_~a$r_buff1_thd3~0_16 256)))) (.cse3 (not (= (mod v_~a$w_buff0_used~0_115 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd3~0_20 256) 0)))) (let ((.cse1 (and (not (= (mod v_~a$w_buff0_used~0_116 256) 0)) .cse5)) (.cse0 (and .cse3 .cse5)) (.cse4 (and .cse2 (not (= (mod v_~a$w_buff1_used~0_107 256) 0))))) (and (= v_~a$r_buff0_thd3~0_19 (ite .cse0 0 v_~a$r_buff0_thd3~0_20)) (= v_~a$w_buff0_used~0_115 (ite .cse1 0 v_~a$w_buff0_used~0_116)) (= (ite (or (and .cse2 (not (= (mod v_~a$w_buff1_used~0_106 256) 0))) (and (not (= (mod v_~a$r_buff0_thd3~0_19 256) 0)) .cse3)) 0 v_~a$r_buff1_thd3~0_16) v_~a$r_buff1_thd3~0_15) (= v_~a~0_54 (ite .cse1 v_~a$w_buff0~0_36 (ite .cse4 v_~a$w_buff1~0_33 v_~a~0_55))) (= (ite (or .cse0 .cse4) 0 v_~a$w_buff1_used~0_107) v_~a$w_buff1_used~0_106)))) InVars {~a~0=v_~a~0_55, ~a$w_buff1~0=v_~a$w_buff1~0_33, ~a$w_buff0~0=v_~a$w_buff0~0_36, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_16, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_116, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_20, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_107} OutVars{~a~0=v_~a~0_54, ~a$w_buff1~0=v_~a$w_buff1~0_33, ~a$w_buff0~0=v_~a$w_buff0~0_36, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_15, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_115, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_19, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_106} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ~a$r_buff0_thd3~0, ~a$w_buff1_used~0][67], [Black: 246#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 24#L829true, Black: 189#(<= ~__unbuffered_cnt~0 0), 32#L880true, 233#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 107#P0EXITtrue, Black: 200#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 199#(= ~x~0 1), P3Thread1of1ForFork2InUse, 81#L816true, 167#true, P1Thread1of1ForFork3InUse, P0Thread1of1ForFork1InUse, P2Thread1of1ForFork0InUse, Black: 208#(<= ~__unbuffered_cnt~0 1), Black: 209#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 155#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 261#(and (= ~a$w_buff1_used~0 0) (= ~a$r_buff1_thd2~0 0) (<= 0 ~a$r_buff1_thd3~0) (<= 0 (div ~a$r_buff0_thd4~0 256)) (<= 0 (div ~a$r_buff0_thd3~0 256)) (<= ~a$r_buff0_thd3~0 (* 256 (div ~a$r_buff0_thd3~0 256))) (<= ~a$r_buff0_thd4~0 (* 256 (div ~a$r_buff0_thd4~0 256))) (not (= ~a~0 0)) (= ~a$r_buff0_thd2~0 0) (<= ~a$r_buff1_thd3~0 (* 256 (div ~a$r_buff1_thd3~0 256)))), Black: 218#(= ~z~0 1), 248#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 161#(<= ~y~0 0), Black: 162#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 62#L786true, Black: 170#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 159#true, Black: 235#(and (<= ~__unbuffered_cnt~0 2) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 231#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 197#true, Black: 230#(<= ~__unbuffered_cnt~0 2), Black: 177#(= ~x~0 0), Black: 178#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 221#(and (= ~z~0 1) (= ~__unbuffered_p2_EBX~0 1)), 175#true, Black: 245#(<= ~__unbuffered_cnt~0 3), Black: 252#(and (<= ~__unbuffered_cnt~0 3) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0))]) [2023-11-17 15:13:07,761 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2023-11-17 15:13:07,761 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-17 15:13:07,762 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-17 15:13:07,762 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-17 15:13:07,762 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([420] L829-->L845: Formula: (let ((.cse3 (= (mod v_~a$r_buff1_thd4~0_56 256) 0)) (.cse7 (= (mod v_~a$r_buff0_thd4~0_60 256) 0))) (let ((.cse9 (not .cse7)) (.cse10 (and .cse7 (= (mod v_~a$w_buff1_used~0_135 256) 0))) (.cse8 (and .cse3 .cse7)) (.cse11 (= (mod v_~a$w_buff0_used~0_148 256) 0))) (let ((.cse5 (or .cse10 .cse8 .cse11)) (.cse6 (and (not .cse11) .cse9)) (.cse2 (= (mod v_~a$w_buff1_used~0_134 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse4 (= (mod v_~a$w_buff0_used~0_147 256) 0))) (and (= v_~a$flush_delayed~0_23 0) (= (ite .cse0 v_~a$r_buff1_thd4~0_56 (ite (let ((.cse1 (= (mod v_~a$r_buff0_thd4~0_59 256) 0))) (or (and .cse1 .cse2) (and .cse1 .cse3) .cse4)) v_~a$r_buff1_thd4~0_56 0)) v_~a$r_buff1_thd4~0_55) (= (ite .cse5 v_~a~0_81 (ite .cse6 v_~a$w_buff0~0_63 v_~a$w_buff1~0_56)) v_~__unbuffered_p3_EBX~0_10) (= (ite .cse0 v_~a$w_buff0_used~0_148 (ite .cse5 v_~a$w_buff0_used~0_148 (ite .cse6 0 v_~a$w_buff0_used~0_148))) v_~a$w_buff0_used~0_147) (= v_~a~0_80 (ite .cse0 v_~a$mem_tmp~0_14 v_~__unbuffered_p3_EBX~0_10)) (= v_~a$w_buff0~0_63 v_~a$w_buff0~0_62) (= v_~a~0_81 v_~a$mem_tmp~0_14) (= v_~a$w_buff1~0_55 v_~a$w_buff1~0_56) (= v_~a$r_buff0_thd4~0_59 (ite .cse0 v_~a$r_buff0_thd4~0_60 (ite (or (and .cse7 .cse2) .cse8 .cse4) v_~a$r_buff0_thd4~0_60 (ite (and (not .cse4) .cse9) 0 v_~a$r_buff0_thd4~0_60)))) (= (ite .cse0 v_~a$w_buff1_used~0_135 (ite (or .cse10 .cse8 .cse4) v_~a$w_buff1_used~0_135 0)) v_~a$w_buff1_used~0_134))))) InVars {~a~0=v_~a~0_81, ~a$w_buff1~0=v_~a$w_buff1~0_56, ~a$w_buff0~0=v_~a$w_buff0~0_63, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_56, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_148, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_135, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_60} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_55, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_147, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_59, P3Thread1of1ForFork2_#t~nondet4=|v_P3Thread1of1ForFork2_#t~nondet4_1|, ~a~0=v_~a~0_80, ~a$mem_tmp~0=v_~a$mem_tmp~0_14, ~weak$$choice0~0=v_~weak$$choice0~0_9, ~a$w_buff1~0=v_~a$w_buff1~0_55, ~a$flush_delayed~0=v_~a$flush_delayed~0_23, ~a$w_buff0~0=v_~a$w_buff0~0_62, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_134, ~weak$$choice2~0=v_~weak$$choice2~0_30, P3Thread1of1ForFork2_#t~nondet3=|v_P3Thread1of1ForFork2_#t~nondet3_1|} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~nondet4, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork2_#t~nondet3][75], [Black: 246#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 189#(<= ~__unbuffered_cnt~0 0), 32#L880true, 233#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 79#L845true, 107#P0EXITtrue, Black: 200#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 199#(= ~x~0 1), P3Thread1of1ForFork2InUse, 167#true, P1Thread1of1ForFork3InUse, P0Thread1of1ForFork1InUse, P2Thread1of1ForFork0InUse, Black: 208#(<= ~__unbuffered_cnt~0 1), Black: 209#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 155#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 75#L809true, Black: 218#(= ~z~0 1), 248#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 161#(<= ~y~0 0), Black: 162#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 62#L786true, 266#(and (= ~a$w_buff1_used~0 0) (= ~a$r_buff1_thd2~0 0) (<= 0 ~a$r_buff1_thd3~0) (<= 0 (div ~a$r_buff0_thd4~0 256)) (<= 0 (div ~a$r_buff0_thd3~0 256)) (not (= ~__unbuffered_p3_EBX~0 0)) (<= ~a$r_buff0_thd3~0 (* 256 (div ~a$r_buff0_thd3~0 256))) (<= ~a$r_buff0_thd4~0 (* 256 (div ~a$r_buff0_thd4~0 256))) (not (= ~a~0 0)) (= ~a$r_buff0_thd2~0 0) (<= ~a$r_buff1_thd3~0 (* 256 (div ~a$r_buff1_thd3~0 256)))), Black: 170#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 159#true, Black: 235#(and (<= ~__unbuffered_cnt~0 2) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 231#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 197#true, Black: 230#(<= ~__unbuffered_cnt~0 2), Black: 177#(= ~x~0 0), Black: 178#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 221#(and (= ~z~0 1) (= ~__unbuffered_p2_EBX~0 1)), 175#true, Black: 245#(<= ~__unbuffered_cnt~0 3), Black: 252#(and (<= ~__unbuffered_cnt~0 3) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0))]) [2023-11-17 15:13:07,762 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2023-11-17 15:13:07,762 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-17 15:13:07,762 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-17 15:13:07,762 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-17 15:13:08,186 INFO L124 PetriNetUnfolderBase]: 5525/9082 cut-off events. [2023-11-17 15:13:08,186 INFO L125 PetriNetUnfolderBase]: For 38367/38989 co-relation queries the response was YES. [2023-11-17 15:13:08,227 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39578 conditions, 9082 events. 5525/9082 cut-off events. For 38367/38989 co-relation queries the response was YES. Maximal size of possible extension queue 515. Compared 63788 event pairs, 634 based on Foata normal form. 206/9072 useless extension candidates. Maximal degree in co-relation 39535. Up to 4795 conditions per place. [2023-11-17 15:13:08,243 INFO L140 encePairwiseOnDemand]: 246/252 looper letters, 88 selfloop transitions, 4 changer transitions 54/162 dead transitions. [2023-11-17 15:13:08,243 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 162 transitions, 1755 flow [2023-11-17 15:13:08,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-17 15:13:08,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-17 15:13:08,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 816 transitions. [2023-11-17 15:13:08,245 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46258503401360546 [2023-11-17 15:13:08,245 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 816 transitions. [2023-11-17 15:13:08,246 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 816 transitions. [2023-11-17 15:13:08,246 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:13:08,246 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 816 transitions. [2023-11-17 15:13:08,248 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 116.57142857142857) internal successors, (816), 7 states have internal predecessors, (816), 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:08,250 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 252.0) internal successors, (2016), 8 states have internal predecessors, (2016), 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:08,251 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 252.0) internal successors, (2016), 8 states have internal predecessors, (2016), 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:08,251 INFO L175 Difference]: Start difference. First operand has 92 places, 75 transitions, 793 flow. Second operand 7 states and 816 transitions. [2023-11-17 15:13:08,251 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 162 transitions, 1755 flow [2023-11-17 15:13:08,705 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 162 transitions, 1402 flow, removed 47 selfloop flow, removed 16 redundant places. [2023-11-17 15:13:08,706 INFO L231 Difference]: Finished difference. Result has 83 places, 68 transitions, 542 flow [2023-11-17 15:13:08,707 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=610, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=542, PETRI_PLACES=83, PETRI_TRANSITIONS=68} [2023-11-17 15:13:08,707 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 39 predicate places. [2023-11-17 15:13:08,707 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 68 transitions, 542 flow [2023-11-17 15:13:08,708 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 110.0) internal successors, (880), 8 states have internal predecessors, (880), 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:08,708 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:13:08,708 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:08,708 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-17 15:13:08,708 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 15:13:08,709 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:13:08,709 INFO L85 PathProgramCache]: Analyzing trace with hash 635007594, now seen corresponding path program 2 times [2023-11-17 15:13:08,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:13:08,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215603681] [2023-11-17 15:13:08,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:13:08,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:13:08,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-17 15:13:08,758 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-17 15:13:08,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-17 15:13:08,844 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-17 15:13:08,845 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-17 15:13:08,845 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2023-11-17 15:13:08,847 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2023-11-17 15:13:08,848 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2023-11-17 15:13:08,848 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2023-11-17 15:13:08,851 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2023-11-17 15:13:08,851 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2023-11-17 15:13:08,851 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2023-11-17 15:13:08,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-17 15:13:08,852 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:13:08,859 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-17 15:13:08,859 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-17 15:13:08,917 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-17 15:13:08,920 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-17 15:13:08,923 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-17 15:13:08,928 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated [2023-11-17 15:13:08,955 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.11 03:13:08 BasicIcfg [2023-11-17 15:13:08,955 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-17 15:13:08,956 INFO L158 Benchmark]: Toolchain (without parser) took 43600.89ms. Allocated memory was 203.4MB in the beginning and 4.9GB in the end (delta: 4.7GB). Free memory was 153.1MB in the beginning and 3.7GB in the end (delta: -3.6GB). Peak memory consumption was 1.1GB. Max. memory is 8.0GB. [2023-11-17 15:13:08,956 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 168.8MB. Free memory is still 117.7MB. There was no memory consumed. Max. memory is 8.0GB. [2023-11-17 15:13:08,956 INFO L158 Benchmark]: CACSL2BoogieTranslator took 575.20ms. Allocated memory is still 203.4MB. Free memory was 153.1MB in the beginning and 129.0MB in the end (delta: 24.1MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. [2023-11-17 15:13:08,956 INFO L158 Benchmark]: Boogie Procedure Inliner took 85.00ms. Allocated memory is still 203.4MB. Free memory was 129.0MB in the beginning and 126.4MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-11-17 15:13:08,961 INFO L158 Benchmark]: Boogie Preprocessor took 60.36ms. Allocated memory is still 203.4MB. Free memory was 126.4MB in the beginning and 124.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-11-17 15:13:08,961 INFO L158 Benchmark]: RCFGBuilder took 744.27ms. Allocated memory is still 203.4MB. Free memory was 124.3MB in the beginning and 146.4MB in the end (delta: -22.1MB). Peak memory consumption was 21.4MB. Max. memory is 8.0GB. [2023-11-17 15:13:08,961 INFO L158 Benchmark]: TraceAbstraction took 42127.74ms. Allocated memory was 203.4MB in the beginning and 4.9GB in the end (delta: 4.7GB). Free memory was 145.9MB in the beginning and 3.7GB in the end (delta: -3.6GB). Peak memory consumption was 1.1GB. Max. memory is 8.0GB. [2023-11-17 15:13:08,963 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.19ms. Allocated memory is still 168.8MB. Free memory is still 117.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 575.20ms. Allocated memory is still 203.4MB. Free memory was 153.1MB in the beginning and 129.0MB in the end (delta: 24.1MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 85.00ms. Allocated memory is still 203.4MB. Free memory was 129.0MB in the beginning and 126.4MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 60.36ms. Allocated memory is still 203.4MB. Free memory was 126.4MB in the beginning and 124.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 744.27ms. Allocated memory is still 203.4MB. Free memory was 124.3MB in the beginning and 146.4MB in the end (delta: -22.1MB). Peak memory consumption was 21.4MB. Max. memory is 8.0GB. * TraceAbstraction took 42127.74ms. Allocated memory was 203.4MB in the beginning and 4.9GB in the end (delta: 4.7GB). Free memory was 145.9MB in the beginning and 3.7GB in the end (delta: -3.6GB). Peak memory consumption was 1.1GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre11 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: 4.6s, 142 PlacesBefore, 44 PlacesAfterwards, 132 TransitionsBefore, 32 TransitionsAfterwards, 3692 CoEnabledTransitionPairs, 6 FixpointIterations, 42 TrivialSequentialCompositions, 62 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 2 ChoiceCompositions, 116 TotalNumberOfCompositions, 9279 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4251, independent: 4043, independent conditional: 0, independent unconditional: 4043, dependent: 208, dependent conditional: 0, dependent unconditional: 208, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2457, independent: 2372, independent conditional: 0, independent unconditional: 2372, dependent: 85, dependent conditional: 0, dependent unconditional: 85, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2457, independent: 2354, independent conditional: 0, independent unconditional: 2354, dependent: 103, dependent conditional: 0, dependent unconditional: 103, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 103, independent: 18, independent conditional: 0, independent unconditional: 18, dependent: 85, dependent conditional: 0, dependent unconditional: 85, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 513, independent: 33, independent conditional: 0, independent unconditional: 33, dependent: 480, dependent conditional: 0, dependent unconditional: 480, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4251, independent: 1671, independent conditional: 0, independent unconditional: 1671, dependent: 123, dependent conditional: 0, dependent unconditional: 123, unknown: 2457, unknown conditional: 0, unknown unconditional: 2457] , Statistics on independence cache: Total cache size (in pairs): 285, Positive cache size: 243, Positive conditional cache size: 0, Positive unconditional cache size: 243, Negative cache size: 42, Negative conditional cache size: 0, Negative unconditional cache size: 42, 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 a$flush_delayed; [L722] 0 int a$mem_tmp; [L723] 0 _Bool a$r_buff0_thd0; [L724] 0 _Bool a$r_buff0_thd1; [L725] 0 _Bool a$r_buff0_thd2; [L726] 0 _Bool a$r_buff0_thd3; [L727] 0 _Bool a$r_buff0_thd4; [L728] 0 _Bool a$r_buff1_thd0; [L729] 0 _Bool a$r_buff1_thd1; [L730] 0 _Bool a$r_buff1_thd2; [L731] 0 _Bool a$r_buff1_thd3; [L732] 0 _Bool a$r_buff1_thd4; [L733] 0 _Bool a$read_delayed; [L734] 0 int *a$read_delayed_var; [L735] 0 int a$w_buff0; [L736] 0 _Bool a$w_buff0_used; [L737] 0 int a$w_buff1; [L738] 0 _Bool a$w_buff1_used; [L739] 0 _Bool main$tmp_guard0; [L740] 0 _Bool main$tmp_guard1; [L742] 0 int x = 0; [L744] 0 int y = 0; [L746] 0 int z = 0; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L869] 0 pthread_t t209; [L870] FCALL, FORK 0 pthread_create(&t209, ((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$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t209={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L871] 0 pthread_t t210; [L872] FCALL, FORK 0 pthread_create(&t210, ((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$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t209={5:0}, t210={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L873] 0 pthread_t t211; [L874] FCALL, FORK 0 pthread_create(&t211, ((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$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t209={5:0}, t210={6:0}, t211={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L875] 0 pthread_t t212; [L876] FCALL, FORK 0 pthread_create(&t212, ((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$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t209={5:0}, t210={6:0}, t211={7:0}, t212={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L752] 1 a$w_buff1 = a$w_buff0 [L753] 1 a$w_buff0 = 1 [L754] 1 a$w_buff1_used = a$w_buff0_used [L755] 1 a$w_buff0_used = (_Bool)1 [L756] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L756] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L757] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L758] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L759] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L760] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L761] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L762] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L765] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L782] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=2, y=0, z=0] [L785] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=2, y=1, z=0] [L788] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L789] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L790] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L791] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L792] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=2, y=1, z=0] [L802] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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$$choice0=0, weak$$choice2=0, x=2, y=2, z=0] [L805] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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$$choice0=0, weak$$choice2=0, x=2, y=2, z=0] [L808] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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$$choice0=0, weak$$choice2=0, x=2, y=2, z=0] [L825] 4 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, 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$$choice0=0, weak$$choice2=0, x=2, y=2, z=1] [L828] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, 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$$choice0=0, weak$$choice2=0, x=2, y=2, z=1] [L831] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L832] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L833] 4 a$flush_delayed = weak$$choice2 [L834] 4 a$mem_tmp = a [L835] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L836] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L837] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L838] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L839] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L840] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L841] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L842] 4 __unbuffered_p3_EBX = a [L843] 4 a = a$flush_delayed ? a$mem_tmp : a [L844] 4 a$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$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, 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=2, z=1] [L811] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L812] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L813] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L814] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L815] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, 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=2, z=1] [L847] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L848] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L849] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L850] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L851] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, 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=2, z=1] [L768] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L769] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L770] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L771] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L772] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, 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=2, z=1] [L775] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L777] 1 return 0; [L795] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L797] 2 return 0; [L818] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L820] 3 return 0; [L854] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L856] 4 return 0; [L878] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L880] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L880] RET 0 assume_abort_if_not(main$tmp_guard0) [L882] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L883] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L884] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L885] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L886] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [\result={0: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$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t209={5:0}, t210={6:0}, t211={7:0}, t212={3:0}, weak$$choice2=1, x=2, y=2, z=1] [L889] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L891] 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}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=2, y=2, 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: 876]: 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: 872]: 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: 870]: 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: 874]: 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, 173 locations, 7 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: 41.9s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 32.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 483 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 483 mSDsluCounter, 53 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 17 mSDsCounter, 51 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1411 IncrementalHoareTripleChecker+Invalid, 1462 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 51 mSolverCounterUnsat, 36 mSDtfsCounter, 1411 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 49 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=953occurred in iteration=11, InterpolantAutomatonStates: 65, 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.4s SatisfiabilityAnalysisTime, 3.9s InterpolantComputationTime, 248 NumberOfCodeBlocks, 248 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 206 ConstructedInterpolants, 0 QuantifiedInterpolants, 1669 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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:08,980 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...