/usr/bin/java -Xmx16000000000 -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-VariableLbe.epf --traceabstraction.order.of.the.error.locations.to.be.checked INSUFFICIENT_FIRST -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix042.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-24 05:29:58,109 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-24 05:29:58,178 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-VariableLbe.epf [2023-08-24 05:29:58,185 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-24 05:29:58,185 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-24 05:29:58,218 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-24 05:29:58,218 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-24 05:29:58,219 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-24 05:29:58,219 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-24 05:29:58,223 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-24 05:29:58,223 INFO L153 SettingsManager]: * Use SBE=true [2023-08-24 05:29:58,223 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-24 05:29:58,223 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-24 05:29:58,224 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-24 05:29:58,225 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-24 05:29:58,225 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-24 05:29:58,225 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-24 05:29:58,225 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-24 05:29:58,225 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-24 05:29:58,226 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-24 05:29:58,226 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-24 05:29:58,226 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-24 05:29:58,226 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-24 05:29:58,227 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-24 05:29:58,227 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-24 05:29:58,227 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-24 05:29:58,227 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-24 05:29:58,228 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-24 05:29:58,228 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-24 05:29:58,228 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-24 05:29:58,229 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-24 05:29:58,229 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-24 05:29:58,229 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-24 05:29:58,229 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-24 05:29:58,230 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-24 05:29:58,230 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Order of the error locations to be checked -> INSUFFICIENT_FIRST [2023-08-24 05:29:58,515 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-24 05:29:58,530 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-24 05:29:58,532 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-24 05:29:58,533 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-24 05:29:58,534 INFO L274 PluginConnector]: CDTParser initialized [2023-08-24 05:29:58,535 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix042.oepc.i [2023-08-24 05:29:59,674 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-24 05:29:59,975 INFO L384 CDTParser]: Found 1 translation units. [2023-08-24 05:29:59,975 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix042.oepc.i [2023-08-24 05:29:59,992 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2007c6260/9f2232483c814bb1a1286976b0bcb037/FLAGe09ddc203 [2023-08-24 05:30:00,007 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2007c6260/9f2232483c814bb1a1286976b0bcb037 [2023-08-24 05:30:00,011 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-24 05:30:00,013 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-24 05:30:00,015 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-24 05:30:00,015 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-24 05:30:00,018 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-24 05:30:00,018 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.08 05:30:00" (1/1) ... [2023-08-24 05:30:00,019 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f5803ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:30:00, skipping insertion in model container [2023-08-24 05:30:00,019 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.08 05:30:00" (1/1) ... [2023-08-24 05:30:00,059 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-24 05:30:00,199 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/mix042.oepc.i[945,958] [2023-08-24 05:30:00,419 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-24 05:30:00,432 INFO L201 MainTranslator]: Completed pre-run [2023-08-24 05:30:00,449 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/mix042.oepc.i[945,958] [2023-08-24 05:30:00,469 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-24 05:30:00,470 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-24 05:30:00,507 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-24 05:30:00,546 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-24 05:30:00,546 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-24 05:30:00,552 INFO L206 MainTranslator]: Completed translation [2023-08-24 05:30:00,553 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:30:00 WrapperNode [2023-08-24 05:30:00,553 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-24 05:30:00,554 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-24 05:30:00,554 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-24 05:30:00,554 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-24 05:30:00,560 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:30:00" (1/1) ... [2023-08-24 05:30:00,593 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:30:00" (1/1) ... [2023-08-24 05:30:00,619 INFO L138 Inliner]: procedures = 176, calls = 58, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 130 [2023-08-24 05:30:00,619 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-24 05:30:00,620 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-24 05:30:00,620 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-24 05:30:00,620 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-24 05:30:00,632 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:30:00" (1/1) ... [2023-08-24 05:30:00,632 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:30:00" (1/1) ... [2023-08-24 05:30:00,642 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:30:00" (1/1) ... [2023-08-24 05:30:00,643 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:30:00" (1/1) ... [2023-08-24 05:30:00,649 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:30:00" (1/1) ... [2023-08-24 05:30:00,650 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:30:00" (1/1) ... [2023-08-24 05:30:00,652 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:30:00" (1/1) ... [2023-08-24 05:30:00,654 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:30:00" (1/1) ... [2023-08-24 05:30:00,670 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-24 05:30:00,671 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-24 05:30:00,671 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-24 05:30:00,671 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-24 05:30:00,672 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:30:00" (1/1) ... [2023-08-24 05:30:00,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-24 05:30:00,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 05:30:00,719 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-08-24 05:30:00,737 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-08-24 05:30:00,753 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-24 05:30:00,753 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-24 05:30:00,754 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-24 05:30:00,754 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-24 05:30:00,754 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-24 05:30:00,754 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-24 05:30:00,754 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-24 05:30:00,754 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-24 05:30:00,754 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-24 05:30:00,755 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-24 05:30:00,755 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-24 05:30:00,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-24 05:30:00,756 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-24 05:30:00,756 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-24 05:30:00,756 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-24 05:30:00,757 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-24 05:30:00,907 INFO L236 CfgBuilder]: Building ICFG [2023-08-24 05:30:00,909 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-24 05:30:01,164 INFO L277 CfgBuilder]: Performing block encoding [2023-08-24 05:30:01,324 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-24 05:30:01,325 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-24 05:30:01,327 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.08 05:30:01 BoogieIcfgContainer [2023-08-24 05:30:01,327 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-24 05:30:01,329 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-24 05:30:01,329 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-24 05:30:01,332 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-24 05:30:01,333 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.08 05:30:00" (1/3) ... [2023-08-24 05:30:01,333 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65f71787 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.08 05:30:01, skipping insertion in model container [2023-08-24 05:30:01,333 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:30:00" (2/3) ... [2023-08-24 05:30:01,334 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65f71787 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.08 05:30:01, skipping insertion in model container [2023-08-24 05:30:01,334 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.08 05:30:01" (3/3) ... [2023-08-24 05:30:01,335 INFO L112 eAbstractionObserver]: Analyzing ICFG mix042.oepc.i [2023-08-24 05:30:01,350 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-24 05:30:01,351 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-24 05:30:01,351 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-24 05:30:01,420 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-24 05:30:01,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 120 places, 112 transitions, 239 flow [2023-08-24 05:30:01,530 INFO L124 PetriNetUnfolderBase]: 2/109 cut-off events. [2023-08-24 05:30:01,530 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 05:30:01,536 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119 conditions, 109 events. 2/109 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 60 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 71. Up to 2 conditions per place. [2023-08-24 05:30:01,536 INFO L82 GeneralOperation]: Start removeDead. Operand has 120 places, 112 transitions, 239 flow [2023-08-24 05:30:01,539 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 117 places, 109 transitions, 227 flow [2023-08-24 05:30:01,543 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-24 05:30:01,553 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 117 places, 109 transitions, 227 flow [2023-08-24 05:30:01,557 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 117 places, 109 transitions, 227 flow [2023-08-24 05:30:01,557 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 117 places, 109 transitions, 227 flow [2023-08-24 05:30:01,596 INFO L124 PetriNetUnfolderBase]: 2/109 cut-off events. [2023-08-24 05:30:01,596 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 05:30:01,596 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119 conditions, 109 events. 2/109 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 60 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 71. Up to 2 conditions per place. [2023-08-24 05:30:01,598 INFO L119 LiptonReduction]: Number of co-enabled transitions 2096 [2023-08-24 05:30:05,018 INFO L134 LiptonReduction]: Checked pairs total: 5396 [2023-08-24 05:30:05,018 INFO L136 LiptonReduction]: Total number of compositions: 97 [2023-08-24 05:30:05,030 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-24 05:30:05,035 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=LoopsAndPotentialCycles, 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;@62a5b44f, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-24 05:30:05,036 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-08-24 05:30:05,038 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-24 05:30:05,038 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-08-24 05:30:05,038 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 05:30:05,038 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:30:05,039 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-24 05:30:05,039 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-24 05:30:05,043 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:30:05,043 INFO L85 PathProgramCache]: Analyzing trace with hash 484427, now seen corresponding path program 1 times [2023-08-24 05:30:05,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:30:05,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987935890] [2023-08-24 05:30:05,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:30:05,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:30:05,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:30:05,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 05:30:05,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:30:05,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987935890] [2023-08-24 05:30:05,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987935890] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:30:05,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:30:05,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-24 05:30:05,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848499495] [2023-08-24 05:30:05,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:30:05,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-24 05:30:05,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:30:05,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-24 05:30:05,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-24 05:30:05,430 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 209 [2023-08-24 05:30:05,433 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 25 transitions, 59 flow. Second operand has 3 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:30:05,433 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:30:05,434 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 209 [2023-08-24 05:30:05,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:30:05,761 INFO L124 PetriNetUnfolderBase]: 1079/1667 cut-off events. [2023-08-24 05:30:05,761 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2023-08-24 05:30:05,769 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3314 conditions, 1667 events. 1079/1667 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 7952 event pairs, 301 based on Foata normal form. 0/1570 useless extension candidates. Maximal degree in co-relation 3303. Up to 1297 conditions per place. [2023-08-24 05:30:05,779 INFO L140 encePairwiseOnDemand]: 205/209 looper letters, 33 selfloop transitions, 2 changer transitions 2/39 dead transitions. [2023-08-24 05:30:05,779 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 39 transitions, 167 flow [2023-08-24 05:30:05,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-24 05:30:05,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-24 05:30:05,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 334 transitions. [2023-08-24 05:30:05,798 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.532695374800638 [2023-08-24 05:30:05,799 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 334 transitions. [2023-08-24 05:30:05,799 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 334 transitions. [2023-08-24 05:30:05,801 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:30:05,803 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 334 transitions. [2023-08-24 05:30:05,808 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 111.33333333333333) internal successors, (334), 3 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:30:05,811 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 209.0) internal successors, (836), 4 states have internal predecessors, (836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:30:05,812 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 209.0) internal successors, (836), 4 states have internal predecessors, (836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:30:05,813 INFO L175 Difference]: Start difference. First operand has 34 places, 25 transitions, 59 flow. Second operand 3 states and 334 transitions. [2023-08-24 05:30:05,814 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 39 transitions, 167 flow [2023-08-24 05:30:05,816 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 39 transitions, 162 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-24 05:30:05,818 INFO L231 Difference]: Finished difference. Result has 32 places, 22 transitions, 54 flow [2023-08-24 05:30:05,819 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=54, PETRI_PLACES=32, PETRI_TRANSITIONS=22} [2023-08-24 05:30:05,823 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, -2 predicate places. [2023-08-24 05:30:05,823 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 22 transitions, 54 flow [2023-08-24 05:30:05,824 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:30:05,824 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:30:05,824 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:30:05,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-24 05:30:05,824 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-24 05:30:05,826 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:30:05,826 INFO L85 PathProgramCache]: Analyzing trace with hash 353077464, now seen corresponding path program 1 times [2023-08-24 05:30:05,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:30:05,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18106767] [2023-08-24 05:30:05,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:30:05,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:30:05,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:30:06,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 05:30:06,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:30:06,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18106767] [2023-08-24 05:30:06,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18106767] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:30:06,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:30:06,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-24 05:30:06,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113454718] [2023-08-24 05:30:06,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:30:06,090 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-24 05:30:06,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:30:06,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-24 05:30:06,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-24 05:30:06,091 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 209 [2023-08-24 05:30:06,092 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 22 transitions, 54 flow. Second operand has 3 states, 3 states have (on average 93.0) internal successors, (279), 3 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:30:06,092 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:30:06,092 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 209 [2023-08-24 05:30:06,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:30:06,464 INFO L124 PetriNetUnfolderBase]: 1991/2996 cut-off events. [2023-08-24 05:30:06,465 INFO L125 PetriNetUnfolderBase]: For 186/186 co-relation queries the response was YES. [2023-08-24 05:30:06,470 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6263 conditions, 2996 events. 1991/2996 cut-off events. For 186/186 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 14230 event pairs, 629 based on Foata normal form. 94/3090 useless extension candidates. Maximal degree in co-relation 6253. Up to 2008 conditions per place. [2023-08-24 05:30:06,483 INFO L140 encePairwiseOnDemand]: 202/209 looper letters, 35 selfloop transitions, 6 changer transitions 0/41 dead transitions. [2023-08-24 05:30:06,484 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 41 transitions, 180 flow [2023-08-24 05:30:06,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-24 05:30:06,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-24 05:30:06,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 312 transitions. [2023-08-24 05:30:06,486 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49760765550239233 [2023-08-24 05:30:06,486 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 312 transitions. [2023-08-24 05:30:06,486 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 312 transitions. [2023-08-24 05:30:06,487 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:30:06,487 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 312 transitions. [2023-08-24 05:30:06,489 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:30:06,492 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 209.0) internal successors, (836), 4 states have internal predecessors, (836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:30:06,492 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 209.0) internal successors, (836), 4 states have internal predecessors, (836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:30:06,492 INFO L175 Difference]: Start difference. First operand has 32 places, 22 transitions, 54 flow. Second operand 3 states and 312 transitions. [2023-08-24 05:30:06,493 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 41 transitions, 180 flow [2023-08-24 05:30:06,493 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 41 transitions, 174 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-24 05:30:06,494 INFO L231 Difference]: Finished difference. Result has 33 places, 27 transitions, 96 flow [2023-08-24 05:30:06,495 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=96, PETRI_PLACES=33, PETRI_TRANSITIONS=27} [2023-08-24 05:30:06,496 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, -1 predicate places. [2023-08-24 05:30:06,497 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 27 transitions, 96 flow [2023-08-24 05:30:06,497 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 93.0) internal successors, (279), 3 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:30:06,497 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:30:06,497 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:30:06,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-24 05:30:06,498 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-24 05:30:06,498 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:30:06,498 INFO L85 PathProgramCache]: Analyzing trace with hash -1939501669, now seen corresponding path program 1 times [2023-08-24 05:30:06,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:30:06,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248996724] [2023-08-24 05:30:06,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:30:06,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:30:06,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:30:06,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 05:30:06,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:30:06,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248996724] [2023-08-24 05:30:06,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248996724] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:30:06,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:30:06,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-24 05:30:06,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202297479] [2023-08-24 05:30:06,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:30:06,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 05:30:06,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:30:06,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 05:30:06,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-24 05:30:06,669 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 209 [2023-08-24 05:30:06,669 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 27 transitions, 96 flow. Second operand has 4 states, 4 states have (on average 92.5) internal successors, (370), 4 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:30:06,670 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:30:06,670 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 209 [2023-08-24 05:30:06,670 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:30:07,033 INFO L124 PetriNetUnfolderBase]: 1855/2796 cut-off events. [2023-08-24 05:30:07,033 INFO L125 PetriNetUnfolderBase]: For 923/923 co-relation queries the response was YES. [2023-08-24 05:30:07,038 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6815 conditions, 2796 events. 1855/2796 cut-off events. For 923/923 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 12779 event pairs, 507 based on Foata normal form. 40/2836 useless extension candidates. Maximal degree in co-relation 6803. Up to 1389 conditions per place. [2023-08-24 05:30:07,052 INFO L140 encePairwiseOnDemand]: 203/209 looper letters, 41 selfloop transitions, 6 changer transitions 0/47 dead transitions. [2023-08-24 05:30:07,052 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 47 transitions, 240 flow [2023-08-24 05:30:07,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-24 05:30:07,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-24 05:30:07,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 404 transitions. [2023-08-24 05:30:07,054 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48325358851674644 [2023-08-24 05:30:07,054 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 404 transitions. [2023-08-24 05:30:07,054 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 404 transitions. [2023-08-24 05:30:07,054 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:30:07,055 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 404 transitions. [2023-08-24 05:30:07,056 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 101.0) internal successors, (404), 4 states have internal predecessors, (404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:30:07,057 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 209.0) internal successors, (1045), 5 states have internal predecessors, (1045), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:30:07,058 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 209.0) internal successors, (1045), 5 states have internal predecessors, (1045), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:30:07,058 INFO L175 Difference]: Start difference. First operand has 33 places, 27 transitions, 96 flow. Second operand 4 states and 404 transitions. [2023-08-24 05:30:07,058 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 47 transitions, 240 flow [2023-08-24 05:30:07,066 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 47 transitions, 224 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-24 05:30:07,067 INFO L231 Difference]: Finished difference. Result has 37 places, 29 transitions, 122 flow [2023-08-24 05:30:07,068 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=122, PETRI_PLACES=37, PETRI_TRANSITIONS=29} [2023-08-24 05:30:07,069 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 3 predicate places. [2023-08-24 05:30:07,071 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 29 transitions, 122 flow [2023-08-24 05:30:07,072 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 92.5) internal successors, (370), 4 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:30:07,072 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:30:07,073 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:30:07,073 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-24 05:30:07,073 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-24 05:30:07,073 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:30:07,073 INFO L85 PathProgramCache]: Analyzing trace with hash -34018649, now seen corresponding path program 1 times [2023-08-24 05:30:07,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:30:07,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155451178] [2023-08-24 05:30:07,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:30:07,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:30:07,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:30:07,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 05:30:07,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:30:07,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155451178] [2023-08-24 05:30:07,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155451178] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:30:07,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:30:07,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 05:30:07,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928720745] [2023-08-24 05:30:07,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:30:07,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 05:30:07,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:30:07,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 05:30:07,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-24 05:30:07,274 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 209 [2023-08-24 05:30:07,275 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 29 transitions, 122 flow. Second operand has 4 states, 4 states have (on average 92.75) internal successors, (371), 4 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:30:07,275 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:30:07,275 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 209 [2023-08-24 05:30:07,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:30:07,623 INFO L124 PetriNetUnfolderBase]: 1136/1898 cut-off events. [2023-08-24 05:30:07,624 INFO L125 PetriNetUnfolderBase]: For 1068/1082 co-relation queries the response was YES. [2023-08-24 05:30:07,627 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4662 conditions, 1898 events. 1136/1898 cut-off events. For 1068/1082 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 10207 event pairs, 190 based on Foata normal form. 199/2079 useless extension candidates. Maximal degree in co-relation 4647. Up to 1049 conditions per place. [2023-08-24 05:30:07,634 INFO L140 encePairwiseOnDemand]: 203/209 looper letters, 57 selfloop transitions, 7 changer transitions 6/76 dead transitions. [2023-08-24 05:30:07,634 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 76 transitions, 432 flow [2023-08-24 05:30:07,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 05:30:07,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 05:30:07,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 510 transitions. [2023-08-24 05:30:07,637 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4880382775119617 [2023-08-24 05:30:07,637 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 510 transitions. [2023-08-24 05:30:07,637 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 510 transitions. [2023-08-24 05:30:07,637 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:30:07,637 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 510 transitions. [2023-08-24 05:30:07,639 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 102.0) internal successors, (510), 5 states have internal predecessors, (510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:30:07,641 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 209.0) internal successors, (1254), 6 states have internal predecessors, (1254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:30:07,641 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 209.0) internal successors, (1254), 6 states have internal predecessors, (1254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:30:07,642 INFO L175 Difference]: Start difference. First operand has 37 places, 29 transitions, 122 flow. Second operand 5 states and 510 transitions. [2023-08-24 05:30:07,642 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 76 transitions, 432 flow [2023-08-24 05:30:07,644 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 76 transitions, 423 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-24 05:30:07,645 INFO L231 Difference]: Finished difference. Result has 43 places, 35 transitions, 173 flow [2023-08-24 05:30:07,645 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=119, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=173, PETRI_PLACES=43, PETRI_TRANSITIONS=35} [2023-08-24 05:30:07,646 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 9 predicate places. [2023-08-24 05:30:07,646 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 35 transitions, 173 flow [2023-08-24 05:30:07,647 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 92.75) internal successors, (371), 4 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:30:07,647 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:30:07,647 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:30:07,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-24 05:30:07,647 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-24 05:30:07,648 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:30:07,648 INFO L85 PathProgramCache]: Analyzing trace with hash -1069595672, now seen corresponding path program 1 times [2023-08-24 05:30:07,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:30:07,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145778179] [2023-08-24 05:30:07,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:30:07,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:30:07,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:30:07,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 05:30:07,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:30:07,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145778179] [2023-08-24 05:30:07,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145778179] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:30:07,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:30:07,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-24 05:30:07,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855841006] [2023-08-24 05:30:07,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:30:07,876 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 05:30:07,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:30:07,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 05:30:07,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-24 05:30:07,880 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 209 [2023-08-24 05:30:07,880 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 35 transitions, 173 flow. Second operand has 5 states, 5 states have (on average 92.8) internal successors, (464), 5 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:30:07,884 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:30:07,884 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 209 [2023-08-24 05:30:07,884 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:30:08,192 INFO L124 PetriNetUnfolderBase]: 838/1458 cut-off events. [2023-08-24 05:30:08,192 INFO L125 PetriNetUnfolderBase]: For 1204/1214 co-relation queries the response was YES. [2023-08-24 05:30:08,196 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4566 conditions, 1458 events. 838/1458 cut-off events. For 1204/1214 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 7879 event pairs, 122 based on Foata normal form. 107/1547 useless extension candidates. Maximal degree in co-relation 4547. Up to 469 conditions per place. [2023-08-24 05:30:08,201 INFO L140 encePairwiseOnDemand]: 203/209 looper letters, 69 selfloop transitions, 13 changer transitions 18/106 dead transitions. [2023-08-24 05:30:08,201 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 106 transitions, 669 flow [2023-08-24 05:30:08,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-24 05:30:08,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-24 05:30:08,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 714 transitions. [2023-08-24 05:30:08,204 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4880382775119617 [2023-08-24 05:30:08,204 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 714 transitions. [2023-08-24 05:30:08,204 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 714 transitions. [2023-08-24 05:30:08,205 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:30:08,205 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 714 transitions. [2023-08-24 05:30:08,207 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 102.0) internal successors, (714), 7 states have internal predecessors, (714), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:30:08,210 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 209.0) internal successors, (1672), 8 states have internal predecessors, (1672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:30:08,212 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 209.0) internal successors, (1672), 8 states have internal predecessors, (1672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:30:08,212 INFO L175 Difference]: Start difference. First operand has 43 places, 35 transitions, 173 flow. Second operand 7 states and 714 transitions. [2023-08-24 05:30:08,212 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 106 transitions, 669 flow [2023-08-24 05:30:08,219 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 106 transitions, 665 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-24 05:30:08,221 INFO L231 Difference]: Finished difference. Result has 51 places, 41 transitions, 257 flow [2023-08-24 05:30:08,221 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=169, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=257, PETRI_PLACES=51, PETRI_TRANSITIONS=41} [2023-08-24 05:30:08,223 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 17 predicate places. [2023-08-24 05:30:08,223 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 41 transitions, 257 flow [2023-08-24 05:30:08,223 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 92.8) internal successors, (464), 5 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:30:08,223 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:30:08,223 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:30:08,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-24 05:30:08,224 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-24 05:30:08,224 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:30:08,224 INFO L85 PathProgramCache]: Analyzing trace with hash -256643375, now seen corresponding path program 1 times [2023-08-24 05:30:08,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:30:08,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60093872] [2023-08-24 05:30:08,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:30:08,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:30:08,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:30:08,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 05:30:08,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:30:08,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60093872] [2023-08-24 05:30:08,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60093872] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:30:08,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:30:08,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-24 05:30:08,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427757315] [2023-08-24 05:30:08,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:30:08,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-24 05:30:08,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:30:08,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-24 05:30:08,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-24 05:30:08,716 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 209 [2023-08-24 05:30:08,717 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 41 transitions, 257 flow. Second operand has 6 states, 6 states have (on average 93.83333333333333) internal successors, (563), 6 states have internal predecessors, (563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:30:08,717 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:30:08,717 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 209 [2023-08-24 05:30:08,717 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:30:09,129 INFO L124 PetriNetUnfolderBase]: 1178/2137 cut-off events. [2023-08-24 05:30:09,129 INFO L125 PetriNetUnfolderBase]: For 4752/4761 co-relation queries the response was YES. [2023-08-24 05:30:09,136 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7887 conditions, 2137 events. 1178/2137 cut-off events. For 4752/4761 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 13057 event pairs, 201 based on Foata normal form. 13/2142 useless extension candidates. Maximal degree in co-relation 7864. Up to 915 conditions per place. [2023-08-24 05:30:09,143 INFO L140 encePairwiseOnDemand]: 202/209 looper letters, 72 selfloop transitions, 7 changer transitions 54/139 dead transitions. [2023-08-24 05:30:09,144 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 139 transitions, 1187 flow [2023-08-24 05:30:09,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-24 05:30:09,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-24 05:30:09,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 706 transitions. [2023-08-24 05:30:09,146 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4825700615174299 [2023-08-24 05:30:09,146 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 706 transitions. [2023-08-24 05:30:09,146 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 706 transitions. [2023-08-24 05:30:09,147 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:30:09,147 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 706 transitions. [2023-08-24 05:30:09,149 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 100.85714285714286) internal successors, (706), 7 states have internal predecessors, (706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:30:09,151 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 209.0) internal successors, (1672), 8 states have internal predecessors, (1672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:30:09,151 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 209.0) internal successors, (1672), 8 states have internal predecessors, (1672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:30:09,151 INFO L175 Difference]: Start difference. First operand has 51 places, 41 transitions, 257 flow. Second operand 7 states and 706 transitions. [2023-08-24 05:30:09,151 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 139 transitions, 1187 flow [2023-08-24 05:30:09,192 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 139 transitions, 1046 flow, removed 53 selfloop flow, removed 2 redundant places. [2023-08-24 05:30:09,194 INFO L231 Difference]: Finished difference. Result has 58 places, 44 transitions, 270 flow [2023-08-24 05:30:09,194 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=227, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=270, PETRI_PLACES=58, PETRI_TRANSITIONS=44} [2023-08-24 05:30:09,195 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 24 predicate places. [2023-08-24 05:30:09,195 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 44 transitions, 270 flow [2023-08-24 05:30:09,195 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 93.83333333333333) internal successors, (563), 6 states have internal predecessors, (563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:30:09,196 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:30:09,196 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:30:09,196 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-24 05:30:09,196 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-24 05:30:09,196 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:30:09,196 INFO L85 PathProgramCache]: Analyzing trace with hash 597055769, now seen corresponding path program 2 times [2023-08-24 05:30:09,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:30:09,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110859223] [2023-08-24 05:30:09,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:30:09,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:30:09,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:30:09,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 05:30:09,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:30:09,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110859223] [2023-08-24 05:30:09,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110859223] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:30:09,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:30:09,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-24 05:30:09,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211454553] [2023-08-24 05:30:09,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:30:09,409 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-24 05:30:09,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:30:09,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-24 05:30:09,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-24 05:30:09,410 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 209 [2023-08-24 05:30:09,411 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 44 transitions, 270 flow. Second operand has 6 states, 6 states have (on average 92.83333333333333) internal successors, (557), 6 states have internal predecessors, (557), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:30:09,411 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:30:09,411 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 209 [2023-08-24 05:30:09,411 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:30:09,746 INFO L124 PetriNetUnfolderBase]: 789/1428 cut-off events. [2023-08-24 05:30:09,746 INFO L125 PetriNetUnfolderBase]: For 2626/2639 co-relation queries the response was YES. [2023-08-24 05:30:09,750 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5245 conditions, 1428 events. 789/1428 cut-off events. For 2626/2639 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 8198 event pairs, 101 based on Foata normal form. 37/1447 useless extension candidates. Maximal degree in co-relation 5223. Up to 317 conditions per place. [2023-08-24 05:30:09,755 INFO L140 encePairwiseOnDemand]: 203/209 looper letters, 75 selfloop transitions, 15 changer transitions 23/119 dead transitions. [2023-08-24 05:30:09,755 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 119 transitions, 870 flow [2023-08-24 05:30:09,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-24 05:30:09,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-24 05:30:09,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 892 transitions. [2023-08-24 05:30:09,758 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47421584263689526 [2023-08-24 05:30:09,758 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 892 transitions. [2023-08-24 05:30:09,758 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 892 transitions. [2023-08-24 05:30:09,758 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:30:09,758 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 892 transitions. [2023-08-24 05:30:09,760 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 99.11111111111111) internal successors, (892), 9 states have internal predecessors, (892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:30:09,763 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 209.0) internal successors, (2090), 10 states have internal predecessors, (2090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:30:09,764 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 209.0) internal successors, (2090), 10 states have internal predecessors, (2090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:30:09,764 INFO L175 Difference]: Start difference. First operand has 58 places, 44 transitions, 270 flow. Second operand 9 states and 892 transitions. [2023-08-24 05:30:09,764 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 119 transitions, 870 flow [2023-08-24 05:30:09,775 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 119 transitions, 848 flow, removed 4 selfloop flow, removed 4 redundant places. [2023-08-24 05:30:09,777 INFO L231 Difference]: Finished difference. Result has 62 places, 44 transitions, 301 flow [2023-08-24 05:30:09,777 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=245, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=301, PETRI_PLACES=62, PETRI_TRANSITIONS=44} [2023-08-24 05:30:09,777 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 28 predicate places. [2023-08-24 05:30:09,777 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 44 transitions, 301 flow [2023-08-24 05:30:09,778 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 92.83333333333333) internal successors, (557), 6 states have internal predecessors, (557), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:30:09,778 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:30:09,778 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-08-24 05:30:09,778 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-24 05:30:09,778 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-24 05:30:09,779 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:30:09,779 INFO L85 PathProgramCache]: Analyzing trace with hash 92832006, now seen corresponding path program 1 times [2023-08-24 05:30:09,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:30:09,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682028565] [2023-08-24 05:30:09,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:30:09,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:30:09,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:30:09,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 05:30:09,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:30:09,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682028565] [2023-08-24 05:30:09,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682028565] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:30:09,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:30:09,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-24 05:30:09,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637738762] [2023-08-24 05:30:09,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:30:09,988 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 05:30:09,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:30:09,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 05:30:09,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-24 05:30:09,989 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 209 [2023-08-24 05:30:09,990 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 44 transitions, 301 flow. Second operand has 5 states, 5 states have (on average 92.4) internal successors, (462), 5 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:30:09,990 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:30:09,990 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 209 [2023-08-24 05:30:09,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:30:10,380 INFO L124 PetriNetUnfolderBase]: 1359/2353 cut-off events. [2023-08-24 05:30:10,381 INFO L125 PetriNetUnfolderBase]: For 5909/5909 co-relation queries the response was YES. [2023-08-24 05:30:10,389 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9584 conditions, 2353 events. 1359/2353 cut-off events. For 5909/5909 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 13293 event pairs, 216 based on Foata normal form. 1/2354 useless extension candidates. Maximal degree in co-relation 9556. Up to 1026 conditions per place. [2023-08-24 05:30:10,395 INFO L140 encePairwiseOnDemand]: 201/209 looper letters, 48 selfloop transitions, 9 changer transitions 69/126 dead transitions. [2023-08-24 05:30:10,395 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 126 transitions, 1109 flow [2023-08-24 05:30:10,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-24 05:30:10,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-24 05:30:10,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 602 transitions. [2023-08-24 05:30:10,398 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4800637958532695 [2023-08-24 05:30:10,398 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 602 transitions. [2023-08-24 05:30:10,398 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 602 transitions. [2023-08-24 05:30:10,398 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:30:10,398 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 602 transitions. [2023-08-24 05:30:10,400 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 100.33333333333333) internal successors, (602), 6 states have internal predecessors, (602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:30:10,402 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 209.0) internal successors, (1463), 7 states have internal predecessors, (1463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:30:10,402 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 209.0) internal successors, (1463), 7 states have internal predecessors, (1463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:30:10,402 INFO L175 Difference]: Start difference. First operand has 62 places, 44 transitions, 301 flow. Second operand 6 states and 602 transitions. [2023-08-24 05:30:10,402 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 126 transitions, 1109 flow [2023-08-24 05:30:10,433 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 126 transitions, 934 flow, removed 46 selfloop flow, removed 7 redundant places. [2023-08-24 05:30:10,435 INFO L231 Difference]: Finished difference. Result has 61 places, 36 transitions, 216 flow [2023-08-24 05:30:10,435 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=244, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=216, PETRI_PLACES=61, PETRI_TRANSITIONS=36} [2023-08-24 05:30:10,436 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 27 predicate places. [2023-08-24 05:30:10,436 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 36 transitions, 216 flow [2023-08-24 05:30:10,436 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 92.4) internal successors, (462), 5 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:30:10,436 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:30:10,437 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-08-24 05:30:10,437 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-24 05:30:10,437 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-24 05:30:10,437 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:30:10,437 INFO L85 PathProgramCache]: Analyzing trace with hash -1407004122, now seen corresponding path program 2 times [2023-08-24 05:30:10,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:30:10,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626277524] [2023-08-24 05:30:10,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:30:10,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:30:10,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:30:11,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 05:30:11,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:30:11,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626277524] [2023-08-24 05:30:11,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626277524] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:30:11,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:30:11,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-24 05:30:11,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872585345] [2023-08-24 05:30:11,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:30:11,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-24 05:30:11,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:30:11,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-24 05:30:11,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-08-24 05:30:11,432 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 209 [2023-08-24 05:30:11,433 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 36 transitions, 216 flow. Second operand has 7 states, 7 states have (on average 90.85714285714286) internal successors, (636), 7 states have internal predecessors, (636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:30:11,433 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:30:11,433 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 209 [2023-08-24 05:30:11,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:30:11,668 INFO L124 PetriNetUnfolderBase]: 236/473 cut-off events. [2023-08-24 05:30:11,668 INFO L125 PetriNetUnfolderBase]: For 942/957 co-relation queries the response was YES. [2023-08-24 05:30:11,670 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1785 conditions, 473 events. 236/473 cut-off events. For 942/957 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 2098 event pairs, 46 based on Foata normal form. 14/487 useless extension candidates. Maximal degree in co-relation 1765. Up to 242 conditions per place. [2023-08-24 05:30:11,671 INFO L140 encePairwiseOnDemand]: 203/209 looper letters, 38 selfloop transitions, 5 changer transitions 29/76 dead transitions. [2023-08-24 05:30:11,671 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 76 transitions, 581 flow [2023-08-24 05:30:11,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-24 05:30:11,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-24 05:30:11,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 665 transitions. [2023-08-24 05:30:11,674 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45454545454545453 [2023-08-24 05:30:11,674 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 665 transitions. [2023-08-24 05:30:11,674 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 665 transitions. [2023-08-24 05:30:11,674 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:30:11,674 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 665 transitions. [2023-08-24 05:30:11,676 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 95.0) internal successors, (665), 7 states have internal predecessors, (665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:30:11,678 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 209.0) internal successors, (1672), 8 states have internal predecessors, (1672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:30:11,678 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 209.0) internal successors, (1672), 8 states have internal predecessors, (1672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:30:11,679 INFO L175 Difference]: Start difference. First operand has 61 places, 36 transitions, 216 flow. Second operand 7 states and 665 transitions. [2023-08-24 05:30:11,679 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 76 transitions, 581 flow [2023-08-24 05:30:11,682 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 76 transitions, 526 flow, removed 10 selfloop flow, removed 8 redundant places. [2023-08-24 05:30:11,683 INFO L231 Difference]: Finished difference. Result has 55 places, 36 transitions, 203 flow [2023-08-24 05:30:11,683 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=203, PETRI_PLACES=55, PETRI_TRANSITIONS=36} [2023-08-24 05:30:11,684 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 21 predicate places. [2023-08-24 05:30:11,684 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 36 transitions, 203 flow [2023-08-24 05:30:11,684 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 90.85714285714286) internal successors, (636), 7 states have internal predecessors, (636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:30:11,684 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:30:11,685 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-08-24 05:30:11,685 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-24 05:30:11,685 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-24 05:30:11,685 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:30:11,685 INFO L85 PathProgramCache]: Analyzing trace with hash -460839926, now seen corresponding path program 3 times [2023-08-24 05:30:11,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:30:11,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770065748] [2023-08-24 05:30:11,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:30:11,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:30:11,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:30:11,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 05:30:11,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:30:11,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770065748] [2023-08-24 05:30:11,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770065748] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:30:11,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:30:11,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 05:30:11,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794723035] [2023-08-24 05:30:11,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:30:11,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 05:30:11,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:30:11,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 05:30:11,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-24 05:30:11,894 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 209 [2023-08-24 05:30:11,894 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 36 transitions, 203 flow. Second operand has 4 states, 4 states have (on average 95.5) internal successors, (382), 4 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:30:11,894 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:30:11,895 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 209 [2023-08-24 05:30:11,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:30:12,038 INFO L124 PetriNetUnfolderBase]: 294/575 cut-off events. [2023-08-24 05:30:12,039 INFO L125 PetriNetUnfolderBase]: For 1231/1231 co-relation queries the response was YES. [2023-08-24 05:30:12,041 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2152 conditions, 575 events. 294/575 cut-off events. For 1231/1231 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2534 event pairs, 93 based on Foata normal form. 1/576 useless extension candidates. Maximal degree in co-relation 2134. Up to 306 conditions per place. [2023-08-24 05:30:12,042 INFO L140 encePairwiseOnDemand]: 204/209 looper letters, 34 selfloop transitions, 4 changer transitions 23/61 dead transitions. [2023-08-24 05:30:12,042 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 61 transitions, 450 flow [2023-08-24 05:30:12,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-24 05:30:12,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-24 05:30:12,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 404 transitions. [2023-08-24 05:30:12,044 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48325358851674644 [2023-08-24 05:30:12,044 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 404 transitions. [2023-08-24 05:30:12,044 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 404 transitions. [2023-08-24 05:30:12,045 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:30:12,045 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 404 transitions. [2023-08-24 05:30:12,046 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 101.0) internal successors, (404), 4 states have internal predecessors, (404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:30:12,047 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 209.0) internal successors, (1045), 5 states have internal predecessors, (1045), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:30:12,048 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 209.0) internal successors, (1045), 5 states have internal predecessors, (1045), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:30:12,048 INFO L175 Difference]: Start difference. First operand has 55 places, 36 transitions, 203 flow. Second operand 4 states and 404 transitions. [2023-08-24 05:30:12,048 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 61 transitions, 450 flow [2023-08-24 05:30:12,051 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 61 transitions, 418 flow, removed 4 selfloop flow, removed 6 redundant places. [2023-08-24 05:30:12,052 INFO L231 Difference]: Finished difference. Result has 51 places, 30 transitions, 157 flow [2023-08-24 05:30:12,053 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=185, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=157, PETRI_PLACES=51, PETRI_TRANSITIONS=30} [2023-08-24 05:30:12,053 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 17 predicate places. [2023-08-24 05:30:12,053 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 30 transitions, 157 flow [2023-08-24 05:30:12,054 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 95.5) internal successors, (382), 4 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:30:12,054 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:30:12,054 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-08-24 05:30:12,054 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-24 05:30:12,054 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-24 05:30:12,054 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:30:12,054 INFO L85 PathProgramCache]: Analyzing trace with hash -1918534348, now seen corresponding path program 4 times [2023-08-24 05:30:12,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:30:12,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905820089] [2023-08-24 05:30:12,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:30:12,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:30:12,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-24 05:30:12,097 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-24 05:30:12,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-24 05:30:12,155 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-24 05:30:12,155 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-24 05:30:12,156 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2023-08-24 05:30:12,158 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-08-24 05:30:12,158 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2023-08-24 05:30:12,158 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2023-08-24 05:30:12,158 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2023-08-24 05:30:12,158 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-08-24 05:30:12,159 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-24 05:30:12,159 INFO L445 BasicCegarLoop]: Path program histogram: [4, 2, 1, 1, 1, 1, 1] [2023-08-24 05:30:12,164 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-24 05:30:12,164 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-24 05:30:12,218 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.08 05:30:12 BasicIcfg [2023-08-24 05:30:12,218 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-24 05:30:12,219 INFO L158 Benchmark]: Toolchain (without parser) took 12206.00ms. Allocated memory was 400.6MB in the beginning and 696.3MB in the end (delta: 295.7MB). Free memory was 375.6MB in the beginning and 517.8MB in the end (delta: -142.2MB). Peak memory consumption was 155.2MB. Max. memory is 16.0GB. [2023-08-24 05:30:12,219 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 400.6MB. Free memory is still 377.1MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-24 05:30:12,219 INFO L158 Benchmark]: CACSL2BoogieTranslator took 537.98ms. Allocated memory is still 400.6MB. Free memory was 375.6MB in the beginning and 352.1MB in the end (delta: 23.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-24 05:30:12,219 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.42ms. Allocated memory is still 400.6MB. Free memory was 352.1MB in the beginning and 349.7MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-24 05:30:12,219 INFO L158 Benchmark]: Boogie Preprocessor took 50.11ms. Allocated memory is still 400.6MB. Free memory was 349.4MB in the beginning and 347.6MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-24 05:30:12,220 INFO L158 Benchmark]: RCFGBuilder took 656.94ms. Allocated memory is still 400.6MB. Free memory was 347.3MB in the beginning and 364.9MB in the end (delta: -17.6MB). Peak memory consumption was 31.5MB. Max. memory is 16.0GB. [2023-08-24 05:30:12,220 INFO L158 Benchmark]: TraceAbstraction took 10888.87ms. Allocated memory was 400.6MB in the beginning and 696.3MB in the end (delta: 295.7MB). Free memory was 364.0MB in the beginning and 517.8MB in the end (delta: -153.8MB). Peak memory consumption was 142.6MB. Max. memory is 16.0GB. [2023-08-24 05:30:12,221 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 400.6MB. Free memory is still 377.1MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 537.98ms. Allocated memory is still 400.6MB. Free memory was 375.6MB in the beginning and 352.1MB in the end (delta: 23.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 65.42ms. Allocated memory is still 400.6MB. Free memory was 352.1MB in the beginning and 349.7MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 50.11ms. Allocated memory is still 400.6MB. Free memory was 349.4MB in the beginning and 347.6MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 656.94ms. Allocated memory is still 400.6MB. Free memory was 347.3MB in the beginning and 364.9MB in the end (delta: -17.6MB). Peak memory consumption was 31.5MB. Max. memory is 16.0GB. * TraceAbstraction took 10888.87ms. Allocated memory was 400.6MB in the beginning and 696.3MB in the end (delta: 295.7MB). Free memory was 364.0MB in the beginning and 517.8MB in the end (delta: -153.8MB). Peak memory consumption was 142.6MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.5s, 117 PlacesBefore, 34 PlacesAfterwards, 109 TransitionsBefore, 25 TransitionsAfterwards, 2096 CoEnabledTransitionPairs, 6 FixpointIterations, 40 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 1 ChoiceCompositions, 97 TotalNumberOfCompositions, 5396 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2385, independent: 2212, independent conditional: 0, independent unconditional: 2212, dependent: 173, dependent conditional: 0, dependent unconditional: 173, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1138, independent: 1097, independent conditional: 0, independent unconditional: 1097, dependent: 41, dependent conditional: 0, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2385, independent: 1115, independent conditional: 0, independent unconditional: 1115, dependent: 132, dependent conditional: 0, dependent unconditional: 132, unknown: 1138, unknown conditional: 0, unknown unconditional: 1138] , Statistics on independence cache: Total cache size (in pairs): 93, Positive cache size: 77, Positive conditional cache size: 0, Positive unconditional cache size: 77, Negative cache size: 16, Negative conditional cache size: 0, Negative unconditional cache size: 16, 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: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p2_EAX = 0; [L715] 0 int __unbuffered_p2_EBX = 0; [L717] 0 int a = 0; [L718] 0 _Bool a$flush_delayed; [L719] 0 int a$mem_tmp; [L720] 0 _Bool a$r_buff0_thd0; [L721] 0 _Bool a$r_buff0_thd1; [L722] 0 _Bool a$r_buff0_thd2; [L723] 0 _Bool a$r_buff0_thd3; [L724] 0 _Bool a$r_buff1_thd0; [L725] 0 _Bool a$r_buff1_thd1; [L726] 0 _Bool a$r_buff1_thd2; [L727] 0 _Bool a$r_buff1_thd3; [L728] 0 _Bool a$read_delayed; [L729] 0 int *a$read_delayed_var; [L730] 0 int a$w_buff0; [L731] 0 _Bool a$w_buff0_used; [L732] 0 int a$w_buff1; [L733] 0 _Bool a$w_buff1_used; [L734] 0 _Bool main$tmp_guard0; [L735] 0 _Bool main$tmp_guard1; [L737] 0 int x = 0; [L739] 0 int y = 0; [L741] 0 int z = 0; [L742] 0 _Bool weak$$choice0; [L743] 0 _Bool weak$$choice2; [L843] 0 pthread_t t1105; [L844] FCALL, FORK 0 pthread_create(&t1105, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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, pthread_create(&t1105, ((void *)0), P0, ((void *)0))=-2, t1105={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L747] 1 a$w_buff1 = a$w_buff0 [L748] 1 a$w_buff0 = 1 [L749] 1 a$w_buff1_used = a$w_buff0_used [L750] 1 a$w_buff0_used = (_Bool)1 [L751] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L751] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L752] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L753] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L754] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L755] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L756] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L845] 0 pthread_t t1106; [L846] FCALL, FORK 0 pthread_create(&t1106, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1106, ((void *)0), P1, ((void *)0))=-1, t1105={5:0}, t1106={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L847] 0 pthread_t t1107; [L848] FCALL, FORK 0 pthread_create(&t1107, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1107, ((void *)0), P2, ((void *)0))=0, t1105={5:0}, t1106={6:0}, t1107={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L759] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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=0, y=0, z=0] [L776] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L779] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L796] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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=1, y=2, z=0] [L799] 3 z = 1 [L802] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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=1, y=2, z=1] [L805] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L806] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L807] 3 a$flush_delayed = weak$$choice2 [L808] 3 a$mem_tmp = a [L809] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L810] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L811] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L812] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L813] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L814] 3 a$r_buff0_thd3 = weak$$choice2 ? a$r_buff0_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff0_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3)) [L815] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L816] 3 __unbuffered_p2_EBX = a [L817] 3 a = a$flush_delayed ? a$mem_tmp : a [L818] 3 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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$$choice2=1, x=1, y=2, z=1] [L762] 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) [L763] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L764] 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 [L765] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L766] 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_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=2, z=1] [L769] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L771] 1 return 0; [L821] 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) [L822] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L823] 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 [L824] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L825] 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=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=2, z=1] [L782] 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) [L783] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L784] 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 [L785] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L786] 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=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=2, z=1] [L789] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L791] 2 return 0; [L828] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L830] 3 return 0; [L850] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L852] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L852] RET 0 assume_abort_if_not(main$tmp_guard0) [L854] 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) [L855] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L856] 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 [L857] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L858] 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}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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}, main$tmp_guard0=1, main$tmp_guard1=0, t1105={5:0}, t1106={6:0}, t1107={3:0}, weak$$choice2=1, x=1, y=2, z=1] [L861] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L863] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=1, y=2, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 844]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 846]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 848]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 141 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 10.7s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 3.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 332 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 332 mSDsluCounter, 12 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3 mSDsCounter, 34 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 999 IncrementalHoareTripleChecker+Invalid, 1033 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 34 mSolverCounterUnsat, 9 mSDtfsCounter, 999 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 43 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=301occurred in iteration=7, InterpolantAutomatonStates: 55, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 171 NumberOfCodeBlocks, 171 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 139 ConstructedInterpolants, 0 QuantifiedInterpolants, 1300 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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-08-24 05:30:12,245 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...