/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf --traceabstraction.order.of.the.error.locations.to.be.checked INSUFFICIENT_FIRST -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix020.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-24 05:25:23,841 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-24 05:25:23,924 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-08-24 05:25:23,928 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-24 05:25:23,929 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-24 05:25:23,951 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-24 05:25:23,952 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-24 05:25:23,952 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-24 05:25:23,953 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-24 05:25:23,957 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-24 05:25:23,957 INFO L153 SettingsManager]: * Use SBE=true [2023-08-24 05:25:23,957 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-24 05:25:23,957 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-24 05:25:23,959 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-24 05:25:23,959 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-24 05:25:23,959 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-24 05:25:23,959 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-24 05:25:23,960 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-24 05:25:23,960 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-24 05:25:23,960 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-24 05:25:23,960 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-24 05:25:23,961 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-24 05:25:23,961 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-24 05:25:23,961 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-24 05:25:23,962 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-24 05:25:23,962 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-24 05:25:23,962 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-24 05:25:23,962 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-24 05:25:23,963 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-24 05:25:23,963 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-24 05:25:23,964 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-24 05:25:23,964 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-24 05:25:23,964 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-24 05:25:23,964 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-24 05:25:23,964 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-24 05:25:23,964 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Order of the error locations to be checked -> INSUFFICIENT_FIRST [2023-08-24 05:25:24,297 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-24 05:25:24,319 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-24 05:25:24,321 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-24 05:25:24,322 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-24 05:25:24,323 INFO L274 PluginConnector]: CDTParser initialized [2023-08-24 05:25:24,325 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix020.opt.i [2023-08-24 05:25:25,619 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-24 05:25:25,925 INFO L384 CDTParser]: Found 1 translation units. [2023-08-24 05:25:25,926 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix020.opt.i [2023-08-24 05:25:25,953 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c2a24e869/e1f0aca3bd7d4e4f94e46b1db10bfcc7/FLAG5e2ecdbac [2023-08-24 05:25:25,968 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c2a24e869/e1f0aca3bd7d4e4f94e46b1db10bfcc7 [2023-08-24 05:25:25,973 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-24 05:25:25,974 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-24 05:25:25,978 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-24 05:25:25,978 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-24 05:25:25,981 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-24 05:25:25,982 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.08 05:25:25" (1/1) ... [2023-08-24 05:25:25,984 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c669fa7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:25:25, skipping insertion in model container [2023-08-24 05:25:25,984 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.08 05:25:25" (1/1) ... [2023-08-24 05:25:26,037 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-24 05:25:26,200 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/mix020.opt.i[944,957] [2023-08-24 05:25:26,427 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-24 05:25:26,439 INFO L201 MainTranslator]: Completed pre-run [2023-08-24 05:25:26,453 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/mix020.opt.i[944,957] [2023-08-24 05:25:26,461 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-24 05:25:26,463 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-24 05:25:26,491 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-24 05:25:26,516 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-24 05:25:26,516 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-24 05:25:26,522 INFO L206 MainTranslator]: Completed translation [2023-08-24 05:25:26,523 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:25:26 WrapperNode [2023-08-24 05:25:26,523 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-24 05:25:26,524 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-24 05:25:26,524 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-24 05:25:26,524 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-24 05:25:26,530 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:25:26" (1/1) ... [2023-08-24 05:25:26,545 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:25:26" (1/1) ... [2023-08-24 05:25:26,570 INFO L138 Inliner]: procedures = 177, calls = 69, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 165 [2023-08-24 05:25:26,570 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-24 05:25:26,571 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-24 05:25:26,571 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-24 05:25:26,571 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-24 05:25:26,578 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:25:26" (1/1) ... [2023-08-24 05:25:26,579 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:25:26" (1/1) ... [2023-08-24 05:25:26,582 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:25:26" (1/1) ... [2023-08-24 05:25:26,582 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:25:26" (1/1) ... [2023-08-24 05:25:26,590 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:25:26" (1/1) ... [2023-08-24 05:25:26,592 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:25:26" (1/1) ... [2023-08-24 05:25:26,594 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:25:26" (1/1) ... [2023-08-24 05:25:26,596 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:25:26" (1/1) ... [2023-08-24 05:25:26,600 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-24 05:25:26,600 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-24 05:25:26,601 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-24 05:25:26,601 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-24 05:25:26,604 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:25:26" (1/1) ... [2023-08-24 05:25:26,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-24 05:25:26,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 05:25:26,647 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-24 05:25:26,649 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-24 05:25:26,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-24 05:25:26,673 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-24 05:25:26,673 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-24 05:25:26,673 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-24 05:25:26,673 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-24 05:25:26,674 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-24 05:25:26,674 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-24 05:25:26,674 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-24 05:25:26,674 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-24 05:25:26,674 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-24 05:25:26,674 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-24 05:25:26,674 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-24 05:25:26,674 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-24 05:25:26,674 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-24 05:25:26,675 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-24 05:25:26,675 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-24 05:25:26,675 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-24 05:25:26,676 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-24 05:25:26,818 INFO L236 CfgBuilder]: Building ICFG [2023-08-24 05:25:26,820 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-24 05:25:27,209 INFO L277 CfgBuilder]: Performing block encoding [2023-08-24 05:25:27,294 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-24 05:25:27,294 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-24 05:25:27,297 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.08 05:25:27 BoogieIcfgContainer [2023-08-24 05:25:27,297 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-24 05:25:27,299 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-24 05:25:27,299 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-24 05:25:27,301 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-24 05:25:27,302 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.08 05:25:25" (1/3) ... [2023-08-24 05:25:27,302 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@181187c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.08 05:25:27, skipping insertion in model container [2023-08-24 05:25:27,302 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:25:26" (2/3) ... [2023-08-24 05:25:27,303 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@181187c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.08 05:25:27, skipping insertion in model container [2023-08-24 05:25:27,303 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.08 05:25:27" (3/3) ... [2023-08-24 05:25:27,304 INFO L112 eAbstractionObserver]: Analyzing ICFG mix020.opt.i [2023-08-24 05:25:27,319 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-24 05:25:27,319 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-24 05:25:27,319 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-24 05:25:27,366 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-24 05:25:27,395 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 139 places, 128 transitions, 276 flow [2023-08-24 05:25:27,467 INFO L124 PetriNetUnfolderBase]: 2/124 cut-off events. [2023-08-24 05:25:27,468 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 05:25:27,474 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 124 events. 2/124 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 64 event pairs, 0 based on Foata normal form. 0/120 useless extension candidates. Maximal degree in co-relation 85. Up to 2 conditions per place. [2023-08-24 05:25:27,474 INFO L82 GeneralOperation]: Start removeDead. Operand has 139 places, 128 transitions, 276 flow [2023-08-24 05:25:27,478 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 135 places, 124 transitions, 260 flow [2023-08-24 05:25:27,481 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-24 05:25:27,489 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 135 places, 124 transitions, 260 flow [2023-08-24 05:25:27,491 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 135 places, 124 transitions, 260 flow [2023-08-24 05:25:27,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 135 places, 124 transitions, 260 flow [2023-08-24 05:25:27,517 INFO L124 PetriNetUnfolderBase]: 2/124 cut-off events. [2023-08-24 05:25:27,517 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 05:25:27,518 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 124 events. 2/124 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 64 event pairs, 0 based on Foata normal form. 0/120 useless extension candidates. Maximal degree in co-relation 85. Up to 2 conditions per place. [2023-08-24 05:25:27,520 INFO L119 LiptonReduction]: Number of co-enabled transitions 2718 [2023-08-24 05:25:31,439 INFO L134 LiptonReduction]: Checked pairs total: 6842 [2023-08-24 05:25:31,439 INFO L136 LiptonReduction]: Total number of compositions: 107 [2023-08-24 05:25:31,451 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-24 05:25:31,460 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;@11ac1b22, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-24 05:25:31,460 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-08-24 05:25:31,465 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-24 05:25:31,467 INFO L124 PetriNetUnfolderBase]: 0/17 cut-off events. [2023-08-24 05:25:31,467 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 05:25:31,467 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:25:31,468 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:25:31,468 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 05:25:31,472 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:25:31,472 INFO L85 PathProgramCache]: Analyzing trace with hash 225750539, now seen corresponding path program 1 times [2023-08-24 05:25:31,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:25:31,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610306669] [2023-08-24 05:25:31,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:25:31,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:25:31,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:25:31,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-24 05:25:31,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:25:31,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610306669] [2023-08-24 05:25:31,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610306669] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:25:31,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:25:31,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-24 05:25:31,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046896572] [2023-08-24 05:25:31,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:25:31,922 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-24 05:25:31,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:25:31,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-24 05:25:31,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-24 05:25:31,958 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 235 [2023-08-24 05:25:31,962 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 29 transitions, 70 flow. Second operand has 3 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-24 05:25:31,962 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:25:31,963 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 235 [2023-08-24 05:25:31,964 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:25:32,551 INFO L124 PetriNetUnfolderBase]: 3113/4511 cut-off events. [2023-08-24 05:25:32,551 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2023-08-24 05:25:32,563 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8905 conditions, 4511 events. 3113/4511 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 248. Compared 24008 event pairs, 593 based on Foata normal form. 0/4327 useless extension candidates. Maximal degree in co-relation 8893. Up to 3385 conditions per place. [2023-08-24 05:25:32,586 INFO L140 encePairwiseOnDemand]: 231/235 looper letters, 32 selfloop transitions, 2 changer transitions 2/39 dead transitions. [2023-08-24 05:25:32,586 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 39 transitions, 162 flow [2023-08-24 05:25:32,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-24 05:25:32,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-24 05:25:32,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 381 transitions. [2023-08-24 05:25:32,602 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5404255319148936 [2023-08-24 05:25:32,603 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 381 transitions. [2023-08-24 05:25:32,604 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 381 transitions. [2023-08-24 05:25:32,606 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:25:32,608 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 381 transitions. [2023-08-24 05:25:32,613 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 127.0) internal successors, (381), 3 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:25:32,619 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 235.0) internal successors, (940), 4 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:25:32,620 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 235.0) internal successors, (940), 4 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:25:32,622 INFO L175 Difference]: Start difference. First operand has 41 places, 29 transitions, 70 flow. Second operand 3 states and 381 transitions. [2023-08-24 05:25:32,622 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 39 transitions, 162 flow [2023-08-24 05:25:32,627 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 39 transitions, 158 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-24 05:25:32,629 INFO L231 Difference]: Finished difference. Result has 38 places, 26 transitions, 64 flow [2023-08-24 05:25:32,631 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=64, PETRI_PLACES=38, PETRI_TRANSITIONS=26} [2023-08-24 05:25:32,634 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -3 predicate places. [2023-08-24 05:25:32,635 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 26 transitions, 64 flow [2023-08-24 05:25:32,635 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 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-24 05:25:32,635 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:25:32,635 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:25:32,636 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-24 05:25:32,636 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 05:25:32,637 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:25:32,638 INFO L85 PathProgramCache]: Analyzing trace with hash -582167020, now seen corresponding path program 1 times [2023-08-24 05:25:32,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:25:32,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961182681] [2023-08-24 05:25:32,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:25:32,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:25:32,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:25:32,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 05:25:32,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:25:32,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961182681] [2023-08-24 05:25:32,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961182681] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:25:32,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:25:32,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-24 05:25:32,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367023350] [2023-08-24 05:25:32,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:25:32,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 05:25:32,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:25:32,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 05:25:32,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-24 05:25:32,907 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 235 [2023-08-24 05:25:32,908 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 26 transitions, 64 flow. Second operand has 4 states, 4 states have (on average 112.0) internal successors, (448), 4 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:25:32,908 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:25:32,908 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 235 [2023-08-24 05:25:32,908 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:25:33,533 INFO L124 PetriNetUnfolderBase]: 3861/5382 cut-off events. [2023-08-24 05:25:33,533 INFO L125 PetriNetUnfolderBase]: For 270/270 co-relation queries the response was YES. [2023-08-24 05:25:33,541 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11158 conditions, 5382 events. 3861/5382 cut-off events. For 270/270 co-relation queries the response was YES. Maximal size of possible extension queue 274. Compared 26282 event pairs, 1179 based on Foata normal form. 240/5609 useless extension candidates. Maximal degree in co-relation 11148. Up to 4326 conditions per place. [2023-08-24 05:25:33,561 INFO L140 encePairwiseOnDemand]: 230/235 looper letters, 36 selfloop transitions, 3 changer transitions 22/63 dead transitions. [2023-08-24 05:25:33,561 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 63 transitions, 270 flow [2023-08-24 05:25:33,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 05:25:33,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 05:25:33,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 608 transitions. [2023-08-24 05:25:33,563 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5174468085106383 [2023-08-24 05:25:33,563 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 608 transitions. [2023-08-24 05:25:33,564 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 608 transitions. [2023-08-24 05:25:33,564 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:25:33,564 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 608 transitions. [2023-08-24 05:25:33,565 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 121.6) internal successors, (608), 5 states have internal predecessors, (608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:25:33,567 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 235.0) internal successors, (1410), 6 states have internal predecessors, (1410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:25:33,568 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 235.0) internal successors, (1410), 6 states have internal predecessors, (1410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:25:33,568 INFO L175 Difference]: Start difference. First operand has 38 places, 26 transitions, 64 flow. Second operand 5 states and 608 transitions. [2023-08-24 05:25:33,568 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 63 transitions, 270 flow [2023-08-24 05:25:33,570 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 63 transitions, 260 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-24 05:25:33,571 INFO L231 Difference]: Finished difference. Result has 42 places, 28 transitions, 87 flow [2023-08-24 05:25:33,571 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=87, PETRI_PLACES=42, PETRI_TRANSITIONS=28} [2023-08-24 05:25:33,572 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 1 predicate places. [2023-08-24 05:25:33,572 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 28 transitions, 87 flow [2023-08-24 05:25:33,572 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 112.0) internal successors, (448), 4 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:25:33,572 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:25:33,572 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:25:33,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-24 05:25:33,573 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 05:25:33,573 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:25:33,573 INFO L85 PathProgramCache]: Analyzing trace with hash -867302491, now seen corresponding path program 1 times [2023-08-24 05:25:33,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:25:33,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900078318] [2023-08-24 05:25:33,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:25:33,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:25:33,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:25:33,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 05:25:33,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:25:33,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900078318] [2023-08-24 05:25:33,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900078318] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:25:33,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:25:33,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 05:25:33,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638430536] [2023-08-24 05:25:33,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:25:33,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 05:25:33,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:25:33,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 05:25:33,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-24 05:25:33,725 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 235 [2023-08-24 05:25:33,726 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 28 transitions, 87 flow. Second operand has 5 states, 5 states have (on average 105.6) internal successors, (528), 5 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:25:33,726 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:25:33,726 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 235 [2023-08-24 05:25:33,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:25:34,693 INFO L124 PetriNetUnfolderBase]: 7307/10116 cut-off events. [2023-08-24 05:25:34,693 INFO L125 PetriNetUnfolderBase]: For 3693/3693 co-relation queries the response was YES. [2023-08-24 05:25:34,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23625 conditions, 10116 events. 7307/10116 cut-off events. For 3693/3693 co-relation queries the response was YES. Maximal size of possible extension queue 361. Compared 48333 event pairs, 1511 based on Foata normal form. 464/10580 useless extension candidates. Maximal degree in co-relation 23612. Up to 5025 conditions per place. [2023-08-24 05:25:34,744 INFO L140 encePairwiseOnDemand]: 226/235 looper letters, 46 selfloop transitions, 8 changer transitions 35/89 dead transitions. [2023-08-24 05:25:34,744 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 89 transitions, 433 flow [2023-08-24 05:25:34,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-24 05:25:34,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-24 05:25:34,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 809 transitions. [2023-08-24 05:25:34,747 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4917933130699088 [2023-08-24 05:25:34,747 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 809 transitions. [2023-08-24 05:25:34,747 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 809 transitions. [2023-08-24 05:25:34,748 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:25:34,748 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 809 transitions. [2023-08-24 05:25:34,749 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 115.57142857142857) internal successors, (809), 7 states have internal predecessors, (809), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:25:34,752 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 235.0) internal successors, (1880), 8 states have internal predecessors, (1880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:25:34,753 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 235.0) internal successors, (1880), 8 states have internal predecessors, (1880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:25:34,753 INFO L175 Difference]: Start difference. First operand has 42 places, 28 transitions, 87 flow. Second operand 7 states and 809 transitions. [2023-08-24 05:25:34,753 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 89 transitions, 433 flow [2023-08-24 05:25:34,793 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 89 transitions, 424 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-08-24 05:25:34,794 INFO L231 Difference]: Finished difference. Result has 50 places, 34 transitions, 168 flow [2023-08-24 05:25:34,795 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=168, PETRI_PLACES=50, PETRI_TRANSITIONS=34} [2023-08-24 05:25:34,795 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 9 predicate places. [2023-08-24 05:25:34,795 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 34 transitions, 168 flow [2023-08-24 05:25:34,796 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 105.6) internal successors, (528), 5 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:25:34,796 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:25:34,796 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:25:34,796 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-24 05:25:34,796 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 05:25:34,797 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:25:34,797 INFO L85 PathProgramCache]: Analyzing trace with hash -1617244964, now seen corresponding path program 1 times [2023-08-24 05:25:34,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:25:34,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437844214] [2023-08-24 05:25:34,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:25:34,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:25:34,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:25:34,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 05:25:34,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:25:34,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437844214] [2023-08-24 05:25:34,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437844214] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:25:34,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:25:34,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 05:25:34,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154195336] [2023-08-24 05:25:34,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:25:34,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 05:25:34,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:25:34,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 05:25:34,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-24 05:25:34,997 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 235 [2023-08-24 05:25:34,998 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 34 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 110.75) internal successors, (443), 4 states have internal predecessors, (443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:25:34,998 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:25:34,998 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 235 [2023-08-24 05:25:34,998 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:25:35,660 INFO L124 PetriNetUnfolderBase]: 4117/6083 cut-off events. [2023-08-24 05:25:35,661 INFO L125 PetriNetUnfolderBase]: For 8307/8727 co-relation queries the response was YES. [2023-08-24 05:25:35,681 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17252 conditions, 6083 events. 4117/6083 cut-off events. For 8307/8727 co-relation queries the response was YES. Maximal size of possible extension queue 367. Compared 33556 event pairs, 1001 based on Foata normal form. 426/6257 useless extension candidates. Maximal degree in co-relation 17233. Up to 4196 conditions per place. [2023-08-24 05:25:35,708 INFO L140 encePairwiseOnDemand]: 228/235 looper letters, 65 selfloop transitions, 10 changer transitions 0/83 dead transitions. [2023-08-24 05:25:35,708 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 83 transitions, 512 flow [2023-08-24 05:25:35,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 05:25:35,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 05:25:35,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 600 transitions. [2023-08-24 05:25:35,711 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5106382978723404 [2023-08-24 05:25:35,711 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 600 transitions. [2023-08-24 05:25:35,711 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 600 transitions. [2023-08-24 05:25:35,711 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:25:35,711 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 600 transitions. [2023-08-24 05:25:35,713 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 120.0) internal successors, (600), 5 states have internal predecessors, (600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:25:35,714 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 235.0) internal successors, (1410), 6 states have internal predecessors, (1410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:25:35,715 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 235.0) internal successors, (1410), 6 states have internal predecessors, (1410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:25:35,715 INFO L175 Difference]: Start difference. First operand has 50 places, 34 transitions, 168 flow. Second operand 5 states and 600 transitions. [2023-08-24 05:25:35,715 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 83 transitions, 512 flow [2023-08-24 05:25:35,740 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 83 transitions, 493 flow, removed 7 selfloop flow, removed 3 redundant places. [2023-08-24 05:25:35,742 INFO L231 Difference]: Finished difference. Result has 51 places, 43 transitions, 233 flow [2023-08-24 05:25:35,742 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=233, PETRI_PLACES=51, PETRI_TRANSITIONS=43} [2023-08-24 05:25:35,742 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 10 predicate places. [2023-08-24 05:25:35,743 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 43 transitions, 233 flow [2023-08-24 05:25:35,743 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 110.75) internal successors, (443), 4 states have internal predecessors, (443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:25:35,743 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:25:35,743 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:25:35,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-24 05:25:35,744 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 05:25:35,744 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:25:35,744 INFO L85 PathProgramCache]: Analyzing trace with hash 1938243747, now seen corresponding path program 1 times [2023-08-24 05:25:35,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:25:35,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478841940] [2023-08-24 05:25:35,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:25:35,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:25:35,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:25:35,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 05:25:35,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:25:35,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478841940] [2023-08-24 05:25:35,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478841940] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:25:35,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:25:35,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 05:25:35,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191151147] [2023-08-24 05:25:35,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:25:35,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 05:25:35,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:25:35,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 05:25:35,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-24 05:25:35,956 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 235 [2023-08-24 05:25:35,957 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 43 transitions, 233 flow. Second operand has 4 states, 4 states have (on average 113.25) internal successors, (453), 4 states have internal predecessors, (453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:25:35,957 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:25:35,957 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 235 [2023-08-24 05:25:35,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:25:36,794 INFO L124 PetriNetUnfolderBase]: 6030/8964 cut-off events. [2023-08-24 05:25:36,794 INFO L125 PetriNetUnfolderBase]: For 15312/15761 co-relation queries the response was YES. [2023-08-24 05:25:36,833 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32540 conditions, 8964 events. 6030/8964 cut-off events. For 15312/15761 co-relation queries the response was YES. Maximal size of possible extension queue 462. Compared 52324 event pairs, 2591 based on Foata normal form. 170/8783 useless extension candidates. Maximal degree in co-relation 32519. Up to 4230 conditions per place. [2023-08-24 05:25:36,861 INFO L140 encePairwiseOnDemand]: 231/235 looper letters, 53 selfloop transitions, 5 changer transitions 22/84 dead transitions. [2023-08-24 05:25:36,861 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 84 transitions, 598 flow [2023-08-24 05:25:36,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 05:25:36,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 05:25:36,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 604 transitions. [2023-08-24 05:25:36,863 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5140425531914894 [2023-08-24 05:25:36,863 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 604 transitions. [2023-08-24 05:25:36,863 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 604 transitions. [2023-08-24 05:25:36,863 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:25:36,863 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 604 transitions. [2023-08-24 05:25:36,865 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 120.8) internal successors, (604), 5 states have internal predecessors, (604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:25:36,866 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 235.0) internal successors, (1410), 6 states have internal predecessors, (1410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:25:36,867 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 235.0) internal successors, (1410), 6 states have internal predecessors, (1410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:25:36,867 INFO L175 Difference]: Start difference. First operand has 51 places, 43 transitions, 233 flow. Second operand 5 states and 604 transitions. [2023-08-24 05:25:36,867 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 84 transitions, 598 flow [2023-08-24 05:25:36,878 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 84 transitions, 583 flow, removed 3 selfloop flow, removed 1 redundant places. [2023-08-24 05:25:36,880 INFO L231 Difference]: Finished difference. Result has 57 places, 41 transitions, 231 flow [2023-08-24 05:25:36,880 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=231, PETRI_PLACES=57, PETRI_TRANSITIONS=41} [2023-08-24 05:25:36,883 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 16 predicate places. [2023-08-24 05:25:36,883 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 41 transitions, 231 flow [2023-08-24 05:25:36,883 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 113.25) internal successors, (453), 4 states have internal predecessors, (453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:25:36,883 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:25:36,884 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:25:36,884 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-24 05:25:36,884 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 05:25:36,884 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:25:36,884 INFO L85 PathProgramCache]: Analyzing trace with hash -1174298998, now seen corresponding path program 1 times [2023-08-24 05:25:36,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:25:36,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450180231] [2023-08-24 05:25:36,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:25:36,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:25:36,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:25:37,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 05:25:37,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:25:37,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450180231] [2023-08-24 05:25:37,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450180231] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:25:37,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:25:37,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-24 05:25:37,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825047901] [2023-08-24 05:25:37,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:25:37,136 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 05:25:37,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:25:37,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 05:25:37,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-24 05:25:37,138 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 235 [2023-08-24 05:25:37,138 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 41 transitions, 231 flow. Second operand has 5 states, 5 states have (on average 110.4) internal successors, (552), 5 states have internal predecessors, (552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:25:37,138 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:25:37,139 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 235 [2023-08-24 05:25:37,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:25:37,787 INFO L124 PetriNetUnfolderBase]: 3409/5330 cut-off events. [2023-08-24 05:25:37,787 INFO L125 PetriNetUnfolderBase]: For 8508/9172 co-relation queries the response was YES. [2023-08-24 05:25:37,804 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18980 conditions, 5330 events. 3409/5330 cut-off events. For 8508/9172 co-relation queries the response was YES. Maximal size of possible extension queue 352. Compared 32112 event pairs, 441 based on Foata normal form. 553/5680 useless extension candidates. Maximal degree in co-relation 18956. Up to 2208 conditions per place. [2023-08-24 05:25:37,817 INFO L140 encePairwiseOnDemand]: 228/235 looper letters, 88 selfloop transitions, 18 changer transitions 1/114 dead transitions. [2023-08-24 05:25:37,817 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 114 transitions, 796 flow [2023-08-24 05:25:37,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-24 05:25:37,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-24 05:25:37,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 840 transitions. [2023-08-24 05:25:37,820 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5106382978723404 [2023-08-24 05:25:37,820 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 840 transitions. [2023-08-24 05:25:37,820 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 840 transitions. [2023-08-24 05:25:37,820 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:25:37,820 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 840 transitions. [2023-08-24 05:25:37,822 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 120.0) internal successors, (840), 7 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:25:37,824 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 235.0) internal successors, (1880), 8 states have internal predecessors, (1880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:25:37,825 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 235.0) internal successors, (1880), 8 states have internal predecessors, (1880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:25:37,825 INFO L175 Difference]: Start difference. First operand has 57 places, 41 transitions, 231 flow. Second operand 7 states and 840 transitions. [2023-08-24 05:25:37,825 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 114 transitions, 796 flow [2023-08-24 05:25:37,840 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 114 transitions, 765 flow, removed 8 selfloop flow, removed 3 redundant places. [2023-08-24 05:25:37,841 INFO L231 Difference]: Finished difference. Result has 61 places, 50 transitions, 351 flow [2023-08-24 05:25:37,842 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=351, PETRI_PLACES=61, PETRI_TRANSITIONS=50} [2023-08-24 05:25:37,842 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 20 predicate places. [2023-08-24 05:25:37,842 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 50 transitions, 351 flow [2023-08-24 05:25:37,843 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 110.4) internal successors, (552), 5 states have internal predecessors, (552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:25:37,843 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:25:37,843 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-24 05:25:37,843 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-24 05:25:37,843 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 05:25:37,843 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:25:37,844 INFO L85 PathProgramCache]: Analyzing trace with hash 457778757, now seen corresponding path program 1 times [2023-08-24 05:25:37,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:25:37,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137036710] [2023-08-24 05:25:37,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:25:37,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:25:37,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:25:38,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 05:25:38,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:25:38,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137036710] [2023-08-24 05:25:38,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137036710] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:25:38,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:25:38,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-24 05:25:38,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390462338] [2023-08-24 05:25:38,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:25:38,046 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-24 05:25:38,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:25:38,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-24 05:25:38,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-24 05:25:38,048 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 235 [2023-08-24 05:25:38,049 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 50 transitions, 351 flow. Second operand has 6 states, 6 states have (on average 110.16666666666667) internal successors, (661), 6 states have internal predecessors, (661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:25:38,049 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:25:38,049 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 235 [2023-08-24 05:25:38,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:25:38,688 INFO L124 PetriNetUnfolderBase]: 2955/4649 cut-off events. [2023-08-24 05:25:38,688 INFO L125 PetriNetUnfolderBase]: For 11060/11992 co-relation queries the response was YES. [2023-08-24 05:25:38,704 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19575 conditions, 4649 events. 2955/4649 cut-off events. For 11060/11992 co-relation queries the response was YES. Maximal size of possible extension queue 346. Compared 28049 event pairs, 272 based on Foata normal form. 439/4897 useless extension candidates. Maximal degree in co-relation 19549. Up to 2010 conditions per place. [2023-08-24 05:25:38,716 INFO L140 encePairwiseOnDemand]: 228/235 looper letters, 95 selfloop transitions, 27 changer transitions 14/143 dead transitions. [2023-08-24 05:25:38,717 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 143 transitions, 1092 flow [2023-08-24 05:25:38,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-24 05:25:38,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-24 05:25:38,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1079 transitions. [2023-08-24 05:25:38,720 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5101654846335697 [2023-08-24 05:25:38,720 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1079 transitions. [2023-08-24 05:25:38,720 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1079 transitions. [2023-08-24 05:25:38,721 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:25:38,721 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1079 transitions. [2023-08-24 05:25:38,723 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 119.88888888888889) internal successors, (1079), 9 states have internal predecessors, (1079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:25:38,726 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 235.0) internal successors, (2350), 10 states have internal predecessors, (2350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:25:38,726 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 235.0) internal successors, (2350), 10 states have internal predecessors, (2350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:25:38,727 INFO L175 Difference]: Start difference. First operand has 61 places, 50 transitions, 351 flow. Second operand 9 states and 1079 transitions. [2023-08-24 05:25:38,727 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 143 transitions, 1092 flow [2023-08-24 05:25:38,875 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 143 transitions, 1043 flow, removed 17 selfloop flow, removed 3 redundant places. [2023-08-24 05:25:38,878 INFO L231 Difference]: Finished difference. Result has 69 places, 59 transitions, 478 flow [2023-08-24 05:25:38,878 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=302, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=478, PETRI_PLACES=69, PETRI_TRANSITIONS=59} [2023-08-24 05:25:38,879 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 28 predicate places. [2023-08-24 05:25:38,879 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 59 transitions, 478 flow [2023-08-24 05:25:38,880 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 110.16666666666667) internal successors, (661), 6 states have internal predecessors, (661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:25:38,880 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:25:38,880 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:25:38,880 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-24 05:25:38,880 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 05:25:38,880 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:25:38,881 INFO L85 PathProgramCache]: Analyzing trace with hash 25313683, now seen corresponding path program 1 times [2023-08-24 05:25:38,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:25:38,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192776360] [2023-08-24 05:25:38,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:25:38,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:25:38,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:25:39,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 05:25:39,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:25:39,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192776360] [2023-08-24 05:25:39,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192776360] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:25:39,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:25:39,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-24 05:25:39,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862260465] [2023-08-24 05:25:39,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:25:39,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 05:25:39,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:25:39,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 05:25:39,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-24 05:25:39,106 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 235 [2023-08-24 05:25:39,107 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 59 transitions, 478 flow. Second operand has 5 states, 5 states have (on average 112.4) internal successors, (562), 5 states have internal predecessors, (562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:25:39,107 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:25:39,107 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 235 [2023-08-24 05:25:39,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:25:39,900 INFO L124 PetriNetUnfolderBase]: 4457/7241 cut-off events. [2023-08-24 05:25:39,900 INFO L125 PetriNetUnfolderBase]: For 27157/27341 co-relation queries the response was YES. [2023-08-24 05:25:39,918 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31873 conditions, 7241 events. 4457/7241 cut-off events. For 27157/27341 co-relation queries the response was YES. Maximal size of possible extension queue 478. Compared 48012 event pairs, 906 based on Foata normal form. 20/7116 useless extension candidates. Maximal degree in co-relation 31844. Up to 3799 conditions per place. [2023-08-24 05:25:39,930 INFO L140 encePairwiseOnDemand]: 231/235 looper letters, 70 selfloop transitions, 2 changer transitions 69/146 dead transitions. [2023-08-24 05:25:39,930 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 146 transitions, 1491 flow [2023-08-24 05:25:39,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 05:25:39,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 05:25:39,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 606 transitions. [2023-08-24 05:25:39,933 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5157446808510638 [2023-08-24 05:25:39,934 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 606 transitions. [2023-08-24 05:25:39,934 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 606 transitions. [2023-08-24 05:25:39,934 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:25:39,934 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 606 transitions. [2023-08-24 05:25:39,935 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 121.2) internal successors, (606), 5 states have internal predecessors, (606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:25:39,937 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 235.0) internal successors, (1410), 6 states have internal predecessors, (1410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:25:39,937 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 235.0) internal successors, (1410), 6 states have internal predecessors, (1410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:25:39,938 INFO L175 Difference]: Start difference. First operand has 69 places, 59 transitions, 478 flow. Second operand 5 states and 606 transitions. [2023-08-24 05:25:39,938 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 146 transitions, 1491 flow [2023-08-24 05:25:40,335 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 146 transitions, 1230 flow, removed 94 selfloop flow, removed 4 redundant places. [2023-08-24 05:25:40,337 INFO L231 Difference]: Finished difference. Result has 72 places, 51 transitions, 338 flow [2023-08-24 05:25:40,337 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=383, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=338, PETRI_PLACES=72, PETRI_TRANSITIONS=51} [2023-08-24 05:25:40,338 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 31 predicate places. [2023-08-24 05:25:40,338 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 51 transitions, 338 flow [2023-08-24 05:25:40,338 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 112.4) internal successors, (562), 5 states have internal predecessors, (562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:25:40,338 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:25:40,338 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:25:40,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-24 05:25:40,339 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 05:25:40,339 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:25:40,339 INFO L85 PathProgramCache]: Analyzing trace with hash 91784391, now seen corresponding path program 2 times [2023-08-24 05:25:40,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:25:40,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217862218] [2023-08-24 05:25:40,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:25:40,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:25:40,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:25:40,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 05:25:40,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:25:40,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217862218] [2023-08-24 05:25:40,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217862218] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:25:40,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:25:40,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-24 05:25:40,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859640396] [2023-08-24 05:25:40,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:25:40,595 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-24 05:25:40,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:25:40,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-24 05:25:40,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-08-24 05:25:40,597 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 235 [2023-08-24 05:25:40,599 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 51 transitions, 338 flow. Second operand has 7 states, 7 states have (on average 110.0) internal successors, (770), 7 states have internal predecessors, (770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:25:40,599 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:25:40,599 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 235 [2023-08-24 05:25:40,599 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:25:41,251 INFO L124 PetriNetUnfolderBase]: 2774/4611 cut-off events. [2023-08-24 05:25:41,251 INFO L125 PetriNetUnfolderBase]: For 9678/10180 co-relation queries the response was YES. [2023-08-24 05:25:41,263 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17023 conditions, 4611 events. 2774/4611 cut-off events. For 9678/10180 co-relation queries the response was YES. Maximal size of possible extension queue 368. Compared 30507 event pairs, 302 based on Foata normal form. 238/4616 useless extension candidates. Maximal degree in co-relation 16995. Up to 960 conditions per place. [2023-08-24 05:25:41,268 INFO L140 encePairwiseOnDemand]: 228/235 looper letters, 63 selfloop transitions, 22 changer transitions 46/136 dead transitions. [2023-08-24 05:25:41,268 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 136 transitions, 1016 flow [2023-08-24 05:25:41,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-24 05:25:41,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-24 05:25:41,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1286 transitions. [2023-08-24 05:25:41,271 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4974854932301741 [2023-08-24 05:25:41,271 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1286 transitions. [2023-08-24 05:25:41,271 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1286 transitions. [2023-08-24 05:25:41,272 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:25:41,272 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1286 transitions. [2023-08-24 05:25:41,274 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 116.9090909090909) internal successors, (1286), 11 states have internal predecessors, (1286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:25:41,278 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 235.0) internal successors, (2820), 12 states have internal predecessors, (2820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:25:41,278 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 235.0) internal successors, (2820), 12 states have internal predecessors, (2820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:25:41,278 INFO L175 Difference]: Start difference. First operand has 72 places, 51 transitions, 338 flow. Second operand 11 states and 1286 transitions. [2023-08-24 05:25:41,278 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 136 transitions, 1016 flow [2023-08-24 05:25:41,376 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 136 transitions, 985 flow, removed 7 selfloop flow, removed 5 redundant places. [2023-08-24 05:25:41,377 INFO L231 Difference]: Finished difference. Result has 78 places, 47 transitions, 347 flow [2023-08-24 05:25:41,378 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=321, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=347, PETRI_PLACES=78, PETRI_TRANSITIONS=47} [2023-08-24 05:25:41,379 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 37 predicate places. [2023-08-24 05:25:41,379 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 47 transitions, 347 flow [2023-08-24 05:25:41,379 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 110.0) internal successors, (770), 7 states have internal predecessors, (770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:25:41,379 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:25:41,379 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:25:41,380 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-24 05:25:41,380 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 05:25:41,380 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:25:41,380 INFO L85 PathProgramCache]: Analyzing trace with hash -4181155, now seen corresponding path program 1 times [2023-08-24 05:25:41,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:25:41,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402717971] [2023-08-24 05:25:41,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:25:41,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:25:41,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:25:41,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 05:25:41,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:25:41,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402717971] [2023-08-24 05:25:41,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402717971] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:25:41,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:25:41,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-24 05:25:41,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272117670] [2023-08-24 05:25:41,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:25:41,608 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 05:25:41,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:25:41,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 05:25:41,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-24 05:25:41,610 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 235 [2023-08-24 05:25:41,610 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 47 transitions, 347 flow. Second operand has 5 states, 5 states have (on average 106.2) internal successors, (531), 5 states have internal predecessors, (531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:25:41,610 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:25:41,610 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 235 [2023-08-24 05:25:41,610 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:25:41,967 INFO L124 PetriNetUnfolderBase]: 2205/3548 cut-off events. [2023-08-24 05:25:41,967 INFO L125 PetriNetUnfolderBase]: For 8958/8958 co-relation queries the response was YES. [2023-08-24 05:25:41,975 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14042 conditions, 3548 events. 2205/3548 cut-off events. For 8958/8958 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 19667 event pairs, 425 based on Foata normal form. 1/3549 useless extension candidates. Maximal degree in co-relation 14010. Up to 2024 conditions per place. [2023-08-24 05:25:41,978 INFO L140 encePairwiseOnDemand]: 225/235 looper letters, 64 selfloop transitions, 12 changer transitions 59/135 dead transitions. [2023-08-24 05:25:41,979 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 135 transitions, 1215 flow [2023-08-24 05:25:41,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-24 05:25:41,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-24 05:25:41,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 686 transitions. [2023-08-24 05:25:41,980 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48652482269503544 [2023-08-24 05:25:41,981 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 686 transitions. [2023-08-24 05:25:41,981 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 686 transitions. [2023-08-24 05:25:41,981 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:25:41,981 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 686 transitions. [2023-08-24 05:25:41,982 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 114.33333333333333) internal successors, (686), 6 states have internal predecessors, (686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:25:41,984 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 235.0) internal successors, (1645), 7 states have internal predecessors, (1645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:25:41,985 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 235.0) internal successors, (1645), 7 states have internal predecessors, (1645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:25:41,985 INFO L175 Difference]: Start difference. First operand has 78 places, 47 transitions, 347 flow. Second operand 6 states and 686 transitions. [2023-08-24 05:25:41,985 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 135 transitions, 1215 flow [2023-08-24 05:25:42,024 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 135 transitions, 949 flow, removed 65 selfloop flow, removed 14 redundant places. [2023-08-24 05:25:42,025 INFO L231 Difference]: Finished difference. Result has 70 places, 49 transitions, 306 flow [2023-08-24 05:25:42,025 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=238, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=306, PETRI_PLACES=70, PETRI_TRANSITIONS=49} [2023-08-24 05:25:42,026 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 29 predicate places. [2023-08-24 05:25:42,026 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 49 transitions, 306 flow [2023-08-24 05:25:42,026 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 106.2) internal successors, (531), 5 states have internal predecessors, (531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:25:42,026 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:25:42,026 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:25:42,026 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-24 05:25:42,026 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 05:25:42,027 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:25:42,027 INFO L85 PathProgramCache]: Analyzing trace with hash 926733379, now seen corresponding path program 2 times [2023-08-24 05:25:42,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:25:42,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211723152] [2023-08-24 05:25:42,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:25:42,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:25:42,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:25:42,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 05:25:42,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:25:42,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211723152] [2023-08-24 05:25:42,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211723152] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:25:42,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:25:42,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-24 05:25:42,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392400572] [2023-08-24 05:25:42,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:25:42,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 05:25:42,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:25:42,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 05:25:42,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-24 05:25:42,222 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 235 [2023-08-24 05:25:42,222 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 49 transitions, 306 flow. Second operand has 5 states, 5 states have (on average 112.8) internal successors, (564), 5 states have internal predecessors, (564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:25:42,223 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:25:42,223 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 235 [2023-08-24 05:25:42,223 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:25:42,462 INFO L124 PetriNetUnfolderBase]: 533/968 cut-off events. [2023-08-24 05:25:42,463 INFO L125 PetriNetUnfolderBase]: For 2225/2233 co-relation queries the response was YES. [2023-08-24 05:25:42,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3792 conditions, 968 events. 533/968 cut-off events. For 2225/2233 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 4492 event pairs, 129 based on Foata normal form. 6/966 useless extension candidates. Maximal degree in co-relation 3772. Up to 497 conditions per place. [2023-08-24 05:25:42,467 INFO L140 encePairwiseOnDemand]: 231/235 looper letters, 37 selfloop transitions, 1 changer transitions 43/83 dead transitions. [2023-08-24 05:25:42,467 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 83 transitions, 636 flow [2023-08-24 05:25:42,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 05:25:42,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 05:25:42,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 588 transitions. [2023-08-24 05:25:42,469 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5004255319148936 [2023-08-24 05:25:42,469 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 588 transitions. [2023-08-24 05:25:42,469 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 588 transitions. [2023-08-24 05:25:42,469 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:25:42,469 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 588 transitions. [2023-08-24 05:25:42,471 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 117.6) internal successors, (588), 5 states have internal predecessors, (588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:25:42,472 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 235.0) internal successors, (1410), 6 states have internal predecessors, (1410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:25:42,473 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 235.0) internal successors, (1410), 6 states have internal predecessors, (1410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:25:42,473 INFO L175 Difference]: Start difference. First operand has 70 places, 49 transitions, 306 flow. Second operand 5 states and 588 transitions. [2023-08-24 05:25:42,473 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 83 transitions, 636 flow [2023-08-24 05:25:42,480 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 83 transitions, 616 flow, removed 8 selfloop flow, removed 5 redundant places. [2023-08-24 05:25:42,482 INFO L231 Difference]: Finished difference. Result has 64 places, 38 transitions, 208 flow [2023-08-24 05:25:42,482 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=292, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=208, PETRI_PLACES=64, PETRI_TRANSITIONS=38} [2023-08-24 05:25:42,482 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 23 predicate places. [2023-08-24 05:25:42,482 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 38 transitions, 208 flow [2023-08-24 05:25:42,483 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 112.8) internal successors, (564), 5 states have internal predecessors, (564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:25:42,483 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:25:42,483 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:25:42,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-24 05:25:42,483 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 05:25:42,483 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:25:42,483 INFO L85 PathProgramCache]: Analyzing trace with hash 419359337, now seen corresponding path program 3 times [2023-08-24 05:25:42,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:25:42,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062335488] [2023-08-24 05:25:42,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:25:42,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:25:42,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:25:43,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 05:25:43,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:25:43,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062335488] [2023-08-24 05:25:43,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062335488] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:25:43,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:25:43,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-24 05:25:43,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441040270] [2023-08-24 05:25:43,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:25:43,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-24 05:25:43,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:25:43,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-24 05:25:43,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-08-24 05:25:43,454 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 235 [2023-08-24 05:25:43,455 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 38 transitions, 208 flow. Second operand has 8 states, 8 states have (on average 106.875) internal successors, (855), 8 states have internal predecessors, (855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:25:43,455 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:25:43,455 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 235 [2023-08-24 05:25:43,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:25:43,640 INFO L124 PetriNetUnfolderBase]: 152/316 cut-off events. [2023-08-24 05:25:43,640 INFO L125 PetriNetUnfolderBase]: For 756/756 co-relation queries the response was YES. [2023-08-24 05:25:43,641 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1246 conditions, 316 events. 152/316 cut-off events. For 756/756 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1243 event pairs, 22 based on Foata normal form. 1/315 useless extension candidates. Maximal degree in co-relation 1227. Up to 135 conditions per place. [2023-08-24 05:25:43,642 INFO L140 encePairwiseOnDemand]: 227/235 looper letters, 39 selfloop transitions, 5 changer transitions 25/72 dead transitions. [2023-08-24 05:25:43,642 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 72 transitions, 543 flow [2023-08-24 05:25:43,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-24 05:25:43,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-24 05:25:43,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 976 transitions. [2023-08-24 05:25:43,645 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4614657210401891 [2023-08-24 05:25:43,646 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 976 transitions. [2023-08-24 05:25:43,646 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 976 transitions. [2023-08-24 05:25:43,646 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:25:43,646 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 976 transitions. [2023-08-24 05:25:43,648 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 108.44444444444444) internal successors, (976), 9 states have internal predecessors, (976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:25:43,651 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 235.0) internal successors, (2350), 10 states have internal predecessors, (2350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:25:43,652 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 235.0) internal successors, (2350), 10 states have internal predecessors, (2350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:25:43,652 INFO L175 Difference]: Start difference. First operand has 64 places, 38 transitions, 208 flow. Second operand 9 states and 976 transitions. [2023-08-24 05:25:43,652 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 72 transitions, 543 flow [2023-08-24 05:25:43,654 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 72 transitions, 491 flow, removed 10 selfloop flow, removed 12 redundant places. [2023-08-24 05:25:43,655 INFO L231 Difference]: Finished difference. Result has 61 places, 38 transitions, 190 flow [2023-08-24 05:25:43,655 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=190, PETRI_PLACES=61, PETRI_TRANSITIONS=38} [2023-08-24 05:25:43,656 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 20 predicate places. [2023-08-24 05:25:43,656 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 38 transitions, 190 flow [2023-08-24 05:25:43,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 106.875) internal successors, (855), 8 states have internal predecessors, (855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:25:43,657 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:25:43,657 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:25:43,657 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-24 05:25:43,657 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 05:25:43,657 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:25:43,657 INFO L85 PathProgramCache]: Analyzing trace with hash 276038023, now seen corresponding path program 4 times [2023-08-24 05:25:43,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:25:43,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581005030] [2023-08-24 05:25:43,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:25:43,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:25:43,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-24 05:25:43,694 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-24 05:25:43,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-24 05:25:43,744 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-24 05:25:43,744 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-24 05:25:43,745 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2023-08-24 05:25:43,747 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2023-08-24 05:25:43,747 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2023-08-24 05:25:43,747 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2023-08-24 05:25:43,747 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2023-08-24 05:25:43,747 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2023-08-24 05:25:43,747 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2023-08-24 05:25:43,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-24 05:25:43,748 INFO L445 BasicCegarLoop]: Path program histogram: [4, 2, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:25:43,753 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-24 05:25:43,753 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-24 05:25:43,845 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.08 05:25:43 BasicIcfg [2023-08-24 05:25:43,845 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-24 05:25:43,846 INFO L158 Benchmark]: Toolchain (without parser) took 17871.88ms. Allocated memory was 333.4MB in the beginning and 908.1MB in the end (delta: 574.6MB). Free memory was 307.9MB in the beginning and 349.1MB in the end (delta: -41.2MB). Peak memory consumption was 535.4MB. Max. memory is 16.0GB. [2023-08-24 05:25:43,846 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 333.4MB. Free memory is still 310.8MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-24 05:25:43,846 INFO L158 Benchmark]: CACSL2BoogieTranslator took 545.62ms. Allocated memory is still 333.4MB. Free memory was 307.9MB in the beginning and 283.7MB in the end (delta: 24.2MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-24 05:25:43,846 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.03ms. Allocated memory is still 333.4MB. Free memory was 283.7MB in the beginning and 280.8MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-08-24 05:25:43,846 INFO L158 Benchmark]: Boogie Preprocessor took 29.09ms. Allocated memory is still 333.4MB. Free memory was 280.8MB in the beginning and 278.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-24 05:25:43,847 INFO L158 Benchmark]: RCFGBuilder took 696.38ms. Allocated memory is still 333.4MB. Free memory was 278.7MB in the beginning and 238.9MB in the end (delta: 39.8MB). Peak memory consumption was 39.8MB. Max. memory is 16.0GB. [2023-08-24 05:25:43,847 INFO L158 Benchmark]: TraceAbstraction took 16546.79ms. Allocated memory was 333.4MB in the beginning and 908.1MB in the end (delta: 574.6MB). Free memory was 238.1MB in the beginning and 349.1MB in the end (delta: -111.0MB). Peak memory consumption was 466.2MB. Max. memory is 16.0GB. [2023-08-24 05:25:43,848 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 333.4MB. Free memory is still 310.8MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 545.62ms. Allocated memory is still 333.4MB. Free memory was 307.9MB in the beginning and 283.7MB in the end (delta: 24.2MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 46.03ms. Allocated memory is still 333.4MB. Free memory was 283.7MB in the beginning and 280.8MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 29.09ms. Allocated memory is still 333.4MB. Free memory was 280.8MB in the beginning and 278.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 696.38ms. Allocated memory is still 333.4MB. Free memory was 278.7MB in the beginning and 238.9MB in the end (delta: 39.8MB). Peak memory consumption was 39.8MB. Max. memory is 16.0GB. * TraceAbstraction took 16546.79ms. Allocated memory was 333.4MB in the beginning and 908.1MB in the end (delta: 574.6MB). Free memory was 238.1MB in the beginning and 349.1MB in the end (delta: -111.0MB). Peak memory consumption was 466.2MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.9s, 135 PlacesBefore, 41 PlacesAfterwards, 124 TransitionsBefore, 29 TransitionsAfterwards, 2718 CoEnabledTransitionPairs, 7 FixpointIterations, 43 TrivialSequentialCompositions, 54 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 107 TotalNumberOfCompositions, 6842 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3154, independent: 2962, independent conditional: 0, independent unconditional: 2962, dependent: 192, dependent conditional: 0, dependent unconditional: 192, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1429, independent: 1399, independent conditional: 0, independent unconditional: 1399, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3154, independent: 1563, independent conditional: 0, independent unconditional: 1563, dependent: 162, dependent conditional: 0, dependent unconditional: 162, unknown: 1429, unknown conditional: 0, unknown unconditional: 1429] , Statistics on independence cache: Total cache size (in pairs): 132, Positive cache size: 114, Positive conditional cache size: 0, Positive unconditional cache size: 114, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L721] 0 _Bool main$tmp_guard0; [L722] 0 _Bool main$tmp_guard1; [L724] 0 int x = 0; [L726] 0 int y = 0; [L728] 0 int z = 0; [L729] 0 _Bool z$flush_delayed; [L730] 0 int z$mem_tmp; [L731] 0 _Bool z$r_buff0_thd0; [L732] 0 _Bool z$r_buff0_thd1; [L733] 0 _Bool z$r_buff0_thd2; [L734] 0 _Bool z$r_buff0_thd3; [L735] 0 _Bool z$r_buff0_thd4; [L736] 0 _Bool z$r_buff1_thd0; [L737] 0 _Bool z$r_buff1_thd1; [L738] 0 _Bool z$r_buff1_thd2; [L739] 0 _Bool z$r_buff1_thd3; [L740] 0 _Bool z$r_buff1_thd4; [L741] 0 _Bool z$read_delayed; [L742] 0 int *z$read_delayed_var; [L743] 0 int z$w_buff0; [L744] 0 _Bool z$w_buff0_used; [L745] 0 int z$w_buff1; [L746] 0 _Bool z$w_buff1_used; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L864] 0 pthread_t t525; [L865] FCALL, FORK 0 pthread_create(&t525, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t525, ((void *)0), P0, ((void *)0))=-2, t525={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L866] 0 pthread_t t526; [L867] FCALL, FORK 0 pthread_create(&t526, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t526, ((void *)0), P1, ((void *)0))=-1, t525={5:0}, t526={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L868] 0 pthread_t t527; [L869] FCALL, FORK 0 pthread_create(&t527, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t527, ((void *)0), P2, ((void *)0))=0, t525={5:0}, t526={6:0}, t527={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L870] 0 pthread_t t528; [L871] FCALL, FORK 0 pthread_create(&t528, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t528, ((void *)0), P3, ((void *)0))=1, t525={5:0}, t526={6:0}, t527={7:0}, t528={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L810] 4 z$w_buff1 = z$w_buff0 [L811] 4 z$w_buff0 = 1 [L812] 4 z$w_buff1_used = z$w_buff0_used [L813] 4 z$w_buff0_used = (_Bool)1 [L814] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L814] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L815] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L816] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L817] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L818] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L819] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L820] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L823] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L824] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L825] 4 z$flush_delayed = weak$$choice2 [L826] 4 z$mem_tmp = z [L827] 4 z = !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L828] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L829] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L830] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L831] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L832] 4 z$r_buff0_thd4 = weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4)) [L833] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L834] 4 __unbuffered_p3_EAX = z [L835] 4 z = z$flush_delayed ? z$mem_tmp : z [L836] 4 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L839] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L752] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L755] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L767] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L770] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L782] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L762] 1 return 0; [L785] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L786] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L787] 3 z$flush_delayed = weak$$choice2 [L788] 3 z$mem_tmp = z [L789] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L790] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L791] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L792] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L793] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L794] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L795] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L796] 3 __unbuffered_p2_EAX = z [L797] 3 z = z$flush_delayed ? z$mem_tmp : z [L798] 3 z$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L777] 2 return 0; [L842] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L843] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L844] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L845] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L846] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L849] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L851] 4 return 0; [L803] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L805] 3 return 0; [L873] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L875] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L875] RET 0 assume_abort_if_not(main$tmp_guard0) [L877] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L878] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L879] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L880] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L881] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t525={5:0}, t526={6:0}, t527={7:0}, t528={3:0}, weak$$choice2=1, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L884] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L886] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 865]: 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: 869]: 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: 867]: 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: 871]: 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 9 procedures, 162 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 16.4s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 8.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 447 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 447 mSDsluCounter, 34 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 16 mSDsCounter, 29 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1550 IncrementalHoareTripleChecker+Invalid, 1579 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 29 mSolverCounterUnsat, 18 mSDtfsCounter, 1550 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 68 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=478occurred in iteration=7, InterpolantAutomatonStates: 77, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 253 NumberOfCodeBlocks, 253 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 215 ConstructedInterpolants, 0 QuantifiedInterpolants, 1026 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-24 05:25:43,870 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...