/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/mix043.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-24 05:30:05,966 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-24 05:30:06,032 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:30:06,035 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-24 05:30:06,036 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-24 05:30:06,058 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-24 05:30:06,059 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-24 05:30:06,059 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-24 05:30:06,059 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-24 05:30:06,062 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-24 05:30:06,062 INFO L153 SettingsManager]: * Use SBE=true [2023-08-24 05:30:06,062 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-24 05:30:06,063 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-24 05:30:06,063 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-24 05:30:06,064 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-24 05:30:06,064 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-24 05:30:06,064 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-24 05:30:06,064 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-24 05:30:06,064 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-24 05:30:06,065 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-24 05:30:06,065 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-24 05:30:06,065 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-24 05:30:06,065 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-24 05:30:06,065 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-24 05:30:06,066 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-24 05:30:06,066 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-24 05:30:06,066 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-24 05:30:06,066 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-24 05:30:06,066 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-24 05:30:06,066 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-24 05:30:06,067 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-24 05:30:06,067 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-24 05:30:06,067 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-24 05:30:06,067 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-24 05:30:06,067 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-24 05:30:06,068 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:30:06,289 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-24 05:30:06,303 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-24 05:30:06,304 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-24 05:30:06,305 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-24 05:30:06,305 INFO L274 PluginConnector]: CDTParser initialized [2023-08-24 05:30:06,306 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix043.oepc.i [2023-08-24 05:30:07,199 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-24 05:30:07,400 INFO L384 CDTParser]: Found 1 translation units. [2023-08-24 05:30:07,401 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix043.oepc.i [2023-08-24 05:30:07,412 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0df248c33/5bae04b0fea242abbbac6cf6cd4afe17/FLAG4e67224cd [2023-08-24 05:30:07,420 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0df248c33/5bae04b0fea242abbbac6cf6cd4afe17 [2023-08-24 05:30:07,422 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-24 05:30:07,423 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-24 05:30:07,423 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-24 05:30:07,423 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-24 05:30:07,425 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-24 05:30:07,425 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.08 05:30:07" (1/1) ... [2023-08-24 05:30:07,426 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4dd274cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:30:07, skipping insertion in model container [2023-08-24 05:30:07,426 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.08 05:30:07" (1/1) ... [2023-08-24 05:30:07,457 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-24 05:30:07,554 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/mix043.oepc.i[945,958] [2023-08-24 05:30:07,683 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-24 05:30:07,691 INFO L201 MainTranslator]: Completed pre-run [2023-08-24 05:30:07,700 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/mix043.oepc.i[945,958] [2023-08-24 05:30:07,718 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-24 05:30:07,719 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-24 05:30:07,753 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-24 05:30:07,781 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-24 05:30:07,782 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-24 05:30:07,786 INFO L206 MainTranslator]: Completed translation [2023-08-24 05:30:07,786 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:30:07 WrapperNode [2023-08-24 05:30:07,787 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-24 05:30:07,787 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-24 05:30:07,787 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-24 05:30:07,788 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-24 05:30:07,792 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:30:07" (1/1) ... [2023-08-24 05:30:07,818 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:30:07" (1/1) ... [2023-08-24 05:30:07,848 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 146 [2023-08-24 05:30:07,849 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-24 05:30:07,850 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-24 05:30:07,850 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-24 05:30:07,850 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-24 05:30:07,856 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:30:07" (1/1) ... [2023-08-24 05:30:07,857 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:30:07" (1/1) ... [2023-08-24 05:30:07,867 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:30:07" (1/1) ... [2023-08-24 05:30:07,867 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:30:07" (1/1) ... [2023-08-24 05:30:07,878 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:30:07" (1/1) ... [2023-08-24 05:30:07,879 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:30:07" (1/1) ... [2023-08-24 05:30:07,880 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:30:07" (1/1) ... [2023-08-24 05:30:07,881 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:30:07" (1/1) ... [2023-08-24 05:30:07,883 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-24 05:30:07,884 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-24 05:30:07,884 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-24 05:30:07,884 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-24 05:30:07,884 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:30:07" (1/1) ... [2023-08-24 05:30:07,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-24 05:30:07,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 05:30:07,918 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-24 05:30:07,944 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-24 05:30:07,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-24 05:30:07,952 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-24 05:30:07,952 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-24 05:30:07,952 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-24 05:30:07,952 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-24 05:30:07,952 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-24 05:30:07,952 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-24 05:30:07,952 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-24 05:30:07,952 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-24 05:30:07,953 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-24 05:30:07,953 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-24 05:30:07,953 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-24 05:30:07,954 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-24 05:30:07,954 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-24 05:30:07,955 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-24 05:30:07,955 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-24 05:30:07,955 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-24 05:30:07,956 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-24 05:30:08,085 INFO L236 CfgBuilder]: Building ICFG [2023-08-24 05:30:08,087 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-24 05:30:08,341 INFO L277 CfgBuilder]: Performing block encoding [2023-08-24 05:30:08,462 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-24 05:30:08,462 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-24 05:30:08,464 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.08 05:30:08 BoogieIcfgContainer [2023-08-24 05:30:08,464 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-24 05:30:08,466 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-24 05:30:08,466 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-24 05:30:08,468 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-24 05:30:08,469 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.08 05:30:07" (1/3) ... [2023-08-24 05:30:08,469 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@286cef3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.08 05:30:08, skipping insertion in model container [2023-08-24 05:30:08,469 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:30:07" (2/3) ... [2023-08-24 05:30:08,470 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@286cef3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.08 05:30:08, skipping insertion in model container [2023-08-24 05:30:08,470 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.08 05:30:08" (3/3) ... [2023-08-24 05:30:08,471 INFO L112 eAbstractionObserver]: Analyzing ICFG mix043.oepc.i [2023-08-24 05:30:08,483 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-24 05:30:08,483 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-24 05:30:08,483 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-24 05:30:08,531 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-24 05:30:08,557 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 144 places, 133 transitions, 286 flow [2023-08-24 05:30:08,604 INFO L124 PetriNetUnfolderBase]: 2/129 cut-off events. [2023-08-24 05:30:08,604 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 05:30:08,607 INFO L83 FinitePrefix]: Finished finitePrefix Result has 142 conditions, 129 events. 2/129 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 75 event pairs, 0 based on Foata normal form. 0/125 useless extension candidates. Maximal degree in co-relation 89. Up to 2 conditions per place. [2023-08-24 05:30:08,608 INFO L82 GeneralOperation]: Start removeDead. Operand has 144 places, 133 transitions, 286 flow [2023-08-24 05:30:08,611 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 140 places, 129 transitions, 270 flow [2023-08-24 05:30:08,614 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-24 05:30:08,619 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 140 places, 129 transitions, 270 flow [2023-08-24 05:30:08,621 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 140 places, 129 transitions, 270 flow [2023-08-24 05:30:08,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 140 places, 129 transitions, 270 flow [2023-08-24 05:30:08,638 INFO L124 PetriNetUnfolderBase]: 2/129 cut-off events. [2023-08-24 05:30:08,638 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 05:30:08,638 INFO L83 FinitePrefix]: Finished finitePrefix Result has 142 conditions, 129 events. 2/129 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 75 event pairs, 0 based on Foata normal form. 0/125 useless extension candidates. Maximal degree in co-relation 89. Up to 2 conditions per place. [2023-08-24 05:30:08,640 INFO L119 LiptonReduction]: Number of co-enabled transitions 3270 [2023-08-24 05:30:11,903 INFO L134 LiptonReduction]: Checked pairs total: 8894 [2023-08-24 05:30:11,903 INFO L136 LiptonReduction]: Total number of compositions: 109 [2023-08-24 05:30:11,911 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-24 05:30:11,915 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;@2586c069, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-24 05:30:11,915 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-08-24 05:30:11,917 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-24 05:30:11,917 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-08-24 05:30:11,917 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 05:30:11,918 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:30:11,918 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-24 05:30:11,918 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 05:30:11,921 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:30:11,921 INFO L85 PathProgramCache]: Analyzing trace with hash 553531, now seen corresponding path program 1 times [2023-08-24 05:30:11,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:30:11,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36178308] [2023-08-24 05:30:11,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:30:11,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:30:11,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:30:12,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 05:30:12,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:30:12,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36178308] [2023-08-24 05:30:12,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36178308] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:30:12,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:30:12,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-24 05:30:12,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029001128] [2023-08-24 05:30:12,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:30:12,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-24 05:30:12,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:30:12,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-24 05:30:12,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-24 05:30:12,212 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 242 [2023-08-24 05:30:12,214 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 31 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 118.0) internal successors, (354), 3 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:30:12,214 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:30:12,214 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 242 [2023-08-24 05:30:12,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:30:13,056 INFO L124 PetriNetUnfolderBase]: 5879/8109 cut-off events. [2023-08-24 05:30:13,056 INFO L125 PetriNetUnfolderBase]: For 77/77 co-relation queries the response was YES. [2023-08-24 05:30:13,067 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16253 conditions, 8109 events. 5879/8109 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 367. Compared 40514 event pairs, 2239 based on Foata normal form. 0/7719 useless extension candidates. Maximal degree in co-relation 16241. Up to 6367 conditions per place. [2023-08-24 05:30:13,091 INFO L140 encePairwiseOnDemand]: 238/242 looper letters, 43 selfloop transitions, 2 changer transitions 2/50 dead transitions. [2023-08-24 05:30:13,091 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 50 transitions, 215 flow [2023-08-24 05:30:13,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-24 05:30:13,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-24 05:30:13,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 401 transitions. [2023-08-24 05:30:13,104 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5523415977961432 [2023-08-24 05:30:13,104 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 401 transitions. [2023-08-24 05:30:13,104 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 401 transitions. [2023-08-24 05:30:13,107 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:30:13,109 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 401 transitions. [2023-08-24 05:30:13,111 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 133.66666666666666) internal successors, (401), 3 states have internal predecessors, (401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:30:13,114 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 242.0) internal successors, (968), 4 states have internal predecessors, (968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:30:13,114 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 242.0) internal successors, (968), 4 states have internal predecessors, (968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:30:13,115 INFO L175 Difference]: Start difference. First operand has 43 places, 31 transitions, 74 flow. Second operand 3 states and 401 transitions. [2023-08-24 05:30:13,116 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 50 transitions, 215 flow [2023-08-24 05:30:13,118 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 50 transitions, 208 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-24 05:30:13,119 INFO L231 Difference]: Finished difference. Result has 40 places, 28 transitions, 68 flow [2023-08-24 05:30:13,120 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=40, PETRI_TRANSITIONS=28} [2023-08-24 05:30:13,122 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, -3 predicate places. [2023-08-24 05:30:13,122 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 28 transitions, 68 flow [2023-08-24 05:30:13,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 118.0) internal successors, (354), 3 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:30:13,122 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:30:13,123 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:30:13,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-24 05:30:13,123 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 05:30:13,123 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:30:13,123 INFO L85 PathProgramCache]: Analyzing trace with hash 276887586, now seen corresponding path program 1 times [2023-08-24 05:30:13,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:30:13,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580520744] [2023-08-24 05:30:13,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:30:13,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:30:13,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:30:13,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 05:30:13,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:30:13,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580520744] [2023-08-24 05:30:13,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580520744] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:30:13,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:30:13,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-24 05:30:13,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140816753] [2023-08-24 05:30:13,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:30:13,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-24 05:30:13,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:30:13,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-24 05:30:13,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-24 05:30:13,285 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 242 [2023-08-24 05:30:13,286 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 28 transitions, 68 flow. Second operand has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:30:13,286 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:30:13,286 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 242 [2023-08-24 05:30:13,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:30:14,555 INFO L124 PetriNetUnfolderBase]: 14367/19536 cut-off events. [2023-08-24 05:30:14,556 INFO L125 PetriNetUnfolderBase]: For 1005/1005 co-relation queries the response was YES. [2023-08-24 05:30:14,576 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40520 conditions, 19536 events. 14367/19536 cut-off events. For 1005/1005 co-relation queries the response was YES. Maximal size of possible extension queue 631. Compared 100344 event pairs, 5297 based on Foata normal form. 458/19994 useless extension candidates. Maximal degree in co-relation 40510. Up to 13505 conditions per place. [2023-08-24 05:30:14,640 INFO L140 encePairwiseOnDemand]: 234/242 looper letters, 46 selfloop transitions, 7 changer transitions 0/53 dead transitions. [2023-08-24 05:30:14,641 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 53 transitions, 232 flow [2023-08-24 05:30:14,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-24 05:30:14,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-24 05:30:14,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 375 transitions. [2023-08-24 05:30:14,642 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5165289256198347 [2023-08-24 05:30:14,642 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 375 transitions. [2023-08-24 05:30:14,642 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 375 transitions. [2023-08-24 05:30:14,642 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:30:14,642 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 375 transitions. [2023-08-24 05:30:14,643 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:30:14,645 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 242.0) internal successors, (968), 4 states have internal predecessors, (968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:30:14,646 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 242.0) internal successors, (968), 4 states have internal predecessors, (968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:30:14,646 INFO L175 Difference]: Start difference. First operand has 40 places, 28 transitions, 68 flow. Second operand 3 states and 375 transitions. [2023-08-24 05:30:14,646 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 53 transitions, 232 flow [2023-08-24 05:30:14,647 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 53 transitions, 226 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-24 05:30:14,648 INFO L231 Difference]: Finished difference. Result has 41 places, 34 transitions, 118 flow [2023-08-24 05:30:14,649 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=118, PETRI_PLACES=41, PETRI_TRANSITIONS=34} [2023-08-24 05:30:14,651 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, -2 predicate places. [2023-08-24 05:30:14,652 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 34 transitions, 118 flow [2023-08-24 05:30:14,655 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:30:14,655 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:30:14,655 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:30:14,656 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-24 05:30:14,656 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 05:30:14,657 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:30:14,657 INFO L85 PathProgramCache]: Analyzing trace with hash -6421539, now seen corresponding path program 1 times [2023-08-24 05:30:14,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:30:14,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526392997] [2023-08-24 05:30:14,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:30:14,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:30:14,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:30:14,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 05:30:14,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:30:14,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526392997] [2023-08-24 05:30:14,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526392997] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:30:14,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:30:14,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-24 05:30:14,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743735364] [2023-08-24 05:30:14,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:30:14,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 05:30:14,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:30:14,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 05:30:14,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-24 05:30:14,846 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 242 [2023-08-24 05:30:14,847 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 34 transitions, 118 flow. Second operand has 4 states, 4 states have (on average 110.0) internal successors, (440), 4 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:30:14,847 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:30:14,847 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 242 [2023-08-24 05:30:14,847 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:30:16,108 INFO L124 PetriNetUnfolderBase]: 13285/18086 cut-off events. [2023-08-24 05:30:16,108 INFO L125 PetriNetUnfolderBase]: For 5520/5520 co-relation queries the response was YES. [2023-08-24 05:30:16,123 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43686 conditions, 18086 events. 13285/18086 cut-off events. For 5520/5520 co-relation queries the response was YES. Maximal size of possible extension queue 564. Compared 89960 event pairs, 3757 based on Foata normal form. 230/18316 useless extension candidates. Maximal degree in co-relation 43674. Up to 8781 conditions per place. [2023-08-24 05:30:16,165 INFO L140 encePairwiseOnDemand]: 235/242 looper letters, 55 selfloop transitions, 7 changer transitions 0/62 dead transitions. [2023-08-24 05:30:16,166 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 62 transitions, 314 flow [2023-08-24 05:30:16,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-24 05:30:16,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-24 05:30:16,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 486 transitions. [2023-08-24 05:30:16,167 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5020661157024794 [2023-08-24 05:30:16,167 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 486 transitions. [2023-08-24 05:30:16,167 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 486 transitions. [2023-08-24 05:30:16,167 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:30:16,167 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 486 transitions. [2023-08-24 05:30:16,168 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 121.5) internal successors, (486), 4 states have internal predecessors, (486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:30:16,170 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 242.0) internal successors, (1210), 5 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:30:16,170 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 242.0) internal successors, (1210), 5 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:30:16,170 INFO L175 Difference]: Start difference. First operand has 41 places, 34 transitions, 118 flow. Second operand 4 states and 486 transitions. [2023-08-24 05:30:16,170 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 62 transitions, 314 flow [2023-08-24 05:30:16,215 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 62 transitions, 294 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-24 05:30:16,216 INFO L231 Difference]: Finished difference. Result has 45 places, 37 transitions, 152 flow [2023-08-24 05:30:16,216 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=152, PETRI_PLACES=45, PETRI_TRANSITIONS=37} [2023-08-24 05:30:16,216 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 2 predicate places. [2023-08-24 05:30:16,216 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 37 transitions, 152 flow [2023-08-24 05:30:16,217 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 110.0) internal successors, (440), 4 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:30:16,217 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:30:16,217 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:30:16,217 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-24 05:30:16,217 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 05:30:16,217 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:30:16,217 INFO L85 PathProgramCache]: Analyzing trace with hash -201404370, now seen corresponding path program 1 times [2023-08-24 05:30:16,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:30:16,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629032133] [2023-08-24 05:30:16,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:30:16,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:30:16,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:30:16,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 05:30:16,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:30:16,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629032133] [2023-08-24 05:30:16,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629032133] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:30:16,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:30:16,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 05:30:16,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242481647] [2023-08-24 05:30:16,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:30:16,316 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 05:30:16,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:30:16,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 05:30:16,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-24 05:30:16,317 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 242 [2023-08-24 05:30:16,317 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 37 transitions, 152 flow. Second operand has 4 states, 4 states have (on average 111.25) internal successors, (445), 4 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:30:16,317 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:30:16,318 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 242 [2023-08-24 05:30:16,318 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:30:17,141 INFO L124 PetriNetUnfolderBase]: 8848/12980 cut-off events. [2023-08-24 05:30:17,141 INFO L125 PetriNetUnfolderBase]: For 6474/6612 co-relation queries the response was YES. [2023-08-24 05:30:17,158 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30921 conditions, 12980 events. 8848/12980 cut-off events. For 6474/6612 co-relation queries the response was YES. Maximal size of possible extension queue 581. Compared 77537 event pairs, 1464 based on Foata normal form. 1010/13861 useless extension candidates. Maximal degree in co-relation 30906. Up to 8025 conditions per place. [2023-08-24 05:30:17,192 INFO L140 encePairwiseOnDemand]: 235/242 looper letters, 76 selfloop transitions, 10 changer transitions 0/95 dead transitions. [2023-08-24 05:30:17,192 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 95 transitions, 518 flow [2023-08-24 05:30:17,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 05:30:17,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 05:30:17,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 616 transitions. [2023-08-24 05:30:17,194 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.509090909090909 [2023-08-24 05:30:17,194 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 616 transitions. [2023-08-24 05:30:17,194 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 616 transitions. [2023-08-24 05:30:17,195 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:30:17,195 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 616 transitions. [2023-08-24 05:30:17,196 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 123.2) internal successors, (616), 5 states have internal predecessors, (616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:30:17,197 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 242.0) internal successors, (1452), 6 states have internal predecessors, (1452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:30:17,198 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 242.0) internal successors, (1452), 6 states have internal predecessors, (1452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:30:17,198 INFO L175 Difference]: Start difference. First operand has 45 places, 37 transitions, 152 flow. Second operand 5 states and 616 transitions. [2023-08-24 05:30:17,198 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 95 transitions, 518 flow [2023-08-24 05:30:17,208 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 95 transitions, 509 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-24 05:30:17,209 INFO L231 Difference]: Finished difference. Result has 51 places, 46 transitions, 224 flow [2023-08-24 05:30:17,209 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=149, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=224, PETRI_PLACES=51, PETRI_TRANSITIONS=46} [2023-08-24 05:30:17,210 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 8 predicate places. [2023-08-24 05:30:17,210 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 46 transitions, 224 flow [2023-08-24 05:30:17,210 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 111.25) internal successors, (445), 4 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:30:17,210 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:30:17,210 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:30:17,210 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-24 05:30:17,210 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 05:30:17,211 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:30:17,211 INFO L85 PathProgramCache]: Analyzing trace with hash -39621490, now seen corresponding path program 1 times [2023-08-24 05:30:17,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:30:17,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829857443] [2023-08-24 05:30:17,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:30:17,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:30:17,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:30:17,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 05:30:17,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:30:17,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829857443] [2023-08-24 05:30:17,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829857443] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:30:17,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:30:17,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-24 05:30:17,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874530833] [2023-08-24 05:30:17,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:30:17,354 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 05:30:17,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:30:17,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 05:30:17,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-24 05:30:17,356 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 242 [2023-08-24 05:30:17,356 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 46 transitions, 224 flow. Second operand has 5 states, 5 states have (on average 111.2) internal successors, (556), 5 states have internal predecessors, (556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:30:17,357 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:30:17,357 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 242 [2023-08-24 05:30:17,357 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:30:18,130 INFO L124 PetriNetUnfolderBase]: 7086/10680 cut-off events. [2023-08-24 05:30:18,131 INFO L125 PetriNetUnfolderBase]: For 7789/7908 co-relation queries the response was YES. [2023-08-24 05:30:18,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32551 conditions, 10680 events. 7086/10680 cut-off events. For 7789/7908 co-relation queries the response was YES. Maximal size of possible extension queue 486. Compared 65489 event pairs, 840 based on Foata normal form. 642/11206 useless extension candidates. Maximal degree in co-relation 32532. Up to 3277 conditions per place. [2023-08-24 05:30:18,166 INFO L140 encePairwiseOnDemand]: 235/242 looper letters, 106 selfloop transitions, 19 changer transitions 0/134 dead transitions. [2023-08-24 05:30:18,166 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 134 transitions, 820 flow [2023-08-24 05:30:18,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-24 05:30:18,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-24 05:30:18,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 865 transitions. [2023-08-24 05:30:18,171 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5106257378984652 [2023-08-24 05:30:18,171 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 865 transitions. [2023-08-24 05:30:18,171 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 865 transitions. [2023-08-24 05:30:18,171 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:30:18,172 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 865 transitions. [2023-08-24 05:30:18,173 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 123.57142857142857) internal successors, (865), 7 states have internal predecessors, (865), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:30:18,175 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 242.0) internal successors, (1936), 8 states have internal predecessors, (1936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:30:18,176 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 242.0) internal successors, (1936), 8 states have internal predecessors, (1936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:30:18,176 INFO L175 Difference]: Start difference. First operand has 51 places, 46 transitions, 224 flow. Second operand 7 states and 865 transitions. [2023-08-24 05:30:18,176 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 134 transitions, 820 flow [2023-08-24 05:30:18,212 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 134 transitions, 815 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-24 05:30:18,214 INFO L231 Difference]: Finished difference. Result has 59 places, 55 transitions, 353 flow [2023-08-24 05:30:18,215 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=219, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=353, PETRI_PLACES=59, PETRI_TRANSITIONS=55} [2023-08-24 05:30:18,216 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 16 predicate places. [2023-08-24 05:30:18,216 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 55 transitions, 353 flow [2023-08-24 05:30:18,217 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 111.2) internal successors, (556), 5 states have internal predecessors, (556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:30:18,217 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:30:18,217 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:30:18,217 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-24 05:30:18,217 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 05:30:18,217 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:30:18,217 INFO L85 PathProgramCache]: Analyzing trace with hash -381300371, now seen corresponding path program 1 times [2023-08-24 05:30:18,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:30:18,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340407513] [2023-08-24 05:30:18,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:30:18,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:30:18,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:30:18,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 05:30:18,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:30:18,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340407513] [2023-08-24 05:30:18,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340407513] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:30:18,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:30:18,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-24 05:30:18,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888230409] [2023-08-24 05:30:18,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:30:18,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 05:30:18,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:30:18,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 05:30:18,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-24 05:30:18,536 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 242 [2023-08-24 05:30:18,537 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 55 transitions, 353 flow. Second operand has 5 states, 5 states have (on average 107.0) internal successors, (535), 5 states have internal predecessors, (535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:30:18,537 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:30:18,537 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 242 [2023-08-24 05:30:18,537 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:30:20,305 INFO L124 PetriNetUnfolderBase]: 15199/22064 cut-off events. [2023-08-24 05:30:20,306 INFO L125 PetriNetUnfolderBase]: For 49904/49904 co-relation queries the response was YES. [2023-08-24 05:30:20,355 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81453 conditions, 22064 events. 15199/22064 cut-off events. For 49904/49904 co-relation queries the response was YES. Maximal size of possible extension queue 835. Compared 136078 event pairs, 1724 based on Foata normal form. 56/22120 useless extension candidates. Maximal degree in co-relation 81430. Up to 8712 conditions per place. [2023-08-24 05:30:20,394 INFO L140 encePairwiseOnDemand]: 228/242 looper letters, 142 selfloop transitions, 49 changer transitions 59/250 dead transitions. [2023-08-24 05:30:20,394 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 250 transitions, 2143 flow [2023-08-24 05:30:20,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-24 05:30:20,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-24 05:30:20,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 862 transitions. [2023-08-24 05:30:20,396 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5088547815820543 [2023-08-24 05:30:20,396 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 862 transitions. [2023-08-24 05:30:20,396 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 862 transitions. [2023-08-24 05:30:20,396 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:30:20,397 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 862 transitions. [2023-08-24 05:30:20,398 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 123.14285714285714) internal successors, (862), 7 states have internal predecessors, (862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:30:20,399 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 242.0) internal successors, (1936), 8 states have internal predecessors, (1936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:30:20,400 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 242.0) internal successors, (1936), 8 states have internal predecessors, (1936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:30:20,400 INFO L175 Difference]: Start difference. First operand has 59 places, 55 transitions, 353 flow. Second operand 7 states and 862 transitions. [2023-08-24 05:30:20,400 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 250 transitions, 2143 flow [2023-08-24 05:30:21,298 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 250 transitions, 1875 flow, removed 94 selfloop flow, removed 3 redundant places. [2023-08-24 05:30:21,300 INFO L231 Difference]: Finished difference. Result has 66 places, 90 transitions, 658 flow [2023-08-24 05:30:21,300 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=303, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=658, PETRI_PLACES=66, PETRI_TRANSITIONS=90} [2023-08-24 05:30:21,300 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 23 predicate places. [2023-08-24 05:30:21,301 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 90 transitions, 658 flow [2023-08-24 05:30:21,301 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 107.0) internal successors, (535), 5 states have internal predecessors, (535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:30:21,301 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:30:21,301 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:30:21,301 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-24 05:30:21,301 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 05:30:21,301 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:30:21,302 INFO L85 PathProgramCache]: Analyzing trace with hash 659786337, now seen corresponding path program 2 times [2023-08-24 05:30:21,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:30:21,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008728357] [2023-08-24 05:30:21,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:30:21,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:30:21,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:30:21,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 05:30:21,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:30:21,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008728357] [2023-08-24 05:30:21,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008728357] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:30:21,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:30:21,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-24 05:30:21,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946622503] [2023-08-24 05:30:21,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:30:21,481 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-24 05:30:21,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:30:21,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-24 05:30:21,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-24 05:30:21,482 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 242 [2023-08-24 05:30:21,482 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 90 transitions, 658 flow. Second operand has 6 states, 6 states have (on average 111.16666666666667) internal successors, (667), 6 states have internal predecessors, (667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:30:21,482 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:30:21,483 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 242 [2023-08-24 05:30:21,483 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:30:22,178 INFO L124 PetriNetUnfolderBase]: 5300/8274 cut-off events. [2023-08-24 05:30:22,179 INFO L125 PetriNetUnfolderBase]: For 18233/18594 co-relation queries the response was YES. [2023-08-24 05:30:22,194 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30942 conditions, 8274 events. 5300/8274 cut-off events. For 18233/18594 co-relation queries the response was YES. Maximal size of possible extension queue 344. Compared 51002 event pairs, 616 based on Foata normal form. 706/8852 useless extension candidates. Maximal degree in co-relation 30915. Up to 2859 conditions per place. [2023-08-24 05:30:22,214 INFO L140 encePairwiseOnDemand]: 235/242 looper letters, 199 selfloop transitions, 18 changer transitions 40/280 dead transitions. [2023-08-24 05:30:22,214 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 280 transitions, 2291 flow [2023-08-24 05:30:22,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-24 05:30:22,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-24 05:30:22,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 866 transitions. [2023-08-24 05:30:22,217 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5112160566706021 [2023-08-24 05:30:22,217 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 866 transitions. [2023-08-24 05:30:22,217 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 866 transitions. [2023-08-24 05:30:22,217 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:30:22,217 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 866 transitions. [2023-08-24 05:30:22,218 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 123.71428571428571) internal successors, (866), 7 states have internal predecessors, (866), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:30:22,220 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 242.0) internal successors, (1936), 8 states have internal predecessors, (1936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:30:22,220 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 242.0) internal successors, (1936), 8 states have internal predecessors, (1936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:30:22,220 INFO L175 Difference]: Start difference. First operand has 66 places, 90 transitions, 658 flow. Second operand 7 states and 866 transitions. [2023-08-24 05:30:22,220 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 280 transitions, 2291 flow [2023-08-24 05:30:22,282 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 280 transitions, 2223 flow, removed 34 selfloop flow, removed 3 redundant places. [2023-08-24 05:30:22,285 INFO L231 Difference]: Finished difference. Result has 68 places, 98 transitions, 760 flow [2023-08-24 05:30:22,285 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=614, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=760, PETRI_PLACES=68, PETRI_TRANSITIONS=98} [2023-08-24 05:30:22,285 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 25 predicate places. [2023-08-24 05:30:22,285 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 98 transitions, 760 flow [2023-08-24 05:30:22,286 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 111.16666666666667) internal successors, (667), 6 states have internal predecessors, (667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:30:22,286 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:30:22,286 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] [2023-08-24 05:30:22,286 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-24 05:30:22,286 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 05:30:22,286 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:30:22,286 INFO L85 PathProgramCache]: Analyzing trace with hash 386126007, now seen corresponding path program 1 times [2023-08-24 05:30:22,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:30:22,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578995396] [2023-08-24 05:30:22,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:30:22,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:30:22,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:30:23,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 05:30:23,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:30:23,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578995396] [2023-08-24 05:30:23,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578995396] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:30:23,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:30:23,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-24 05:30:23,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896679313] [2023-08-24 05:30:23,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:30:23,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-24 05:30:23,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:30:23,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-24 05:30:23,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-08-24 05:30:23,181 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 242 [2023-08-24 05:30:23,181 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 98 transitions, 760 flow. Second operand has 9 states, 9 states have (on average 107.44444444444444) internal successors, (967), 9 states have internal predecessors, (967), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:30:23,181 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:30:23,181 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 242 [2023-08-24 05:30:23,181 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:30:24,237 INFO L124 PetriNetUnfolderBase]: 6615/10716 cut-off events. [2023-08-24 05:30:24,237 INFO L125 PetriNetUnfolderBase]: For 26986/27160 co-relation queries the response was YES. [2023-08-24 05:30:24,262 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45131 conditions, 10716 events. 6615/10716 cut-off events. For 26986/27160 co-relation queries the response was YES. Maximal size of possible extension queue 422. Compared 70888 event pairs, 388 based on Foata normal form. 178/10807 useless extension candidates. Maximal degree in co-relation 45102. Up to 2771 conditions per place. [2023-08-24 05:30:24,289 INFO L140 encePairwiseOnDemand]: 234/242 looper letters, 165 selfloop transitions, 15 changer transitions 108/307 dead transitions. [2023-08-24 05:30:24,289 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 307 transitions, 2933 flow [2023-08-24 05:30:24,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-24 05:30:24,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-24 05:30:24,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 953 transitions. [2023-08-24 05:30:24,291 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4922520661157025 [2023-08-24 05:30:24,291 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 953 transitions. [2023-08-24 05:30:24,291 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 953 transitions. [2023-08-24 05:30:24,292 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:30:24,292 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 953 transitions. [2023-08-24 05:30:24,293 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 119.125) internal successors, (953), 8 states have internal predecessors, (953), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:30:24,295 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 242.0) internal successors, (2178), 9 states have internal predecessors, (2178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:30:24,295 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 242.0) internal successors, (2178), 9 states have internal predecessors, (2178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:30:24,295 INFO L175 Difference]: Start difference. First operand has 68 places, 98 transitions, 760 flow. Second operand 8 states and 953 transitions. [2023-08-24 05:30:24,295 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 307 transitions, 2933 flow [2023-08-24 05:30:24,696 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 307 transitions, 2514 flow, removed 170 selfloop flow, removed 2 redundant places. [2023-08-24 05:30:24,698 INFO L231 Difference]: Finished difference. Result has 78 places, 98 transitions, 744 flow [2023-08-24 05:30:24,698 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=695, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=744, PETRI_PLACES=78, PETRI_TRANSITIONS=98} [2023-08-24 05:30:24,699 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 35 predicate places. [2023-08-24 05:30:24,699 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 98 transitions, 744 flow [2023-08-24 05:30:24,699 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 107.44444444444444) internal successors, (967), 9 states have internal predecessors, (967), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:30:24,699 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:30:24,699 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] [2023-08-24 05:30:24,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-24 05:30:24,699 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 05:30:24,700 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:30:24,700 INFO L85 PathProgramCache]: Analyzing trace with hash 1880475193, now seen corresponding path program 2 times [2023-08-24 05:30:24,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:30:24,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515394651] [2023-08-24 05:30:24,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:30:24,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:30:24,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:30:24,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 05:30:24,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:30:24,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515394651] [2023-08-24 05:30:24,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515394651] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:30:24,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:30:24,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 05:30:24,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115440316] [2023-08-24 05:30:24,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:30:24,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 05:30:24,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:30:24,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 05:30:24,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-24 05:30:24,835 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 242 [2023-08-24 05:30:24,836 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 98 transitions, 744 flow. Second operand has 4 states, 4 states have (on average 118.75) internal successors, (475), 4 states have internal predecessors, (475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:30:24,836 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:30:24,836 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 242 [2023-08-24 05:30:24,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:30:25,839 INFO L124 PetriNetUnfolderBase]: 8210/12935 cut-off events. [2023-08-24 05:30:25,839 INFO L125 PetriNetUnfolderBase]: For 34481/34738 co-relation queries the response was YES. [2023-08-24 05:30:25,868 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54987 conditions, 12935 events. 8210/12935 cut-off events. For 34481/34738 co-relation queries the response was YES. Maximal size of possible extension queue 522. Compared 85386 event pairs, 1209 based on Foata normal form. 195/13006 useless extension candidates. Maximal degree in co-relation 54952. Up to 5837 conditions per place. [2023-08-24 05:30:25,891 INFO L140 encePairwiseOnDemand]: 239/242 looper letters, 142 selfloop transitions, 2 changer transitions 70/228 dead transitions. [2023-08-24 05:30:25,892 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 228 transitions, 2102 flow [2023-08-24 05:30:25,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-24 05:30:25,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-24 05:30:25,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 516 transitions. [2023-08-24 05:30:25,894 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5330578512396694 [2023-08-24 05:30:25,894 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 516 transitions. [2023-08-24 05:30:25,894 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 516 transitions. [2023-08-24 05:30:25,894 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:30:25,894 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 516 transitions. [2023-08-24 05:30:25,895 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 129.0) internal successors, (516), 4 states have internal predecessors, (516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:30:25,896 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 242.0) internal successors, (1210), 5 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:30:25,896 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 242.0) internal successors, (1210), 5 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:30:25,896 INFO L175 Difference]: Start difference. First operand has 78 places, 98 transitions, 744 flow. Second operand 4 states and 516 transitions. [2023-08-24 05:30:25,896 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 228 transitions, 2102 flow [2023-08-24 05:30:26,354 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 228 transitions, 1975 flow, removed 22 selfloop flow, removed 4 redundant places. [2023-08-24 05:30:26,355 INFO L231 Difference]: Finished difference. Result has 77 places, 97 transitions, 693 flow [2023-08-24 05:30:26,356 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=685, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=693, PETRI_PLACES=77, PETRI_TRANSITIONS=97} [2023-08-24 05:30:26,356 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 34 predicate places. [2023-08-24 05:30:26,356 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 97 transitions, 693 flow [2023-08-24 05:30:26,356 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 118.75) internal successors, (475), 4 states have internal predecessors, (475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:30:26,356 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:30:26,356 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] [2023-08-24 05:30:26,357 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-24 05:30:26,357 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 05:30:26,357 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:30:26,357 INFO L85 PathProgramCache]: Analyzing trace with hash 714538693, now seen corresponding path program 3 times [2023-08-24 05:30:26,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:30:26,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616058564] [2023-08-24 05:30:26,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:30:26,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:30:26,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:30:26,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 05:30:26,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:30:26,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616058564] [2023-08-24 05:30:26,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616058564] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:30:26,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:30:26,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-24 05:30:26,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440501744] [2023-08-24 05:30:26,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:30:26,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-24 05:30:26,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:30:26,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-24 05:30:26,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-08-24 05:30:26,494 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 242 [2023-08-24 05:30:26,495 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 97 transitions, 693 flow. Second operand has 7 states, 7 states have (on average 111.14285714285714) internal successors, (778), 7 states have internal predecessors, (778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:30:26,495 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:30:26,495 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 242 [2023-08-24 05:30:26,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:30:27,491 INFO L124 PetriNetUnfolderBase]: 7161/11473 cut-off events. [2023-08-24 05:30:27,491 INFO L125 PetriNetUnfolderBase]: For 27791/28130 co-relation queries the response was YES. [2023-08-24 05:30:27,516 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45902 conditions, 11473 events. 7161/11473 cut-off events. For 27791/28130 co-relation queries the response was YES. Maximal size of possible extension queue 531. Compared 78433 event pairs, 765 based on Foata normal form. 362/11612 useless extension candidates. Maximal degree in co-relation 45868. Up to 3929 conditions per place. [2023-08-24 05:30:27,532 INFO L140 encePairwiseOnDemand]: 235/242 looper letters, 162 selfloop transitions, 22 changer transitions 87/290 dead transitions. [2023-08-24 05:30:27,532 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 290 transitions, 2459 flow [2023-08-24 05:30:27,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-24 05:30:27,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-24 05:30:27,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1082 transitions. [2023-08-24 05:30:27,543 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4967860422405877 [2023-08-24 05:30:27,544 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1082 transitions. [2023-08-24 05:30:27,544 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1082 transitions. [2023-08-24 05:30:27,544 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:30:27,544 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1082 transitions. [2023-08-24 05:30:27,546 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 120.22222222222223) internal successors, (1082), 9 states have internal predecessors, (1082), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:30:27,547 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 242.0) internal successors, (2420), 10 states have internal predecessors, (2420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:30:27,548 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 242.0) internal successors, (2420), 10 states have internal predecessors, (2420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:30:27,548 INFO L175 Difference]: Start difference. First operand has 77 places, 97 transitions, 693 flow. Second operand 9 states and 1082 transitions. [2023-08-24 05:30:27,548 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 290 transitions, 2459 flow [2023-08-24 05:30:28,039 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 290 transitions, 2412 flow, removed 10 selfloop flow, removed 2 redundant places. [2023-08-24 05:30:28,041 INFO L231 Difference]: Finished difference. Result has 86 places, 93 transitions, 699 flow [2023-08-24 05:30:28,041 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=666, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=699, PETRI_PLACES=86, PETRI_TRANSITIONS=93} [2023-08-24 05:30:28,041 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 43 predicate places. [2023-08-24 05:30:28,041 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 93 transitions, 699 flow [2023-08-24 05:30:28,042 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 111.14285714285714) internal successors, (778), 7 states have internal predecessors, (778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:30:28,042 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:30:28,042 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:30:28,042 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-24 05:30:28,042 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 05:30:28,042 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:30:28,042 INFO L85 PathProgramCache]: Analyzing trace with hash -837397891, now seen corresponding path program 1 times [2023-08-24 05:30:28,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:30:28,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976004740] [2023-08-24 05:30:28,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:30:28,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:30:28,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:30:28,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 05:30:28,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:30:28,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976004740] [2023-08-24 05:30:28,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976004740] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:30:28,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:30:28,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 05:30:28,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212563977] [2023-08-24 05:30:28,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:30:28,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 05:30:28,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:30:28,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 05:30:28,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-24 05:30:28,160 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 242 [2023-08-24 05:30:28,161 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 93 transitions, 699 flow. Second operand has 4 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:30:28,161 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:30:28,161 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 242 [2023-08-24 05:30:28,161 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:30:28,958 INFO L124 PetriNetUnfolderBase]: 6483/10187 cut-off events. [2023-08-24 05:30:28,958 INFO L125 PetriNetUnfolderBase]: For 28443/28443 co-relation queries the response was YES. [2023-08-24 05:30:28,980 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43935 conditions, 10187 events. 6483/10187 cut-off events. For 28443/28443 co-relation queries the response was YES. Maximal size of possible extension queue 412. Compared 62791 event pairs, 1679 based on Foata normal form. 2/10189 useless extension candidates. Maximal degree in co-relation 43900. Up to 5924 conditions per place. [2023-08-24 05:30:28,993 INFO L140 encePairwiseOnDemand]: 236/242 looper letters, 94 selfloop transitions, 10 changer transitions 50/154 dead transitions. [2023-08-24 05:30:28,993 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 154 transitions, 1431 flow [2023-08-24 05:30:28,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-24 05:30:28,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-24 05:30:28,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 489 transitions. [2023-08-24 05:30:28,994 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5051652892561983 [2023-08-24 05:30:28,994 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 489 transitions. [2023-08-24 05:30:28,994 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 489 transitions. [2023-08-24 05:30:28,995 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:30:28,995 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 489 transitions. [2023-08-24 05:30:28,995 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 122.25) internal successors, (489), 4 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:30:28,997 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 242.0) internal successors, (1210), 5 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:30:28,998 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 242.0) internal successors, (1210), 5 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:30:28,998 INFO L175 Difference]: Start difference. First operand has 86 places, 93 transitions, 699 flow. Second operand 4 states and 489 transitions. [2023-08-24 05:30:28,998 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 154 transitions, 1431 flow [2023-08-24 05:30:29,262 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 154 transitions, 1270 flow, removed 43 selfloop flow, removed 12 redundant places. [2023-08-24 05:30:29,263 INFO L231 Difference]: Finished difference. Result has 76 places, 73 transitions, 480 flow [2023-08-24 05:30:29,264 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=614, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=480, PETRI_PLACES=76, PETRI_TRANSITIONS=73} [2023-08-24 05:30:29,264 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 33 predicate places. [2023-08-24 05:30:29,264 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 73 transitions, 480 flow [2023-08-24 05:30:29,264 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:30:29,264 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:30:29,264 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:30:29,265 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-24 05:30:29,265 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 05:30:29,265 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:30:29,265 INFO L85 PathProgramCache]: Analyzing trace with hash 236173599, now seen corresponding path program 2 times [2023-08-24 05:30:29,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:30:29,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094601822] [2023-08-24 05:30:29,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:30:29,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:30:29,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:30:29,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 05:30:29,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:30:29,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094601822] [2023-08-24 05:30:29,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094601822] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:30:29,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:30:29,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-24 05:30:29,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447601598] [2023-08-24 05:30:29,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:30:29,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-24 05:30:29,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:30:29,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-24 05:30:29,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-08-24 05:30:29,514 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 242 [2023-08-24 05:30:29,515 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 73 transitions, 480 flow. Second operand has 8 states, 8 states have (on average 104.5) internal successors, (836), 8 states have internal predecessors, (836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:30:29,515 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:30:29,515 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 242 [2023-08-24 05:30:29,515 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:30:30,121 INFO L124 PetriNetUnfolderBase]: 3381/5205 cut-off events. [2023-08-24 05:30:30,121 INFO L125 PetriNetUnfolderBase]: For 10510/10510 co-relation queries the response was YES. [2023-08-24 05:30:30,128 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20483 conditions, 5205 events. 3381/5205 cut-off events. For 10510/10510 co-relation queries the response was YES. Maximal size of possible extension queue 211. Compared 27541 event pairs, 637 based on Foata normal form. 1/5206 useless extension candidates. Maximal degree in co-relation 20451. Up to 3270 conditions per place. [2023-08-24 05:30:30,134 INFO L140 encePairwiseOnDemand]: 230/242 looper letters, 107 selfloop transitions, 41 changer transitions 64/212 dead transitions. [2023-08-24 05:30:30,134 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 212 transitions, 1730 flow [2023-08-24 05:30:30,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-24 05:30:30,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-24 05:30:30,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1255 transitions. [2023-08-24 05:30:30,136 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47145003756574005 [2023-08-24 05:30:30,136 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1255 transitions. [2023-08-24 05:30:30,136 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1255 transitions. [2023-08-24 05:30:30,137 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:30:30,137 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1255 transitions. [2023-08-24 05:30:30,139 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 114.0909090909091) internal successors, (1255), 11 states have internal predecessors, (1255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:30:30,141 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 242.0) internal successors, (2904), 12 states have internal predecessors, (2904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:30:30,141 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 242.0) internal successors, (2904), 12 states have internal predecessors, (2904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:30:30,141 INFO L175 Difference]: Start difference. First operand has 76 places, 73 transitions, 480 flow. Second operand 11 states and 1255 transitions. [2023-08-24 05:30:30,141 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 212 transitions, 1730 flow [2023-08-24 05:30:30,189 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 212 transitions, 1633 flow, removed 29 selfloop flow, removed 6 redundant places. [2023-08-24 05:30:30,191 INFO L231 Difference]: Finished difference. Result has 82 places, 97 transitions, 772 flow [2023-08-24 05:30:30,191 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=440, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=772, PETRI_PLACES=82, PETRI_TRANSITIONS=97} [2023-08-24 05:30:30,191 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 39 predicate places. [2023-08-24 05:30:30,192 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 97 transitions, 772 flow [2023-08-24 05:30:30,192 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 104.5) internal successors, (836), 8 states have internal predecessors, (836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:30:30,192 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:30:30,192 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:30:30,192 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-24 05:30:30,192 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 05:30:30,192 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:30:30,192 INFO L85 PathProgramCache]: Analyzing trace with hash -1261762753, now seen corresponding path program 3 times [2023-08-24 05:30:30,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:30:30,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777043331] [2023-08-24 05:30:30,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:30:30,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:30:30,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:30:30,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 05:30:30,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:30:30,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777043331] [2023-08-24 05:30:30,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777043331] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:30:30,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:30:30,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 05:30:30,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181315334] [2023-08-24 05:30:30,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:30:30,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 05:30:30,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:30:30,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 05:30:30,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-24 05:30:30,301 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 242 [2023-08-24 05:30:30,302 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 97 transitions, 772 flow. Second operand has 4 states, 4 states have (on average 119.5) internal successors, (478), 4 states have internal predecessors, (478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:30:30,302 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:30:30,302 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 242 [2023-08-24 05:30:30,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:30:30,664 INFO L124 PetriNetUnfolderBase]: 2864/4483 cut-off events. [2023-08-24 05:30:30,664 INFO L125 PetriNetUnfolderBase]: For 11201/11247 co-relation queries the response was YES. [2023-08-24 05:30:30,673 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18505 conditions, 4483 events. 2864/4483 cut-off events. For 11201/11247 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 24025 event pairs, 412 based on Foata normal form. 19/4480 useless extension candidates. Maximal degree in co-relation 18480. Up to 2146 conditions per place. [2023-08-24 05:30:30,679 INFO L140 encePairwiseOnDemand]: 239/242 looper letters, 65 selfloop transitions, 2 changer transitions 93/164 dead transitions. [2023-08-24 05:30:30,679 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 164 transitions, 1536 flow [2023-08-24 05:30:30,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-24 05:30:30,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-24 05:30:30,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 504 transitions. [2023-08-24 05:30:30,680 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5206611570247934 [2023-08-24 05:30:30,681 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 504 transitions. [2023-08-24 05:30:30,681 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 504 transitions. [2023-08-24 05:30:30,681 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:30:30,681 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 504 transitions. [2023-08-24 05:30:30,682 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 126.0) internal successors, (504), 4 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:30:30,683 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 242.0) internal successors, (1210), 5 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:30:30,683 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 242.0) internal successors, (1210), 5 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:30:30,683 INFO L175 Difference]: Start difference. First operand has 82 places, 97 transitions, 772 flow. Second operand 4 states and 504 transitions. [2023-08-24 05:30:30,683 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 164 transitions, 1536 flow [2023-08-24 05:30:30,730 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 164 transitions, 1487 flow, removed 13 selfloop flow, removed 2 redundant places. [2023-08-24 05:30:30,731 INFO L231 Difference]: Finished difference. Result has 83 places, 63 transitions, 431 flow [2023-08-24 05:30:30,731 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=734, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=431, PETRI_PLACES=83, PETRI_TRANSITIONS=63} [2023-08-24 05:30:30,732 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 40 predicate places. [2023-08-24 05:30:30,732 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 63 transitions, 431 flow [2023-08-24 05:30:30,732 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 119.5) internal successors, (478), 4 states have internal predecessors, (478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:30:30,732 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:30:30,732 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:30:30,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-24 05:30:30,732 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 05:30:30,733 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:30:30,733 INFO L85 PathProgramCache]: Analyzing trace with hash 858289375, now seen corresponding path program 4 times [2023-08-24 05:30:30,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:30:30,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799784135] [2023-08-24 05:30:30,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:30:30,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:30:30,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:30:31,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 05:30:31,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:30:31,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799784135] [2023-08-24 05:30:31,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799784135] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:30:31,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:30:31,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-24 05:30:31,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578735956] [2023-08-24 05:30:31,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:30:31,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-24 05:30:31,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:30:31,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-24 05:30:31,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-08-24 05:30:31,194 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 242 [2023-08-24 05:30:31,195 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 63 transitions, 431 flow. Second operand has 8 states, 8 states have (on average 109.125) internal successors, (873), 8 states have internal predecessors, (873), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:30:31,195 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:30:31,195 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 242 [2023-08-24 05:30:31,195 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:30:31,457 INFO L124 PetriNetUnfolderBase]: 918/1496 cut-off events. [2023-08-24 05:30:31,457 INFO L125 PetriNetUnfolderBase]: For 3431/3447 co-relation queries the response was YES. [2023-08-24 05:30:31,460 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6099 conditions, 1496 events. 918/1496 cut-off events. For 3431/3447 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 6466 event pairs, 167 based on Foata normal form. 17/1494 useless extension candidates. Maximal degree in co-relation 6072. Up to 907 conditions per place. [2023-08-24 05:30:31,462 INFO L140 encePairwiseOnDemand]: 236/242 looper letters, 61 selfloop transitions, 5 changer transitions 45/115 dead transitions. [2023-08-24 05:30:31,462 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 115 transitions, 918 flow [2023-08-24 05:30:31,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-24 05:30:31,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-24 05:30:31,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 802 transitions. [2023-08-24 05:30:31,464 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4734356552538371 [2023-08-24 05:30:31,464 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 802 transitions. [2023-08-24 05:30:31,464 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 802 transitions. [2023-08-24 05:30:31,465 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:30:31,465 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 802 transitions. [2023-08-24 05:30:31,466 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 114.57142857142857) internal successors, (802), 7 states have internal predecessors, (802), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:30:31,467 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 242.0) internal successors, (1936), 8 states have internal predecessors, (1936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:30:31,468 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 242.0) internal successors, (1936), 8 states have internal predecessors, (1936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:30:31,468 INFO L175 Difference]: Start difference. First operand has 83 places, 63 transitions, 431 flow. Second operand 7 states and 802 transitions. [2023-08-24 05:30:31,468 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 115 transitions, 918 flow [2023-08-24 05:30:31,477 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 115 transitions, 827 flow, removed 12 selfloop flow, removed 15 redundant places. [2023-08-24 05:30:31,478 INFO L231 Difference]: Finished difference. Result has 74 places, 53 transitions, 305 flow [2023-08-24 05:30:31,478 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=355, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=305, PETRI_PLACES=74, PETRI_TRANSITIONS=53} [2023-08-24 05:30:31,479 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 31 predicate places. [2023-08-24 05:30:31,479 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 53 transitions, 305 flow [2023-08-24 05:30:31,479 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 109.125) internal successors, (873), 8 states have internal predecessors, (873), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:30:31,479 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:30:31,479 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:30:31,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-24 05:30:31,480 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 05:30:31,480 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:30:31,480 INFO L85 PathProgramCache]: Analyzing trace with hash -596804703, now seen corresponding path program 5 times [2023-08-24 05:30:31,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:30:31,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853690702] [2023-08-24 05:30:31,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:30:31,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:30:31,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-24 05:30:31,532 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-24 05:30:31,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-24 05:30:31,599 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-24 05:30:31,599 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-24 05:30:31,599 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2023-08-24 05:30:31,603 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2023-08-24 05:30:31,603 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2023-08-24 05:30:31,605 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2023-08-24 05:30:31,606 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2023-08-24 05:30:31,607 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2023-08-24 05:30:31,607 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2023-08-24 05:30:31,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-24 05:30:31,607 INFO L445 BasicCegarLoop]: Path program histogram: [5, 3, 2, 1, 1, 1, 1, 1] [2023-08-24 05:30:31,611 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-24 05:30:31,611 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-24 05:30:31,682 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.08 05:30:31 BasicIcfg [2023-08-24 05:30:31,682 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-24 05:30:31,682 INFO L158 Benchmark]: Toolchain (without parser) took 24259.68ms. Allocated memory was 400.6MB in the beginning and 2.0GB in the end (delta: 1.6GB). Free memory was 375.6MB in the beginning and 867.4MB in the end (delta: -491.8MB). Peak memory consumption was 1.1GB. Max. memory is 16.0GB. [2023-08-24 05:30:31,682 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 400.6MB. Free memory is still 377.6MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-24 05:30:31,683 INFO L158 Benchmark]: CACSL2BoogieTranslator took 363.49ms. Allocated memory is still 400.6MB. Free memory was 375.6MB in the beginning and 351.1MB in the end (delta: 24.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-24 05:30:31,683 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.59ms. Allocated memory is still 400.6MB. Free memory was 351.1MB in the beginning and 348.6MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-24 05:30:31,683 INFO L158 Benchmark]: Boogie Preprocessor took 33.42ms. Allocated memory is still 400.6MB. Free memory was 348.6MB in the beginning and 346.6MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-24 05:30:31,683 INFO L158 Benchmark]: RCFGBuilder took 581.10ms. Allocated memory is still 400.6MB. Free memory was 346.5MB in the beginning and 362.5MB in the end (delta: -15.9MB). Peak memory consumption was 33.6MB. Max. memory is 16.0GB. [2023-08-24 05:30:31,685 INFO L158 Benchmark]: TraceAbstraction took 23215.52ms. Allocated memory was 400.6MB in the beginning and 2.0GB in the end (delta: 1.6GB). Free memory was 361.6MB in the beginning and 867.4MB in the end (delta: -505.8MB). Peak memory consumption was 1.1GB. Max. memory is 16.0GB. [2023-08-24 05:30:31,687 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.11ms. Allocated memory is still 400.6MB. Free memory is still 377.6MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 363.49ms. Allocated memory is still 400.6MB. Free memory was 375.6MB in the beginning and 351.1MB in the end (delta: 24.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 61.59ms. Allocated memory is still 400.6MB. Free memory was 351.1MB in the beginning and 348.6MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 33.42ms. Allocated memory is still 400.6MB. Free memory was 348.6MB in the beginning and 346.6MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 581.10ms. Allocated memory is still 400.6MB. Free memory was 346.5MB in the beginning and 362.5MB in the end (delta: -15.9MB). Peak memory consumption was 33.6MB. Max. memory is 16.0GB. * TraceAbstraction took 23215.52ms. Allocated memory was 400.6MB in the beginning and 2.0GB in the end (delta: 1.6GB). Free memory was 361.6MB in the beginning and 867.4MB in the end (delta: -505.8MB). Peak memory consumption was 1.1GB. 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.3s, 140 PlacesBefore, 43 PlacesAfterwards, 129 TransitionsBefore, 31 TransitionsAfterwards, 3270 CoEnabledTransitionPairs, 7 FixpointIterations, 44 TrivialSequentialCompositions, 54 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 1 ChoiceCompositions, 109 TotalNumberOfCompositions, 8894 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3188, independent: 2946, independent conditional: 0, independent unconditional: 2946, dependent: 242, dependent conditional: 0, dependent unconditional: 242, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1743, independent: 1690, independent conditional: 0, independent unconditional: 1690, dependent: 53, dependent conditional: 0, dependent unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3188, independent: 1256, independent conditional: 0, independent unconditional: 1256, dependent: 189, dependent conditional: 0, dependent unconditional: 189, unknown: 1743, unknown conditional: 0, unknown unconditional: 1743] , Statistics on independence cache: Total cache size (in pairs): 176, Positive cache size: 152, Positive conditional cache size: 0, Positive unconditional cache size: 152, Negative cache size: 24, Negative conditional cache size: 0, Negative unconditional cache size: 24, 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_p1_EAX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L722] 0 int b = 0; [L723] 0 _Bool b$flush_delayed; [L724] 0 int b$mem_tmp; [L725] 0 _Bool b$r_buff0_thd0; [L726] 0 _Bool b$r_buff0_thd1; [L727] 0 _Bool b$r_buff0_thd2; [L728] 0 _Bool b$r_buff0_thd3; [L729] 0 _Bool b$r_buff0_thd4; [L730] 0 _Bool b$r_buff1_thd0; [L731] 0 _Bool b$r_buff1_thd1; [L732] 0 _Bool b$r_buff1_thd2; [L733] 0 _Bool b$r_buff1_thd3; [L734] 0 _Bool b$r_buff1_thd4; [L735] 0 _Bool b$read_delayed; [L736] 0 int *b$read_delayed_var; [L737] 0 int b$w_buff0; [L738] 0 _Bool b$w_buff0_used; [L739] 0 int b$w_buff1; [L740] 0 _Bool b$w_buff1_used; [L741] 0 _Bool main$tmp_guard0; [L742] 0 _Bool main$tmp_guard1; [L744] 0 int x = 0; [L746] 0 int y = 0; [L748] 0 int z = 0; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L871] 0 pthread_t t1129; [L872] FCALL, FORK 0 pthread_create(&t1129, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1129, ((void *)0), P0, ((void *)0))=-3, t1129={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L873] 0 pthread_t t1130; [L874] FCALL, FORK 0 pthread_create(&t1130, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1130, ((void *)0), P1, ((void *)0))=-2, t1129={5:0}, t1130={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L875] 0 pthread_t t1131; [L876] FCALL, FORK 0 pthread_create(&t1131, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1131, ((void *)0), P2, ((void *)0))=-1, t1129={5:0}, t1130={6:0}, t1131={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L877] 0 pthread_t t1132; [L878] FCALL, FORK 0 pthread_create(&t1132, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1132, ((void *)0), P3, ((void *)0))=0, t1129={5:0}, t1130={6:0}, t1131={7:0}, t1132={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L754] 1 b$w_buff1 = b$w_buff0 [L755] 1 b$w_buff0 = 1 [L756] 1 b$w_buff1_used = b$w_buff0_used [L757] 1 b$w_buff0_used = (_Bool)1 [L758] CALL 1 __VERIFIER_assert(!(b$w_buff1_used && b$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L758] RET 1 __VERIFIER_assert(!(b$w_buff1_used && b$w_buff0_used)) [L759] 1 b$r_buff1_thd0 = b$r_buff0_thd0 [L760] 1 b$r_buff1_thd1 = b$r_buff0_thd1 [L761] 1 b$r_buff1_thd2 = b$r_buff0_thd2 [L762] 1 b$r_buff1_thd3 = b$r_buff0_thd3 [L763] 1 b$r_buff1_thd4 = b$r_buff0_thd4 [L764] 1 b$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_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}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L767] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_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}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L784] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L787] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L804] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_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}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L807] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_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}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L824] 4 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_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}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2] [L790] 2 b = b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b) [L791] 2 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used [L792] 2 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$w_buff1_used [L793] 2 b$r_buff0_thd2 = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$r_buff0_thd2 [L794] 2 b$r_buff1_thd2 = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_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}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2] [L827] 4 a = 1 [L830] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_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}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2] [L833] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L834] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L835] 4 b$flush_delayed = weak$$choice2 [L836] 4 b$mem_tmp = b [L837] 4 b = !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff1) [L838] 4 b$w_buff0 = weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff0)) [L839] 4 b$w_buff1 = weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff1 : b$w_buff1)) [L840] 4 b$w_buff0_used = weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used)) [L841] 4 b$w_buff1_used = weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L842] 4 b$r_buff0_thd4 = weak$$choice2 ? b$r_buff0_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff0_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4)) [L843] 4 b$r_buff1_thd4 = weak$$choice2 ? b$r_buff1_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff1_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L844] 4 __unbuffered_p3_EBX = b [L845] 4 b = b$flush_delayed ? b$mem_tmp : b [L846] 4 b$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_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}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z=2] [L849] 4 b = b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd4 ? b$w_buff1 : b) [L850] 4 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used [L851] 4 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$w_buff1_used [L852] 4 b$r_buff0_thd4 = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4 [L853] 4 b$r_buff1_thd4 = b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_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}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z=2] [L770] 1 b = b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b) [L771] 1 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$w_buff0_used [L772] 1 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$w_buff1_used [L773] 1 b$r_buff0_thd1 = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$r_buff0_thd1 [L774] 1 b$r_buff1_thd1 = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_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}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z=2] [L777] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L779] 1 return 0; [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L799] 2 return 0; [L810] 3 b = b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b) [L811] 3 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used [L812] 3 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$w_buff1_used [L813] 3 b$r_buff0_thd3 = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3 [L814] 3 b$r_buff1_thd3 = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_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}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z=2] [L817] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L819] 3 return 0; [L856] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L858] 4 return 0; [L880] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L882] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L882] RET 0 assume_abort_if_not(main$tmp_guard0) [L884] 0 b = b$w_buff0_used && b$r_buff0_thd0 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b) [L885] 0 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$w_buff0_used [L886] 0 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$w_buff1_used [L887] 0 b$r_buff0_thd0 = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$r_buff0_thd0 [L888] 0 b$r_buff1_thd0 = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_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}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1129={5:0}, t1130={6:0}, t1131={7:0}, t1132={3:0}, weak$$choice2=0, x=1, y=1, z=2] [L891] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L893] 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_p1_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}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z=2] - 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: 874]: 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: 876]: 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: 872]: 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: 878]: 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, 171 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: 23.1s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 16.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 639 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 639 mSDsluCounter, 65 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 34 mSDsCounter, 77 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2290 IncrementalHoareTripleChecker+Invalid, 2367 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 77 mSolverCounterUnsat, 31 mSDtfsCounter, 2290 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 76 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=772occurred in iteration=12, InterpolantAutomatonStates: 83, 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.3s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 307 NumberOfCodeBlocks, 307 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 265 ConstructedInterpolants, 0 QuantifiedInterpolants, 2325 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-08-24 05:30:31,707 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...