/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 -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe020_rmo.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-23 23:10:30,045 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-23 23:10:30,095 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-23 23:10:30,099 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-23 23:10:30,099 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-23 23:10:30,138 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-23 23:10:30,139 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-23 23:10:30,140 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-23 23:10:30,140 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-23 23:10:30,144 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-23 23:10:30,144 INFO L153 SettingsManager]: * Use SBE=true [2023-08-23 23:10:30,145 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-23 23:10:30,145 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-23 23:10:30,146 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-23 23:10:30,146 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-23 23:10:30,146 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-23 23:10:30,147 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-23 23:10:30,147 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-23 23:10:30,147 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-23 23:10:30,147 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-23 23:10:30,147 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-23 23:10:30,148 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-23 23:10:30,149 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-23 23:10:30,149 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-23 23:10:30,149 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-23 23:10:30,149 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-23 23:10:30,150 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-23 23:10:30,150 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-23 23:10:30,150 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-23 23:10:30,150 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-23 23:10:30,151 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-23 23:10:30,151 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-23 23:10:30,151 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-23 23:10:30,152 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-23 23:10:30,152 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-23 23:10:30,152 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 [2023-08-23 23:10:30,495 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-23 23:10:30,519 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-23 23:10:30,521 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-23 23:10:30,522 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-23 23:10:30,522 INFO L274 PluginConnector]: CDTParser initialized [2023-08-23 23:10:30,524 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe020_rmo.i [2023-08-23 23:10:31,692 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-23 23:10:31,959 INFO L384 CDTParser]: Found 1 translation units. [2023-08-23 23:10:31,960 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe020_rmo.i [2023-08-23 23:10:31,977 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fbf0e4a12/d60563ae4b4e4a92b2c5515df4c34c6d/FLAG935683e25 [2023-08-23 23:10:31,989 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fbf0e4a12/d60563ae4b4e4a92b2c5515df4c34c6d [2023-08-23 23:10:31,991 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-23 23:10:31,993 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-23 23:10:31,994 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-23 23:10:31,994 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-23 23:10:31,996 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-23 23:10:31,997 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.08 11:10:31" (1/1) ... [2023-08-23 23:10:31,997 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62b1e2c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 11:10:31, skipping insertion in model container [2023-08-23 23:10:31,998 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.08 11:10:31" (1/1) ... [2023-08-23 23:10:32,040 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-23 23:10:32,165 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/safe020_rmo.i[988,1001] [2023-08-23 23:10:32,306 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-23 23:10:32,316 INFO L201 MainTranslator]: Completed pre-run [2023-08-23 23:10:32,328 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/safe020_rmo.i[988,1001] [2023-08-23 23:10:32,343 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [268] [2023-08-23 23:10:32,358 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [268] [2023-08-23 23:10:32,409 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-23 23:10:32,448 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-23 23:10:32,448 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-23 23:10:32,454 INFO L206 MainTranslator]: Completed translation [2023-08-23 23:10:32,455 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 11:10:32 WrapperNode [2023-08-23 23:10:32,455 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-23 23:10:32,456 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-23 23:10:32,457 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-23 23:10:32,457 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-23 23:10:32,463 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 11:10:32" (1/1) ... [2023-08-23 23:10:32,506 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 11:10:32" (1/1) ... [2023-08-23 23:10:32,534 INFO L138 Inliner]: procedures = 176, calls = 75, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 136 [2023-08-23 23:10:32,534 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-23 23:10:32,535 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-23 23:10:32,535 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-23 23:10:32,535 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-23 23:10:32,543 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 11:10:32" (1/1) ... [2023-08-23 23:10:32,544 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 11:10:32" (1/1) ... [2023-08-23 23:10:32,560 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 11:10:32" (1/1) ... [2023-08-23 23:10:32,560 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 11:10:32" (1/1) ... [2023-08-23 23:10:32,568 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 11:10:32" (1/1) ... [2023-08-23 23:10:32,577 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 11:10:32" (1/1) ... [2023-08-23 23:10:32,587 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 11:10:32" (1/1) ... [2023-08-23 23:10:32,589 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 11:10:32" (1/1) ... [2023-08-23 23:10:32,593 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-23 23:10:32,594 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-23 23:10:32,594 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-23 23:10:32,594 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-23 23:10:32,594 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 11:10:32" (1/1) ... [2023-08-23 23:10:32,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-23 23:10:32,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-23 23:10:32,624 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-23 23:10:32,629 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-23 23:10:32,656 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-23 23:10:32,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-23 23:10:32,656 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-23 23:10:32,656 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-23 23:10:32,657 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-23 23:10:32,657 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-23 23:10:32,657 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-23 23:10:32,657 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-23 23:10:32,657 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-23 23:10:32,657 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-23 23:10:32,657 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-23 23:10:32,657 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-23 23:10:32,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-23 23:10:32,657 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-23 23:10:32,657 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-23 23:10:32,658 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-23 23:10:32,659 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-23 23:10:32,806 INFO L236 CfgBuilder]: Building ICFG [2023-08-23 23:10:32,808 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-23 23:10:33,208 INFO L277 CfgBuilder]: Performing block encoding [2023-08-23 23:10:33,383 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-23 23:10:33,383 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-23 23:10:33,385 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.08 11:10:33 BoogieIcfgContainer [2023-08-23 23:10:33,385 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-23 23:10:33,387 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-23 23:10:33,387 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-23 23:10:33,389 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-23 23:10:33,390 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.08 11:10:31" (1/3) ... [2023-08-23 23:10:33,390 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@659a1a3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.08 11:10:33, skipping insertion in model container [2023-08-23 23:10:33,390 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 11:10:32" (2/3) ... [2023-08-23 23:10:33,391 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@659a1a3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.08 11:10:33, skipping insertion in model container [2023-08-23 23:10:33,391 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.08 11:10:33" (3/3) ... [2023-08-23 23:10:33,392 INFO L112 eAbstractionObserver]: Analyzing ICFG safe020_rmo.i [2023-08-23 23:10:33,408 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-23 23:10:33,408 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-08-23 23:10:33,408 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-23 23:10:33,465 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-23 23:10:33,494 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 131 places, 123 transitions, 261 flow [2023-08-23 23:10:33,538 INFO L124 PetriNetUnfolderBase]: 2/120 cut-off events. [2023-08-23 23:10:33,538 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-23 23:10:33,542 INFO L83 FinitePrefix]: Finished finitePrefix Result has 130 conditions, 120 events. 2/120 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 48 event pairs, 0 based on Foata normal form. 0/117 useless extension candidates. Maximal degree in co-relation 66. Up to 2 conditions per place. [2023-08-23 23:10:33,542 INFO L82 GeneralOperation]: Start removeDead. Operand has 131 places, 123 transitions, 261 flow [2023-08-23 23:10:33,549 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 117 places, 108 transitions, 225 flow [2023-08-23 23:10:33,554 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-23 23:10:33,566 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 117 places, 108 transitions, 225 flow [2023-08-23 23:10:33,569 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 117 places, 108 transitions, 225 flow [2023-08-23 23:10:33,569 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 117 places, 108 transitions, 225 flow [2023-08-23 23:10:33,593 INFO L124 PetriNetUnfolderBase]: 1/108 cut-off events. [2023-08-23 23:10:33,593 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-23 23:10:33,594 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118 conditions, 108 events. 1/108 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 39 event pairs, 0 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 54. Up to 2 conditions per place. [2023-08-23 23:10:33,595 INFO L119 LiptonReduction]: Number of co-enabled transitions 1138 [2023-08-23 23:10:38,842 INFO L134 LiptonReduction]: Checked pairs total: 3288 [2023-08-23 23:10:38,842 INFO L136 LiptonReduction]: Total number of compositions: 91 [2023-08-23 23:10:38,867 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-23 23:10:38,874 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;@2a9e84c6, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-23 23:10:38,874 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-08-23 23:10:38,884 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-23 23:10:38,884 INFO L124 PetriNetUnfolderBase]: 1/21 cut-off events. [2023-08-23 23:10:38,884 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-23 23:10:38,885 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:10:38,885 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 23:10:38,886 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-23 23:10:38,890 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:10:38,891 INFO L85 PathProgramCache]: Analyzing trace with hash 766666763, now seen corresponding path program 1 times [2023-08-23 23:10:38,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:10:38,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566493389] [2023-08-23 23:10:38,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:10:38,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:10:39,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 23:10:39,138 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-23 23:10:39,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 23:10:39,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566493389] [2023-08-23 23:10:39,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566493389] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 23:10:39,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 23:10:39,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-23 23:10:39,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606916451] [2023-08-23 23:10:39,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 23:10:39,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-23 23:10:39,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 23:10:39,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-23 23:10:39,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-23 23:10:39,170 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 214 [2023-08-23 23:10:39,172 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 22 transitions, 53 flow. Second operand has 2 states, 2 states have (on average 116.0) internal successors, (232), 2 states have internal predecessors, (232), 0 states have call successors, (0), 0 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-23 23:10:39,172 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 23:10:39,173 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 214 [2023-08-23 23:10:39,173 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 23:10:39,473 INFO L124 PetriNetUnfolderBase]: 855/1292 cut-off events. [2023-08-23 23:10:39,474 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2023-08-23 23:10:39,480 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2619 conditions, 1292 events. 855/1292 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 5364 event pairs, 855 based on Foata normal form. 64/1264 useless extension candidates. Maximal degree in co-relation 2608. Up to 1281 conditions per place. [2023-08-23 23:10:39,490 INFO L140 encePairwiseOnDemand]: 213/214 looper letters, 19 selfloop transitions, 0 changer transitions 1/21 dead transitions. [2023-08-23 23:10:39,491 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 21 transitions, 91 flow [2023-08-23 23:10:39,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-23 23:10:39,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-23 23:10:39,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 243 transitions. [2023-08-23 23:10:39,507 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5677570093457944 [2023-08-23 23:10:39,508 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 243 transitions. [2023-08-23 23:10:39,508 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 243 transitions. [2023-08-23 23:10:39,510 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 23:10:39,512 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 243 transitions. [2023-08-23 23:10:39,515 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 121.5) internal successors, (243), 2 states have internal predecessors, (243), 0 states have call successors, (0), 0 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-23 23:10:39,518 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 214.0) internal successors, (642), 3 states have internal predecessors, (642), 0 states have call successors, (0), 0 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-23 23:10:39,519 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 214.0) internal successors, (642), 3 states have internal predecessors, (642), 0 states have call successors, (0), 0 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-23 23:10:39,520 INFO L175 Difference]: Start difference. First operand has 31 places, 22 transitions, 53 flow. Second operand 2 states and 243 transitions. [2023-08-23 23:10:39,521 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 21 transitions, 91 flow [2023-08-23 23:10:39,523 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 21 transitions, 88 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-23 23:10:39,524 INFO L231 Difference]: Finished difference. Result has 29 places, 20 transitions, 46 flow [2023-08-23 23:10:39,526 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=46, PETRI_PLACES=29, PETRI_TRANSITIONS=20} [2023-08-23 23:10:39,529 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, -2 predicate places. [2023-08-23 23:10:39,529 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 20 transitions, 46 flow [2023-08-23 23:10:39,530 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 116.0) internal successors, (232), 2 states have internal predecessors, (232), 0 states have call successors, (0), 0 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-23 23:10:39,530 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:10:39,530 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 23:10:39,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-23 23:10:39,530 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-23 23:10:39,531 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:10:39,531 INFO L85 PathProgramCache]: Analyzing trace with hash 767028099, now seen corresponding path program 1 times [2023-08-23 23:10:39,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:10:39,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912312221] [2023-08-23 23:10:39,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:10:39,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:10:39,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 23:10:39,911 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-23 23:10:39,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 23:10:39,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912312221] [2023-08-23 23:10:39,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912312221] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 23:10:39,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 23:10:39,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-23 23:10:39,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492445661] [2023-08-23 23:10:39,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 23:10:39,913 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-23 23:10:39,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 23:10:39,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-23 23:10:39,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-23 23:10:39,918 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 214 [2023-08-23 23:10:39,918 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 20 transitions, 46 flow. Second operand has 4 states, 4 states have (on average 108.5) internal successors, (434), 4 states have internal predecessors, (434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:10:39,919 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 23:10:39,919 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 214 [2023-08-23 23:10:39,919 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 23:10:40,210 INFO L124 PetriNetUnfolderBase]: 963/1468 cut-off events. [2023-08-23 23:10:40,210 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-23 23:10:40,213 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2981 conditions, 1468 events. 963/1468 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 6157 event pairs, 293 based on Foata normal form. 80/1548 useless extension candidates. Maximal degree in co-relation 2978. Up to 1213 conditions per place. [2023-08-23 23:10:40,218 INFO L140 encePairwiseOnDemand]: 209/214 looper letters, 29 selfloop transitions, 3 changer transitions 17/49 dead transitions. [2023-08-23 23:10:40,218 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 49 transitions, 206 flow [2023-08-23 23:10:40,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-23 23:10:40,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-23 23:10:40,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 581 transitions. [2023-08-23 23:10:40,221 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5429906542056074 [2023-08-23 23:10:40,221 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 581 transitions. [2023-08-23 23:10:40,221 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 581 transitions. [2023-08-23 23:10:40,222 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 23:10:40,222 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 581 transitions. [2023-08-23 23:10:40,224 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 116.2) internal successors, (581), 5 states have internal predecessors, (581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:10:40,227 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 214.0) internal successors, (1284), 6 states have internal predecessors, (1284), 0 states have call successors, (0), 0 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-23 23:10:40,227 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 214.0) internal successors, (1284), 6 states have internal predecessors, (1284), 0 states have call successors, (0), 0 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-23 23:10:40,227 INFO L175 Difference]: Start difference. First operand has 29 places, 20 transitions, 46 flow. Second operand 5 states and 581 transitions. [2023-08-23 23:10:40,227 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 49 transitions, 206 flow [2023-08-23 23:10:40,228 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 49 transitions, 206 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-23 23:10:40,229 INFO L231 Difference]: Finished difference. Result has 35 places, 22 transitions, 73 flow [2023-08-23 23:10:40,229 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=73, PETRI_PLACES=35, PETRI_TRANSITIONS=22} [2023-08-23 23:10:40,230 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 4 predicate places. [2023-08-23 23:10:40,230 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 22 transitions, 73 flow [2023-08-23 23:10:40,230 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 108.5) internal successors, (434), 4 states have internal predecessors, (434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:10:40,230 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:10:40,230 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 23:10:40,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-23 23:10:40,231 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-23 23:10:40,231 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:10:40,231 INFO L85 PathProgramCache]: Analyzing trace with hash -1991950769, now seen corresponding path program 1 times [2023-08-23 23:10:40,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:10:40,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894970383] [2023-08-23 23:10:40,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:10:40,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:10:40,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 23:10:40,445 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-23 23:10:40,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 23:10:40,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894970383] [2023-08-23 23:10:40,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894970383] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 23:10:40,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 23:10:40,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-23 23:10:40,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882742831] [2023-08-23 23:10:40,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 23:10:40,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-23 23:10:40,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 23:10:40,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-23 23:10:40,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-23 23:10:40,449 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 214 [2023-08-23 23:10:40,450 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 22 transitions, 73 flow. Second operand has 4 states, 4 states have (on average 109.75) internal successors, (439), 4 states have internal predecessors, (439), 0 states have call successors, (0), 0 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-23 23:10:40,450 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 23:10:40,450 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 214 [2023-08-23 23:10:40,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 23:10:40,739 INFO L124 PetriNetUnfolderBase]: 769/1230 cut-off events. [2023-08-23 23:10:40,739 INFO L125 PetriNetUnfolderBase]: For 513/513 co-relation queries the response was YES. [2023-08-23 23:10:40,742 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2974 conditions, 1230 events. 769/1230 cut-off events. For 513/513 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 5241 event pairs, 199 based on Foata normal form. 60/1290 useless extension candidates. Maximal degree in co-relation 2967. Up to 831 conditions per place. [2023-08-23 23:10:40,747 INFO L140 encePairwiseOnDemand]: 210/214 looper letters, 26 selfloop transitions, 2 changer transitions 14/44 dead transitions. [2023-08-23 23:10:40,748 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 44 transitions, 206 flow [2023-08-23 23:10:40,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-23 23:10:40,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-23 23:10:40,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 578 transitions. [2023-08-23 23:10:40,750 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5401869158878505 [2023-08-23 23:10:40,750 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 578 transitions. [2023-08-23 23:10:40,750 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 578 transitions. [2023-08-23 23:10:40,751 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 23:10:40,751 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 578 transitions. [2023-08-23 23:10:40,753 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 115.6) internal successors, (578), 5 states have internal predecessors, (578), 0 states have call successors, (0), 0 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-23 23:10:40,754 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 214.0) internal successors, (1284), 6 states have internal predecessors, (1284), 0 states have call successors, (0), 0 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-23 23:10:40,755 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 214.0) internal successors, (1284), 6 states have internal predecessors, (1284), 0 states have call successors, (0), 0 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-23 23:10:40,755 INFO L175 Difference]: Start difference. First operand has 35 places, 22 transitions, 73 flow. Second operand 5 states and 578 transitions. [2023-08-23 23:10:40,755 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 44 transitions, 206 flow [2023-08-23 23:10:40,760 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 44 transitions, 200 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-23 23:10:40,761 INFO L231 Difference]: Finished difference. Result has 38 places, 22 transitions, 80 flow [2023-08-23 23:10:40,761 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=80, PETRI_PLACES=38, PETRI_TRANSITIONS=22} [2023-08-23 23:10:40,762 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 7 predicate places. [2023-08-23 23:10:40,764 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 22 transitions, 80 flow [2023-08-23 23:10:40,765 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 109.75) internal successors, (439), 4 states have internal predecessors, (439), 0 states have call successors, (0), 0 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-23 23:10:40,765 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:10:40,766 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 23:10:40,766 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-23 23:10:40,766 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-23 23:10:40,766 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:10:40,766 INFO L85 PathProgramCache]: Analyzing trace with hash -1321479272, now seen corresponding path program 1 times [2023-08-23 23:10:40,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:10:40,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954565434] [2023-08-23 23:10:40,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:10:40,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:10:40,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 23:10:41,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-23 23:10:41,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 23:10:41,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954565434] [2023-08-23 23:10:41,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954565434] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 23:10:41,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 23:10:41,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-23 23:10:41,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673533140] [2023-08-23 23:10:41,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 23:10:41,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-23 23:10:41,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 23:10:41,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-23 23:10:41,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-08-23 23:10:41,809 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 214 [2023-08-23 23:10:41,810 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 22 transitions, 80 flow. Second operand has 7 states, 7 states have (on average 86.71428571428571) internal successors, (607), 7 states have internal predecessors, (607), 0 states have call successors, (0), 0 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-23 23:10:41,810 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 23:10:41,810 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 214 [2023-08-23 23:10:41,810 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 23:10:42,184 INFO L124 PetriNetUnfolderBase]: 706/1137 cut-off events. [2023-08-23 23:10:42,185 INFO L125 PetriNetUnfolderBase]: For 896/896 co-relation queries the response was YES. [2023-08-23 23:10:42,187 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2901 conditions, 1137 events. 706/1137 cut-off events. For 896/896 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 4785 event pairs, 219 based on Foata normal form. 60/1197 useless extension candidates. Maximal degree in co-relation 2892. Up to 796 conditions per place. [2023-08-23 23:10:42,191 INFO L140 encePairwiseOnDemand]: 209/214 looper letters, 33 selfloop transitions, 4 changer transitions 14/53 dead transitions. [2023-08-23 23:10:42,191 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 53 transitions, 269 flow [2023-08-23 23:10:42,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-23 23:10:42,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-23 23:10:42,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 561 transitions. [2023-08-23 23:10:42,194 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4369158878504673 [2023-08-23 23:10:42,194 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 561 transitions. [2023-08-23 23:10:42,194 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 561 transitions. [2023-08-23 23:10:42,194 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 23:10:42,194 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 561 transitions. [2023-08-23 23:10:42,196 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 93.5) internal successors, (561), 6 states have internal predecessors, (561), 0 states have call successors, (0), 0 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-23 23:10:42,198 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 214.0) internal successors, (1498), 7 states have internal predecessors, (1498), 0 states have call successors, (0), 0 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-23 23:10:42,199 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 214.0) internal successors, (1498), 7 states have internal predecessors, (1498), 0 states have call successors, (0), 0 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-23 23:10:42,199 INFO L175 Difference]: Start difference. First operand has 38 places, 22 transitions, 80 flow. Second operand 6 states and 561 transitions. [2023-08-23 23:10:42,199 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 53 transitions, 269 flow [2023-08-23 23:10:42,204 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 53 transitions, 259 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-08-23 23:10:42,205 INFO L231 Difference]: Finished difference. Result has 41 places, 24 transitions, 98 flow [2023-08-23 23:10:42,206 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=98, PETRI_PLACES=41, PETRI_TRANSITIONS=24} [2023-08-23 23:10:42,207 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 10 predicate places. [2023-08-23 23:10:42,207 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 24 transitions, 98 flow [2023-08-23 23:10:42,208 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 86.71428571428571) internal successors, (607), 7 states have internal predecessors, (607), 0 states have call successors, (0), 0 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-23 23:10:42,208 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:10:42,208 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 23:10:42,208 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-23 23:10:42,208 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-23 23:10:42,208 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:10:42,209 INFO L85 PathProgramCache]: Analyzing trace with hash 1984096337, now seen corresponding path program 1 times [2023-08-23 23:10:42,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:10:42,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843688528] [2023-08-23 23:10:42,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:10:42,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:10:42,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 23:10:42,411 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-23 23:10:42,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 23:10:42,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843688528] [2023-08-23 23:10:42,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843688528] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 23:10:42,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 23:10:42,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-23 23:10:42,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527207887] [2023-08-23 23:10:42,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 23:10:42,412 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-23 23:10:42,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 23:10:42,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-23 23:10:42,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-23 23:10:42,416 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 214 [2023-08-23 23:10:42,420 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 24 transitions, 98 flow. Second operand has 3 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 0 states have call successors, (0), 0 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-23 23:10:42,420 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 23:10:42,420 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 214 [2023-08-23 23:10:42,420 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 23:10:42,569 INFO L124 PetriNetUnfolderBase]: 374/629 cut-off events. [2023-08-23 23:10:42,569 INFO L125 PetriNetUnfolderBase]: For 399/399 co-relation queries the response was YES. [2023-08-23 23:10:42,571 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1744 conditions, 629 events. 374/629 cut-off events. For 399/399 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2428 event pairs, 105 based on Foata normal form. 27/650 useless extension candidates. Maximal degree in co-relation 1733. Up to 500 conditions per place. [2023-08-23 23:10:42,574 INFO L140 encePairwiseOnDemand]: 209/214 looper letters, 34 selfloop transitions, 4 changer transitions 0/40 dead transitions. [2023-08-23 23:10:42,574 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 40 transitions, 230 flow [2023-08-23 23:10:42,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-23 23:10:42,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-23 23:10:42,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 351 transitions. [2023-08-23 23:10:42,575 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5467289719626168 [2023-08-23 23:10:42,575 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 351 transitions. [2023-08-23 23:10:42,575 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 351 transitions. [2023-08-23 23:10:42,576 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 23:10:42,576 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 351 transitions. [2023-08-23 23:10:42,577 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 117.0) internal successors, (351), 3 states have internal predecessors, (351), 0 states have call successors, (0), 0 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-23 23:10:42,578 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 214.0) internal successors, (856), 4 states have internal predecessors, (856), 0 states have call successors, (0), 0 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-23 23:10:42,578 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 214.0) internal successors, (856), 4 states have internal predecessors, (856), 0 states have call successors, (0), 0 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-23 23:10:42,578 INFO L175 Difference]: Start difference. First operand has 41 places, 24 transitions, 98 flow. Second operand 3 states and 351 transitions. [2023-08-23 23:10:42,578 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 40 transitions, 230 flow [2023-08-23 23:10:42,580 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 40 transitions, 221 flow, removed 2 selfloop flow, removed 3 redundant places. [2023-08-23 23:10:42,581 INFO L231 Difference]: Finished difference. Result has 39 places, 27 transitions, 117 flow [2023-08-23 23:10:42,581 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=91, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=117, PETRI_PLACES=39, PETRI_TRANSITIONS=27} [2023-08-23 23:10:42,582 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 8 predicate places. [2023-08-23 23:10:42,582 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 27 transitions, 117 flow [2023-08-23 23:10:42,582 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 0 states have call successors, (0), 0 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-23 23:10:42,582 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:10:42,582 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 23:10:42,582 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-23 23:10:42,582 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-23 23:10:42,583 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:10:42,583 INFO L85 PathProgramCache]: Analyzing trace with hash 2101196731, now seen corresponding path program 1 times [2023-08-23 23:10:42,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:10:42,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308926347] [2023-08-23 23:10:42,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:10:42,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:10:42,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 23:10:42,786 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-23 23:10:42,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 23:10:42,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308926347] [2023-08-23 23:10:42,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308926347] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 23:10:42,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 23:10:42,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-23 23:10:42,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051273766] [2023-08-23 23:10:42,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 23:10:42,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-23 23:10:42,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 23:10:42,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-23 23:10:42,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-23 23:10:42,791 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 214 [2023-08-23 23:10:42,792 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 27 transitions, 117 flow. Second operand has 4 states, 4 states have (on average 109.75) internal successors, (439), 4 states have internal predecessors, (439), 0 states have call successors, (0), 0 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-23 23:10:42,792 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 23:10:42,792 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 214 [2023-08-23 23:10:42,792 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 23:10:42,910 INFO L124 PetriNetUnfolderBase]: 178/335 cut-off events. [2023-08-23 23:10:42,910 INFO L125 PetriNetUnfolderBase]: For 171/171 co-relation queries the response was YES. [2023-08-23 23:10:42,911 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1019 conditions, 335 events. 178/335 cut-off events. For 171/171 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1150 event pairs, 53 based on Foata normal form. 29/362 useless extension candidates. Maximal degree in co-relation 1009. Up to 111 conditions per place. [2023-08-23 23:10:42,913 INFO L140 encePairwiseOnDemand]: 209/214 looper letters, 42 selfloop transitions, 7 changer transitions 0/51 dead transitions. [2023-08-23 23:10:42,913 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 51 transitions, 302 flow [2023-08-23 23:10:42,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-23 23:10:42,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-23 23:10:42,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 468 transitions. [2023-08-23 23:10:42,915 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5467289719626168 [2023-08-23 23:10:42,915 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 468 transitions. [2023-08-23 23:10:42,915 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 468 transitions. [2023-08-23 23:10:42,915 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 23:10:42,915 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 468 transitions. [2023-08-23 23:10:42,916 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 117.0) internal successors, (468), 4 states have internal predecessors, (468), 0 states have call successors, (0), 0 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-23 23:10:42,918 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 214.0) internal successors, (1070), 5 states have internal predecessors, (1070), 0 states have call successors, (0), 0 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-23 23:10:42,918 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 214.0) internal successors, (1070), 5 states have internal predecessors, (1070), 0 states have call successors, (0), 0 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-23 23:10:42,918 INFO L175 Difference]: Start difference. First operand has 39 places, 27 transitions, 117 flow. Second operand 4 states and 468 transitions. [2023-08-23 23:10:42,918 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 51 transitions, 302 flow [2023-08-23 23:10:42,919 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 51 transitions, 298 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-23 23:10:42,920 INFO L231 Difference]: Finished difference. Result has 42 places, 30 transitions, 153 flow [2023-08-23 23:10:42,920 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=113, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=153, PETRI_PLACES=42, PETRI_TRANSITIONS=30} [2023-08-23 23:10:42,923 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 11 predicate places. [2023-08-23 23:10:42,923 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 30 transitions, 153 flow [2023-08-23 23:10:42,923 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 109.75) internal successors, (439), 4 states have internal predecessors, (439), 0 states have call successors, (0), 0 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-23 23:10:42,923 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:10:42,923 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 23:10:42,923 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-23 23:10:42,924 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-23 23:10:42,924 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:10:42,924 INFO L85 PathProgramCache]: Analyzing trace with hash -1424814450, now seen corresponding path program 1 times [2023-08-23 23:10:42,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:10:42,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326827336] [2023-08-23 23:10:42,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:10:42,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:10:42,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 23:10:43,208 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-23 23:10:43,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 23:10:43,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326827336] [2023-08-23 23:10:43,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326827336] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 23:10:43,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 23:10:43,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-23 23:10:43,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406116114] [2023-08-23 23:10:43,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 23:10:43,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-23 23:10:43,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 23:10:43,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-23 23:10:43,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-23 23:10:43,212 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 214 [2023-08-23 23:10:43,213 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 30 transitions, 153 flow. Second operand has 5 states, 5 states have (on average 109.4) internal successors, (547), 5 states have internal predecessors, (547), 0 states have call successors, (0), 0 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-23 23:10:43,213 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 23:10:43,213 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 214 [2023-08-23 23:10:43,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 23:10:43,345 INFO L124 PetriNetUnfolderBase]: 141/262 cut-off events. [2023-08-23 23:10:43,346 INFO L125 PetriNetUnfolderBase]: For 286/286 co-relation queries the response was YES. [2023-08-23 23:10:43,346 INFO L83 FinitePrefix]: Finished finitePrefix Result has 852 conditions, 262 events. 141/262 cut-off events. For 286/286 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 869 event pairs, 47 based on Foata normal form. 10/271 useless extension candidates. Maximal degree in co-relation 841. Up to 111 conditions per place. [2023-08-23 23:10:43,348 INFO L140 encePairwiseOnDemand]: 209/214 looper letters, 39 selfloop transitions, 10 changer transitions 0/51 dead transitions. [2023-08-23 23:10:43,348 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 51 transitions, 326 flow [2023-08-23 23:10:43,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-23 23:10:43,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-23 23:10:43,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 574 transitions. [2023-08-23 23:10:43,350 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5364485981308411 [2023-08-23 23:10:43,350 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 574 transitions. [2023-08-23 23:10:43,350 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 574 transitions. [2023-08-23 23:10:43,351 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 23:10:43,351 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 574 transitions. [2023-08-23 23:10:43,352 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 114.8) internal successors, (574), 5 states have internal predecessors, (574), 0 states have call successors, (0), 0 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-23 23:10:43,354 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 214.0) internal successors, (1284), 6 states have internal predecessors, (1284), 0 states have call successors, (0), 0 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-23 23:10:43,354 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 214.0) internal successors, (1284), 6 states have internal predecessors, (1284), 0 states have call successors, (0), 0 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-23 23:10:43,354 INFO L175 Difference]: Start difference. First operand has 42 places, 30 transitions, 153 flow. Second operand 5 states and 574 transitions. [2023-08-23 23:10:43,354 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 51 transitions, 326 flow [2023-08-23 23:10:43,356 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 51 transitions, 285 flow, removed 11 selfloop flow, removed 5 redundant places. [2023-08-23 23:10:43,357 INFO L231 Difference]: Finished difference. Result has 42 places, 30 transitions, 150 flow [2023-08-23 23:10:43,357 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=150, PETRI_PLACES=42, PETRI_TRANSITIONS=30} [2023-08-23 23:10:43,358 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 11 predicate places. [2023-08-23 23:10:43,358 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 30 transitions, 150 flow [2023-08-23 23:10:43,358 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 109.4) internal successors, (547), 5 states have internal predecessors, (547), 0 states have call successors, (0), 0 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-23 23:10:43,358 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:10:43,358 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 23:10:43,359 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-23 23:10:43,359 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-23 23:10:43,359 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:10:43,359 INFO L85 PathProgramCache]: Analyzing trace with hash 899993385, now seen corresponding path program 1 times [2023-08-23 23:10:43,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:10:43,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35349565] [2023-08-23 23:10:43,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:10:43,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:10:43,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 23:10:43,568 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-23 23:10:43,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 23:10:43,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35349565] [2023-08-23 23:10:43,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35349565] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 23:10:43,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 23:10:43,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-23 23:10:43,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660288715] [2023-08-23 23:10:43,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 23:10:43,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-23 23:10:43,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 23:10:43,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-23 23:10:43,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-23 23:10:43,571 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 214 [2023-08-23 23:10:43,571 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 30 transitions, 150 flow. Second operand has 4 states, 4 states have (on average 111.0) internal successors, (444), 4 states have internal predecessors, (444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:10:43,571 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 23:10:43,571 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 214 [2023-08-23 23:10:43,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 23:10:43,692 INFO L124 PetriNetUnfolderBase]: 198/362 cut-off events. [2023-08-23 23:10:43,692 INFO L125 PetriNetUnfolderBase]: For 496/496 co-relation queries the response was YES. [2023-08-23 23:10:43,693 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1152 conditions, 362 events. 198/362 cut-off events. For 496/496 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1283 event pairs, 92 based on Foata normal form. 1/363 useless extension candidates. Maximal degree in co-relation 1143. Up to 252 conditions per place. [2023-08-23 23:10:43,694 INFO L140 encePairwiseOnDemand]: 210/214 looper letters, 33 selfloop transitions, 2 changer transitions 11/46 dead transitions. [2023-08-23 23:10:43,694 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 46 transitions, 335 flow [2023-08-23 23:10:43,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-23 23:10:43,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-23 23:10:43,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 456 transitions. [2023-08-23 23:10:43,696 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5327102803738317 [2023-08-23 23:10:43,696 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 456 transitions. [2023-08-23 23:10:43,696 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 456 transitions. [2023-08-23 23:10:43,696 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 23:10:43,696 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 456 transitions. [2023-08-23 23:10:43,698 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 0 states have call successors, (0), 0 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-23 23:10:43,699 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 214.0) internal successors, (1070), 5 states have internal predecessors, (1070), 0 states have call successors, (0), 0 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-23 23:10:43,699 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 214.0) internal successors, (1070), 5 states have internal predecessors, (1070), 0 states have call successors, (0), 0 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-23 23:10:43,699 INFO L175 Difference]: Start difference. First operand has 42 places, 30 transitions, 150 flow. Second operand 4 states and 456 transitions. [2023-08-23 23:10:43,700 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 46 transitions, 335 flow [2023-08-23 23:10:43,701 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 46 transitions, 285 flow, removed 12 selfloop flow, removed 3 redundant places. [2023-08-23 23:10:43,702 INFO L231 Difference]: Finished difference. Result has 44 places, 28 transitions, 126 flow [2023-08-23 23:10:43,702 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=126, PETRI_PLACES=44, PETRI_TRANSITIONS=28} [2023-08-23 23:10:43,703 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 13 predicate places. [2023-08-23 23:10:43,703 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 28 transitions, 126 flow [2023-08-23 23:10:43,703 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 111.0) internal successors, (444), 4 states have internal predecessors, (444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:10:43,703 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:10:43,704 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 23:10:43,704 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-23 23:10:43,704 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-23 23:10:43,704 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:10:43,704 INFO L85 PathProgramCache]: Analyzing trace with hash -259354795, now seen corresponding path program 2 times [2023-08-23 23:10:43,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:10:43,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484772644] [2023-08-23 23:10:43,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:10:43,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:10:43,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 23:10:45,593 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-23 23:10:45,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 23:10:45,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484772644] [2023-08-23 23:10:45,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484772644] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 23:10:45,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 23:10:45,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-23 23:10:45,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123274956] [2023-08-23 23:10:45,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 23:10:45,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-23 23:10:45,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 23:10:45,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-23 23:10:45,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-08-23 23:10:45,596 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 214 [2023-08-23 23:10:45,597 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 28 transitions, 126 flow. Second operand has 8 states, 8 states have (on average 92.375) internal successors, (739), 8 states have internal predecessors, (739), 0 states have call successors, (0), 0 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-23 23:10:45,597 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 23:10:45,597 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 214 [2023-08-23 23:10:45,597 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 23:10:45,931 INFO L124 PetriNetUnfolderBase]: 114/237 cut-off events. [2023-08-23 23:10:45,931 INFO L125 PetriNetUnfolderBase]: For 227/227 co-relation queries the response was YES. [2023-08-23 23:10:45,932 INFO L83 FinitePrefix]: Finished finitePrefix Result has 762 conditions, 237 events. 114/237 cut-off events. For 227/227 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 875 event pairs, 17 based on Foata normal form. 1/238 useless extension candidates. Maximal degree in co-relation 751. Up to 118 conditions per place. [2023-08-23 23:10:45,933 INFO L140 encePairwiseOnDemand]: 206/214 looper letters, 31 selfloop transitions, 7 changer transitions 24/63 dead transitions. [2023-08-23 23:10:45,933 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 63 transitions, 416 flow [2023-08-23 23:10:45,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-23 23:10:45,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-23 23:10:45,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 672 transitions. [2023-08-23 23:10:45,935 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4485981308411215 [2023-08-23 23:10:45,935 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 672 transitions. [2023-08-23 23:10:45,935 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 672 transitions. [2023-08-23 23:10:45,936 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 23:10:45,936 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 672 transitions. [2023-08-23 23:10:45,937 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 96.0) internal successors, (672), 7 states have internal predecessors, (672), 0 states have call successors, (0), 0 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-23 23:10:45,939 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 214.0) internal successors, (1712), 8 states have internal predecessors, (1712), 0 states have call successors, (0), 0 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-23 23:10:45,940 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 214.0) internal successors, (1712), 8 states have internal predecessors, (1712), 0 states have call successors, (0), 0 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-23 23:10:45,940 INFO L175 Difference]: Start difference. First operand has 44 places, 28 transitions, 126 flow. Second operand 7 states and 672 transitions. [2023-08-23 23:10:45,940 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 63 transitions, 416 flow [2023-08-23 23:10:45,942 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 63 transitions, 393 flow, removed 5 selfloop flow, removed 6 redundant places. [2023-08-23 23:10:45,943 INFO L231 Difference]: Finished difference. Result has 47 places, 31 transitions, 150 flow [2023-08-23 23:10:45,943 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=150, PETRI_PLACES=47, PETRI_TRANSITIONS=31} [2023-08-23 23:10:45,944 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 16 predicate places. [2023-08-23 23:10:45,944 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 31 transitions, 150 flow [2023-08-23 23:10:45,945 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 92.375) internal successors, (739), 8 states have internal predecessors, (739), 0 states have call successors, (0), 0 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-23 23:10:45,945 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:10:45,945 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 23:10:45,945 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-23 23:10:45,945 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-23 23:10:45,945 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:10:45,945 INFO L85 PathProgramCache]: Analyzing trace with hash -1484584181, now seen corresponding path program 3 times [2023-08-23 23:10:45,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:10:45,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304869891] [2023-08-23 23:10:45,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:10:45,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:10:45,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 23:10:48,108 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-23 23:10:48,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 23:10:48,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304869891] [2023-08-23 23:10:48,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304869891] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 23:10:48,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 23:10:48,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-23 23:10:48,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445112773] [2023-08-23 23:10:48,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 23:10:48,110 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-23 23:10:48,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 23:10:48,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-23 23:10:48,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-08-23 23:10:48,112 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 214 [2023-08-23 23:10:48,114 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 31 transitions, 150 flow. Second operand has 9 states, 9 states have (on average 91.11111111111111) internal successors, (820), 9 states have internal predecessors, (820), 0 states have call successors, (0), 0 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-23 23:10:48,114 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 23:10:48,114 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 214 [2023-08-23 23:10:48,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 23:10:48,500 INFO L124 PetriNetUnfolderBase]: 121/256 cut-off events. [2023-08-23 23:10:48,501 INFO L125 PetriNetUnfolderBase]: For 265/265 co-relation queries the response was YES. [2023-08-23 23:10:48,501 INFO L83 FinitePrefix]: Finished finitePrefix Result has 864 conditions, 256 events. 121/256 cut-off events. For 265/265 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1006 event pairs, 35 based on Foata normal form. 1/257 useless extension candidates. Maximal degree in co-relation 852. Up to 112 conditions per place. [2023-08-23 23:10:48,502 INFO L140 encePairwiseOnDemand]: 208/214 looper letters, 30 selfloop transitions, 5 changer transitions 15/51 dead transitions. [2023-08-23 23:10:48,502 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 51 transitions, 348 flow [2023-08-23 23:10:48,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-23 23:10:48,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-23 23:10:48,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 569 transitions. [2023-08-23 23:10:48,506 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4431464174454829 [2023-08-23 23:10:48,506 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 569 transitions. [2023-08-23 23:10:48,506 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 569 transitions. [2023-08-23 23:10:48,506 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 23:10:48,506 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 569 transitions. [2023-08-23 23:10:48,508 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 94.83333333333333) internal successors, (569), 6 states have internal predecessors, (569), 0 states have call successors, (0), 0 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-23 23:10:48,510 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 214.0) internal successors, (1498), 7 states have internal predecessors, (1498), 0 states have call successors, (0), 0 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-23 23:10:48,511 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 214.0) internal successors, (1498), 7 states have internal predecessors, (1498), 0 states have call successors, (0), 0 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-23 23:10:48,511 INFO L175 Difference]: Start difference. First operand has 47 places, 31 transitions, 150 flow. Second operand 6 states and 569 transitions. [2023-08-23 23:10:48,511 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 51 transitions, 348 flow [2023-08-23 23:10:48,513 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 51 transitions, 335 flow, removed 3 selfloop flow, removed 4 redundant places. [2023-08-23 23:10:48,514 INFO L231 Difference]: Finished difference. Result has 49 places, 28 transitions, 146 flow [2023-08-23 23:10:48,514 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=139, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=146, PETRI_PLACES=49, PETRI_TRANSITIONS=28} [2023-08-23 23:10:48,515 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 18 predicate places. [2023-08-23 23:10:48,515 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 28 transitions, 146 flow [2023-08-23 23:10:48,516 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 91.11111111111111) internal successors, (820), 9 states have internal predecessors, (820), 0 states have call successors, (0), 0 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-23 23:10:48,516 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:10:48,516 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 23:10:48,516 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-23 23:10:48,516 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-23 23:10:48,516 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:10:48,516 INFO L85 PathProgramCache]: Analyzing trace with hash -755288775, now seen corresponding path program 4 times [2023-08-23 23:10:48,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:10:48,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845481207] [2023-08-23 23:10:48,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:10:48,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:10:48,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 23:10:49,143 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-23 23:10:49,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 23:10:49,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845481207] [2023-08-23 23:10:49,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845481207] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 23:10:49,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 23:10:49,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-23 23:10:49,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391074527] [2023-08-23 23:10:49,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 23:10:49,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-23 23:10:49,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 23:10:49,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-23 23:10:49,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-23 23:10:49,146 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 214 [2023-08-23 23:10:49,147 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 28 transitions, 146 flow. Second operand has 7 states, 7 states have (on average 98.71428571428571) internal successors, (691), 7 states have internal predecessors, (691), 0 states have call successors, (0), 0 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-23 23:10:49,147 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 23:10:49,147 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 214 [2023-08-23 23:10:49,147 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 23:10:49,352 INFO L124 PetriNetUnfolderBase]: 104/222 cut-off events. [2023-08-23 23:10:49,352 INFO L125 PetriNetUnfolderBase]: For 324/324 co-relation queries the response was YES. [2023-08-23 23:10:49,353 INFO L83 FinitePrefix]: Finished finitePrefix Result has 820 conditions, 222 events. 104/222 cut-off events. For 324/324 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 870 event pairs, 14 based on Foata normal form. 1/223 useless extension candidates. Maximal degree in co-relation 807. Up to 87 conditions per place. [2023-08-23 23:10:49,354 INFO L140 encePairwiseOnDemand]: 207/214 looper letters, 36 selfloop transitions, 5 changer transitions 27/69 dead transitions. [2023-08-23 23:10:49,354 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 69 transitions, 496 flow [2023-08-23 23:10:49,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-23 23:10:49,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-23 23:10:49,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 715 transitions. [2023-08-23 23:10:49,357 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4773030707610147 [2023-08-23 23:10:49,357 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 715 transitions. [2023-08-23 23:10:49,357 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 715 transitions. [2023-08-23 23:10:49,357 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 23:10:49,357 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 715 transitions. [2023-08-23 23:10:49,359 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 102.14285714285714) internal successors, (715), 7 states have internal predecessors, (715), 0 states have call successors, (0), 0 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-23 23:10:49,361 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 214.0) internal successors, (1712), 8 states have internal predecessors, (1712), 0 states have call successors, (0), 0 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-23 23:10:49,362 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 214.0) internal successors, (1712), 8 states have internal predecessors, (1712), 0 states have call successors, (0), 0 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-23 23:10:49,362 INFO L175 Difference]: Start difference. First operand has 49 places, 28 transitions, 146 flow. Second operand 7 states and 715 transitions. [2023-08-23 23:10:49,362 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 69 transitions, 496 flow [2023-08-23 23:10:49,364 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 69 transitions, 443 flow, removed 13 selfloop flow, removed 12 redundant places. [2023-08-23 23:10:49,365 INFO L231 Difference]: Finished difference. Result has 46 places, 30 transitions, 141 flow [2023-08-23 23:10:49,366 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=109, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=141, PETRI_PLACES=46, PETRI_TRANSITIONS=30} [2023-08-23 23:10:49,366 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 15 predicate places. [2023-08-23 23:10:49,366 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 30 transitions, 141 flow [2023-08-23 23:10:49,367 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 98.71428571428571) internal successors, (691), 7 states have internal predecessors, (691), 0 states have call successors, (0), 0 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-23 23:10:49,367 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:10:49,367 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 23:10:49,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-23 23:10:49,367 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-23 23:10:49,368 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:10:49,368 INFO L85 PathProgramCache]: Analyzing trace with hash 873593821, now seen corresponding path program 5 times [2023-08-23 23:10:49,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:10:49,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746216338] [2023-08-23 23:10:49,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:10:49,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:10:49,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 23:10:50,922 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-23 23:10:50,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 23:10:50,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746216338] [2023-08-23 23:10:50,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746216338] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 23:10:50,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 23:10:50,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-23 23:10:50,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318493512] [2023-08-23 23:10:50,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 23:10:50,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-23 23:10:50,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 23:10:50,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-23 23:10:50,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-08-23 23:10:50,924 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 214 [2023-08-23 23:10:50,925 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 30 transitions, 141 flow. Second operand has 9 states, 9 states have (on average 97.11111111111111) internal successors, (874), 9 states have internal predecessors, (874), 0 states have call successors, (0), 0 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-23 23:10:50,925 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 23:10:50,925 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 214 [2023-08-23 23:10:50,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 23:10:51,155 INFO L124 PetriNetUnfolderBase]: 79/178 cut-off events. [2023-08-23 23:10:51,155 INFO L125 PetriNetUnfolderBase]: For 210/212 co-relation queries the response was YES. [2023-08-23 23:10:51,156 INFO L83 FinitePrefix]: Finished finitePrefix Result has 640 conditions, 178 events. 79/178 cut-off events. For 210/212 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 658 event pairs, 17 based on Foata normal form. 3/181 useless extension candidates. Maximal degree in co-relation 628. Up to 120 conditions per place. [2023-08-23 23:10:51,157 INFO L140 encePairwiseOnDemand]: 208/214 looper letters, 27 selfloop transitions, 4 changer transitions 16/48 dead transitions. [2023-08-23 23:10:51,157 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 48 transitions, 331 flow [2023-08-23 23:10:51,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-23 23:10:51,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-23 23:10:51,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 697 transitions. [2023-08-23 23:10:51,159 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4652870493991989 [2023-08-23 23:10:51,159 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 697 transitions. [2023-08-23 23:10:51,159 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 697 transitions. [2023-08-23 23:10:51,160 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 23:10:51,160 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 697 transitions. [2023-08-23 23:10:51,161 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 99.57142857142857) internal successors, (697), 7 states have internal predecessors, (697), 0 states have call successors, (0), 0 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-23 23:10:51,163 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 214.0) internal successors, (1712), 8 states have internal predecessors, (1712), 0 states have call successors, (0), 0 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-23 23:10:51,164 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 214.0) internal successors, (1712), 8 states have internal predecessors, (1712), 0 states have call successors, (0), 0 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-23 23:10:51,164 INFO L175 Difference]: Start difference. First operand has 46 places, 30 transitions, 141 flow. Second operand 7 states and 697 transitions. [2023-08-23 23:10:51,164 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 48 transitions, 331 flow [2023-08-23 23:10:51,166 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 48 transitions, 313 flow, removed 6 selfloop flow, removed 5 redundant places. [2023-08-23 23:10:51,167 INFO L231 Difference]: Finished difference. Result has 46 places, 28 transitions, 128 flow [2023-08-23 23:10:51,167 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=127, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=128, PETRI_PLACES=46, PETRI_TRANSITIONS=28} [2023-08-23 23:10:51,169 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 15 predicate places. [2023-08-23 23:10:51,169 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 28 transitions, 128 flow [2023-08-23 23:10:51,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 97.11111111111111) internal successors, (874), 9 states have internal predecessors, (874), 0 states have call successors, (0), 0 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-23 23:10:51,169 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:10:51,169 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 23:10:51,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-23 23:10:51,170 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-23 23:10:51,170 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:10:51,170 INFO L85 PathProgramCache]: Analyzing trace with hash -1410232563, now seen corresponding path program 6 times [2023-08-23 23:10:51,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:10:51,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208014666] [2023-08-23 23:10:51,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:10:51,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:10:51,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-23 23:10:51,256 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-23 23:10:51,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-23 23:10:51,363 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-23 23:10:51,363 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-23 23:10:51,364 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2023-08-23 23:10:51,366 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2023-08-23 23:10:51,366 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2023-08-23 23:10:51,366 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2023-08-23 23:10:51,366 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-23 23:10:51,366 INFO L445 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 23:10:51,370 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-23 23:10:51,371 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-23 23:10:51,458 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.08 11:10:51 BasicIcfg [2023-08-23 23:10:51,458 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-23 23:10:51,458 INFO L158 Benchmark]: Toolchain (without parser) took 19465.75ms. Allocated memory was 360.7MB in the beginning and 629.1MB in the end (delta: 268.4MB). Free memory was 336.0MB in the beginning and 240.8MB in the end (delta: 95.2MB). Peak memory consumption was 364.3MB. Max. memory is 16.0GB. [2023-08-23 23:10:51,458 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 360.7MB. Free memory is still 337.9MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-23 23:10:51,459 INFO L158 Benchmark]: CACSL2BoogieTranslator took 461.89ms. Allocated memory is still 360.7MB. Free memory was 335.4MB in the beginning and 311.5MB in the end (delta: 24.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-23 23:10:51,459 INFO L158 Benchmark]: Boogie Procedure Inliner took 78.11ms. Allocated memory is still 360.7MB. Free memory was 311.5MB in the beginning and 308.9MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-08-23 23:10:51,459 INFO L158 Benchmark]: Boogie Preprocessor took 57.85ms. Allocated memory is still 360.7MB. Free memory was 308.9MB in the beginning and 306.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-23 23:10:51,459 INFO L158 Benchmark]: RCFGBuilder took 791.45ms. Allocated memory is still 360.7MB. Free memory was 306.8MB in the beginning and 297.8MB in the end (delta: 9.0MB). Peak memory consumption was 33.7MB. Max. memory is 16.0GB. [2023-08-23 23:10:51,460 INFO L158 Benchmark]: TraceAbstraction took 18071.23ms. Allocated memory was 360.7MB in the beginning and 629.1MB in the end (delta: 268.4MB). Free memory was 296.8MB in the beginning and 240.8MB in the end (delta: 56.0MB). Peak memory consumption was 324.4MB. Max. memory is 16.0GB. [2023-08-23 23:10:51,461 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.15ms. Allocated memory is still 360.7MB. Free memory is still 337.9MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 461.89ms. Allocated memory is still 360.7MB. Free memory was 335.4MB in the beginning and 311.5MB in the end (delta: 24.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 78.11ms. Allocated memory is still 360.7MB. Free memory was 311.5MB in the beginning and 308.9MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 57.85ms. Allocated memory is still 360.7MB. Free memory was 308.9MB in the beginning and 306.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 791.45ms. Allocated memory is still 360.7MB. Free memory was 306.8MB in the beginning and 297.8MB in the end (delta: 9.0MB). Peak memory consumption was 33.7MB. Max. memory is 16.0GB. * TraceAbstraction took 18071.23ms. Allocated memory was 360.7MB in the beginning and 629.1MB in the end (delta: 268.4MB). Free memory was 296.8MB in the beginning and 240.8MB in the end (delta: 56.0MB). Peak memory consumption was 324.4MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 268]: Unsoundness Warning unspecified type, defaulting to int C: short [268] - GenericResultAtLocation [Line: 268]: Unsoundness Warning unspecified type, defaulting to int C: short [268] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.3s, 117 PlacesBefore, 31 PlacesAfterwards, 108 TransitionsBefore, 22 TransitionsAfterwards, 1138 CoEnabledTransitionPairs, 7 FixpointIterations, 56 TrivialSequentialCompositions, 32 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 91 TotalNumberOfCompositions, 3288 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1153, independent: 982, independent conditional: 0, independent unconditional: 982, dependent: 171, dependent conditional: 0, dependent unconditional: 171, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 576, independent: 542, independent conditional: 0, independent unconditional: 542, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1153, independent: 440, independent conditional: 0, independent unconditional: 440, dependent: 137, dependent conditional: 0, dependent unconditional: 137, unknown: 576, unknown conditional: 0, unknown unconditional: 576] , Statistics on independence cache: Total cache size (in pairs): 57, Positive cache size: 42, Positive conditional cache size: 0, Positive unconditional cache size: 42, Negative cache size: 15, Negative conditional cache size: 0, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L715] 0 _Bool __unbuffered_p2_EAX$flush_delayed; [L716] 0 int __unbuffered_p2_EAX$mem_tmp; [L717] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd0; [L718] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd1; [L719] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd2; [L720] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd3; [L721] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd0; [L722] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd1; [L723] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd2; [L724] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd3; [L725] 0 _Bool __unbuffered_p2_EAX$read_delayed; [L726] 0 int *__unbuffered_p2_EAX$read_delayed_var; [L727] 0 int __unbuffered_p2_EAX$w_buff0; [L728] 0 _Bool __unbuffered_p2_EAX$w_buff0_used; [L729] 0 int __unbuffered_p2_EAX$w_buff1; [L730] 0 _Bool __unbuffered_p2_EAX$w_buff1_used; [L731] 0 _Bool main$tmp_guard0; [L732] 0 _Bool main$tmp_guard1; [L734] 0 int x = 0; [L735] 0 _Bool x$flush_delayed; [L736] 0 int x$mem_tmp; [L737] 0 _Bool x$r_buff0_thd0; [L738] 0 _Bool x$r_buff0_thd1; [L739] 0 _Bool x$r_buff0_thd2; [L740] 0 _Bool x$r_buff0_thd3; [L741] 0 _Bool x$r_buff1_thd0; [L742] 0 _Bool x$r_buff1_thd1; [L743] 0 _Bool x$r_buff1_thd2; [L744] 0 _Bool x$r_buff1_thd3; [L745] 0 _Bool x$read_delayed; [L746] 0 int *x$read_delayed_var; [L747] 0 int x$w_buff0; [L748] 0 _Bool x$w_buff0_used; [L749] 0 int x$w_buff1; [L750] 0 _Bool x$w_buff1_used; [L752] 0 int y = 0; [L753] 0 _Bool weak$$choice0; [L754] 0 _Bool weak$$choice1; [L755] 0 _Bool weak$$choice2; [L849] 0 pthread_t t2269; [L850] FCALL, FORK 0 pthread_create(&t2269, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2269, ((void *)0), P0, ((void *)0))=-1, t2269={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L851] 0 pthread_t t2270; [L852] FCALL, FORK 0 pthread_create(&t2270, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2270, ((void *)0), P1, ((void *)0))=0, t2269={7:0}, t2270={5:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L853] 0 pthread_t t2271; [L854] FCALL, FORK 0 pthread_create(&t2271, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2271, ((void *)0), P2, ((void *)0))=1, t2269={7:0}, t2270={5:0}, t2271={8:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L806] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L807] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L808] 3 x$flush_delayed = weak$$choice2 [L809] EXPR 3 \read(x) [L809] 3 x$mem_tmp = x [L810] EXPR 3 !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff1) [L810] EXPR 3 \read(x) [L810] EXPR 3 !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff1) [L810] 3 x = !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff1) [L811] 3 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff0)) [L812] 3 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff1 : x$w_buff1)) [L813] 3 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used)) [L814] 3 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L815] 3 x$r_buff0_thd3 = weak$$choice2 ? x$r_buff0_thd3 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3)) [L816] 3 x$r_buff1_thd3 = weak$$choice2 ? x$r_buff1_thd3 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$r_buff1_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L817] 3 __unbuffered_p2_EAX$read_delayed = (_Bool)1 [L818] 3 __unbuffered_p2_EAX$read_delayed_var = &x [L819] EXPR 3 \read(x) [L819] 3 __unbuffered_p2_EAX = x [L820] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L820] 3 x = x$flush_delayed ? x$mem_tmp : x [L821] 3 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L824] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L827] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L827] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L827] EXPR 3 \read(x) [L827] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L827] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L827] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L828] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L829] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L830] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L831] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L759] 1 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=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$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L764] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L765] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L766] 1 x$flush_delayed = weak$$choice2 [L767] EXPR 1 \read(x) [L767] 1 x$mem_tmp = x [L768] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L768] EXPR 1 \read(x) [L768] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L768] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L769] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L770] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L771] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L772] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L773] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L774] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L775] EXPR 1 \read(x) [L775] 1 __unbuffered_p0_EAX = x [L776] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L776] 1 x = x$flush_delayed ? x$mem_tmp : x [L777] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=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$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L789] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L792] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L792] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L792] EXPR 2 \read(x) [L792] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L792] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L792] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L793] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L794] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L795] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L796] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L799] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L801] 2 return 0; [L834] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L836] 3 return 0; [L782] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L784] 1 return 0; [L856] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L858] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) VAL [\old(cond)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L858] RET 0 assume_abort_if_not(main$tmp_guard0) [L860] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L860] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L860] EXPR 0 \read(x) [L860] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L860] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L860] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L861] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L862] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L863] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L864] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2269={7:0}, t2270={5:0}, t2271={8:0}, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L867] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L868] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L868] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L868] EXPR 0 \read(*__unbuffered_p2_EAX$read_delayed_var) [L868] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L868] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L868] 0 __unbuffered_p2_EAX = __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L869] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 1) [L871] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] - UnprovableResult [Line: 852]: 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: 850]: 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: 854]: 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, 147 locations, 4 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: 17.9s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 3.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 192 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 192 mSDsluCounter, 5 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2 mSDsCounter, 69 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1036 IncrementalHoareTripleChecker+Invalid, 1105 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 69 mSolverCounterUnsat, 3 mSDtfsCounter, 1036 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 69 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=153occurred in iteration=6, InterpolantAutomatonStates: 61, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 8.4s InterpolantComputationTime, 208 NumberOfCodeBlocks, 208 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 176 ConstructedInterpolants, 0 QuantifiedInterpolants, 2533 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-08-23 23:10:51,485 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...